Communicating sequential processes
Communicating sequential processes
Process algebra
Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM (JACM)
Undecidability of bisimilarity for Petri nets and some related problems
STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
A polynomial algorithm for deciding bisimilarity of normed context-free processes
Theoretical Computer Science
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
UPPAAL—a tool suite for automatic verification of real-time systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Languages, behaviors, hybrid architectures, and motion control
Mathematical control theory
Introduction to the Theory of Computation: Preliminary Edition
Introduction to the Theory of Computation: Preliminary Edition
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Composition, decomposition and model checking of pushdown processes
Nordic Journal of Computing
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Theoretical Computer Science - Game theory meets theoretical computer science
Introduction to Discrete Event Systems
Introduction to Discrete Event Systems
Maneuver-based motion planning for nonlinear systems with symmetries
IEEE Transactions on Robotics
Automatica (Journal of IFAC)
| Hi-index | 0.00 |
We introduce a new formalism to compose interacting heterogeneous systems described by extended motion description languages (mdles). The novelty lies in producing a composed system whose behavior could be a superset of the union of the behaviors of its generators. In the class of systems modeled using mdles, the composition operator is closed, and language equivalence can be decidable. Our approach consists of representing mdles as normed processes, recursively defined as a guarded system of recursion equations in restricted Greibach Normal Form over a basic process algebra. Basic processes have well defined semantics for composition, which we exploit to establish the properties of our composed mdles.