Вы здесь

Главная

эквивалентность

Связанные издания:

A Class of Stochastic Petri Nets with Step Semantics and Related Equivalence Notions
Action refinement and equivalence notions for timed event structures
A Decomposition of a Formal Specification: An Improved Constraint-Oriented Method
A Functional Programming System SFP: Sisal 3.1 Language Structures Decomposition
Algebraic equivalences of nested relational operators
All Action-Based Behavioural Equivalences are Undecidable for Labelled Petri Nets
A Logic Characteristic for Timed Extensions of Partial Oeder Based Equivalences
An Algorithm for Reducing Binary Branchings
An Axiomatisation of Duplication Equivalence in the Petri Box Calculus
An Efficient and Unified Approach to the Decidability of Equivalence of Propositional Programs
An Investigation of Back-Forth and Place Bisimulation Equivalences
An Investigation of Equivalence Notions on Some Subclasses of Petri Nets
An Investigation of -Equivalences
A Notion of Equivalence for Stochastic Petri Nets
A Process Algebra of Concurrent Constraint Programming
A Survey of Equivalence Notions for Net Based Systems
Axiomatisations of Weak Equivalences for De Simone Languages
Axiomatizations of Backtracking (extended abstract)
Back-Forth Equivalences for Design of Concurrent Systems
Behavioural Equivalence for Infinite Systems - Partially Decidable!
Bisimulation Equivalence for Hierarchical Petri Nets. Decision Problems
Bisimulation Equivalence is Decidable for all Context-Free Processes
Bisimulation Equivalence is Decidable for Basic Parallel Processes
Branching Time Equivalences for Interactive Markov Chains
Categorical Modelling of trace equivalence for timed automata models with invariants
Comparing Semantics Under Strong Timing of Petri Nets
Complexity of EOL Structural Equivalence
Compositional methods in characterization of timed event structures
Computer Science Logic: Proc./24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 2010
Concurrent Rewriting for Graphs with Equivalences
Consistent Equivalence Notion for Class of High Level Petri Nets
Decidability of Equivalence for Linear Letter to Letter Top-down Tree Transducers
Deciding on the Equivalence of a Relational Schema and an Object-Oriented Schema
Deciding Type Equivalence in a Language with Singleton Kinds
Detecting Equality fo Variables in Programs
Discrete and Computational Geometry and Graphs: Revised Selected Papers/16th Japanes Conference, JCDCGG 2013, Tokyo, Japan, September 2013
Distributed Bisimularity is Decidable for a Class of Infinite State-Space Systems
Dynamics of equivalence relations in automata networks
Efficient Representation of Algebraic Expressions
Eliminating Go to s while Preserving Program Structure
Equivalence-Checking with Infinite-State Systems: Techniques and Results
Equivalence Notions for Concurrent Systems and Refinement of Actions
Equivalence Notions for Design of Concurrent Systems Using Petri Nets
Equivalence Notions for Event Structures and Refinement of Actions
Equivalence of Relational Databases
Equivalence-Preserving Transformations of Inductive Properties of Prolog Programs
Equivalences and optimizations in an expressive XSLT subset
Equivalences for Concurrent and Distributed Systems
Equivalences on Petri Nets
Equivalent Transformation by Safe Extension of Data Structures