Petri nets: an introduction
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
Selected papers of the Second Workshop on Concurrency and compositionality
Undecidability of bisimilarity for Petri nets and some related problems
STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Modular Construction and Partial Order Semantics of Petri Nets
Modular Construction and Partial Order Semantics of Petri Nets
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Operational Semantics for the Petri Box Calculus
CONCUR '94 Proceedings of the Concurrency Theory
A Petri Net Semantics for pi-Calculus
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Characterizing Behavioural Congruences for Petri Nets
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Asynchronous Observations of Processes
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
A Theory of "May" Testing for Asynchronous Languages
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
High-Level Petri Nets as Type Theories in the Join Calculus
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Testing Theories for Asynchronous Languages
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
A Compositional Partial Order Semantics for Petri Net Components
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Expired data collection in shared dataspaces
Theoretical Computer Science - Foundations of software science and computation structures
Comments on capabilities, limitations and “correctness” of Petri nets
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
On the bisimulation proof method
Mathematical Structures in Computer Science
Compositional semantics for open Petri nets based on deterministic processes
Mathematical Structures in Computer Science
Pure bigraphs: structure and dynamics
Information and Computation
Graph rewriting for the π-calculus
Mathematical Structures in Computer Science
A compositional Petri net translation of general π-calculus terms
Formal Aspects of Computing
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
On the Expressive Power of Restriction and Priorities in CCS with Replication
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Making the Unobservable, Unobservable
Electronic Notes in Theoretical Computer Science (ENTCS)
Event based service coordination over dynamic and heterogeneous networks
ICSOC'06 Proceedings of the 4th international conference on Service-Oriented Computing
Depth boundedness in multiset rewriting systems with name binding
RP'10 Proceedings of the 4th international conference on Reachability problems
Multiset rewriting: a semantic framework for concurrency with name binding
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Concurrency can't be observed, asynchronously
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Multiset rewriting for the verification of depth-bounded processes with name binding
Information and Computation
| Hi-index | 0.01 |
We present an encoding for (bound) processes of the asynchronous CCS with replication into open Petri nets: ordinary Petri nets equipped with a distinguished set of open places. The standard token game of nets models the reduction semantics of the calculus; the exchange of tokens on open places models the interactions between processes and their environment. The encoding preserves strong and weak CCS asynchronous bisimilarities: it thus represents a relevant step in establishing a precise correspondence between asynchronous calculi and (open) Petri nets. The work is intended as fostering the technology transfer between these formalisms: as an example, we discuss how some results on expressiveness can be transferred from the calculus to nets and back.