Communicating sequential processes
Communicating sequential processes
Modeling concurrency with partial orders
International Journal of Parallel Programming
Extensional equivalence for transition systems
Acta Informatica
CCS—and its relationship to net theory
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
CCS is an (augmented) contact free C/E system
Advanced School on Mathematical models for the semantics of parallelism
Algebraic theory of processes
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
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
Towards the unification of models for concurrency
CAAP '90 Proceedings of the fifteenth colloquium on CAAP'90
Modelling nondeterministic concurrent processes with event structures
Fundamenta Informaticae
Causal trees interleaving + causality
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
The linear time-branching time spectrum (extended abstract)
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Nets, terms and formulas: three views of concurrent processes and their relationship
Nets, terms and formulas: three views of concurrent processes and their relationship
Universal axioms for bisimulations
Selected papers of the 3rd workshop on Concurrency and compositionality
History preserving, causal and mixed-ordering equivalence over stable event structures (note)
Fundamenta Informaticae
Flow models of distributed computations: three equivalent semantics for CCS
Information and Computation
Communication and Concurrency
On the Relationship of CCS and Petri Nets
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Distribution and Locality of Concurrent Systems
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Partial ordering derivations for CCS
FCT '85 Fundamentals of Computation Theory
Partial orderings descriptions and observations of nondeterministic concurrent processes
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
| Hi-index | 0.00 |
Three of the rewriting systems used by Degano, De Nicola and Montanari to provide Milner's CCS with a causality based semantics are compared by using also a fourth intermediate one. These rewriting systems have been used to associate Petri nets, Labelled Event Structures and structured sets of partial orderings to CCS terms. It is proved that the four rewriting systems yield computations from which the same causality relations among the executed actions can be extracted, thus it is established that the four partial ordering transitional semantics do coincide.