Petri nets: an introduction
Communicating sequential processes
Communicating sequential processes
Petri net models for algebraic theories of concurrency
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
CCS is an (augmented) contact free C/E system
Advanced School on Mathematical models for the semantics of parallelism
Information and Computation
Conference proceedings on Algebraic methodology and software technology
Finite representations of CCS and TCSP programs by automata and Petri nets
Finite representations of CCS and TCSP programs by automata and Petri nets
A partial ordering semantics for CCS
Theoretical Computer Science
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
SCONE: a simple calculus of nets
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Axiomatizing CCS, nets and processes
Science of Computer Programming
Communication and Concurrency
Event Structure Semantics for CCS and Related Languages
Proceedings of the 9th Colloquium on Automata, Languages and Programming
On the Relationship of CCS and Petri Nets
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Operational Petri net semantics for CCSP
Advances in Petri Nets 1987, covers the 7th European Workshop on Applications and Theory of Petri Nets
Distributed Implementation of CCS
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
Partial orderings descriptions and observations of nondeterministic concurrent processes
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
An Algebraic View of Interleaving and Distributed Operational Semantics for CCS
Category Theory and Computer Science
Hi-index | 0.00 |
Many approaches have been developed with the aim of capturing the advantages of both process algebras and Petri nets in terms of modularity and structure on one side and faithful description of concurrency on the other. A natural way of merging these different models is to express the semantics of process algebras in terms of Petri nets. In this work we present a modular construction of operational models for CCS via different groups of structural axioms. To express them, we use Equational Type Logic (ETL), a formalism based on conditional axioms on typed algebras. Typed algebras can be used with profit to present transition systems where both states and transitions have algebraic structure, as opposed to the usual SOS approach where only states have structure. We build an algebra in which different types give different views of the language. In fact, different subalgebras live together in the same structure and are related by axioms. They represent: i) the transition system of CCS; ii) an unfolded version of it; iii) a net for CCS and its marking graph; and iv) a folded version of the latter with the same states as i). The model is completely compositional, since CCS operations are defined on all state representations. We also present axioms which directly establish the relation between interleaving and truly concurrent semantics for CCS. Finally, some related work is discussed and the relation of our models with two previous proposals is shown in detail.