A context dependent equivalence between processes
Theoretical Computer Science
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Controlling interference in ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Theoretical Computer Science
Communicating sequential processes
Communications of the ACM
From rewrite rules to bisimulation congruences
Theoretical Computer Science
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
A Calculus of Mobile Resources
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
BioAmbients: an abstraction for biological compartments
Theoretical Computer Science - Special issue: Computational systems biology
Flow Logic for Process Calculi
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
In the context of process algebras it is customary to define semantics in the form of a reaction relation supported by a structural congruence relation. Recently process algebras have grown more expressive in order to meet the modelling demands of fields as diverse as business modelling and systems biology. This leads to combining various features, such as general choice and parallelism that were previously studied separately, and it often becomes difficult to define the reaction semantics. We present a general approach based on active evaluation contexts that allows the reaction semantics to be easily constructed.