Communicating sequential processes
Communicating sequential processes
CSP-programs as nets with individual tokens
Advances in Petri Nets 1984
Nets, terms and formulas: three views of concurrent processes and their relationship
Nets, terms and formulas: three views of concurrent processes and their relationship
Model checking
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
On the composition of processes
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Partial Order and SOS Semantics for Linear Constraint Programs
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
Informal Introduction to Petri Nets
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Functional Equivalences of Petri Nets
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
Reliability analysis of CSP specifications using Petri nets and Markov processes
HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Adding conflict and confusion to CSP
FM'05 Proceedings of the 2005 international conference on Formal Methods
Distributed implementation of systems with multiparty interactions and priorities
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Hi-index | 0.00 |
Traditionally, developers of concurrent systems have adopted two distinct approaches: those with truly concurrent semantics and those with interleaving semantics. In the coarser interleaving interpretation parallelism can be captured in terms of non-determinism whereas in the finer, truly concurrent interpretation it cannot. Thus processes a ||b and a.b+b.a are identified within the interleaving approach but distinguished within the truly concurrent approach. In [5] we explored the truly concurrent notions of conflict, whereby transitions can occur individually but not together from a given state, and confusion, whereby the conflict set of a given transition is altered by the occurrence of another transition with which it does not interfere. We presented a translation from the truly concurrent formalism of Petri nets to the interleaving process algebra CSP and demonstrated how the CSP model-checker FDR can be used to detect the presence of both conflict and confusion in Petri nets. This work is of interest firstly because, to the author's knowledge, no existing tool for Petri nets can perform these checks, and secondly (and perhaps more significantly) because we bridged the gap between truly concurrent and interleaving formalisms, demonstrating that true concurrency can be captured in what is typically considered to be an interleaving language. In this paper we build on the work presented in [5] further embedding the truly concurrent notions of conflict and confusion in the interleaving formalism CSP by extending the domain of our translation from the simplistic subset of safe Petri nets, in which each place can hold at most one token, to standard Petri nets, in which the number of tokens in each place is unbounded.