Process algebra
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Petri net algebra
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Architecting families of software systems with process algebras
ACM Transactions on Software Engineering and Methodology (TOSEM)
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Non Interleaving Process Algebra
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
A Congruence Theorem for Structured Operational Semantics with Predicates
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
The box calculus: a new causal algebra with multi-label communication
Advances in Petri Nets 1992, The DEMON Project
A complete axiomatisation of branching bisimulation for process algebras with alternative quantification over data
Hi-index | 0.00 |
In process algebras like @mCRL and ACP communication is defined globally. In the context of component-based architectures one wishes to define subcomponents of a system separately, including communication within that subcomponent. We define a process algebra with an operator for local communication that facilitates component-based architectures. Besides being compositional, this language is aimed to be a more practical language (with respect to closely related languages) and also allows for straightforward modelling of synchronous as well as asynchronous behaviour.