Communicating sequential processes
Communicating sequential processes
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
Capturing conflict and confusion in CSP
IFM'07 Proceedings of the 6th international conference on Integrated 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 |
In the development of concurrent systems two differing approaches have arisen: those with truly concurrent semantics and those with interleaving semantics. The difference between these two approaches is that 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 this paper we explore 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 occurence of another transition with which it does not interfere. Having provided a translation from Petri nets, a truly concurrent formalism, to CSP, an interleaving formalism, we demonstate 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 for two reasons. Firstly, from a practical point of view: to the author's knowledge, no existing tool for modelling Petri nets can perform these checks and we address that issue. Secondly, and perhaps more significantly, we bridge 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.