Compositional model checking of concurrent systems, with Petri nets
Abstract
Compositionality and process equivalence are both standard concepts of process algebra. Compositionality means that the behaviour of a compound system relies only on the behaviour of its components, i.e. there is no emergent behaviour. Process equivalence means that the explicit statespace of a system takes a back seat to its interaction patterns: the information that an environment can obtain though interaction. Petri nets are a classical, yet widely used and understood, model of concurrency. Nevertheless, they have often been described as a noncompositional model, and tools tend to deal with monolithic, globallyspecified models. This tutorial paper concentrates on Petri Nets with Boundaries (PNB): a compositional, graphical algebra of 1safe nets, and its applications to reachability checking within the tool Penrose. The algorithms feature the use of compositionality and process equivalence, a powerful combination that can be harnessed to improve the performance of checking reachability and coverability in several common examples where Petri nets model realistic concurrent systems.
 Publication:

arXiv eprints
 Pub Date:
 March 2016
 DOI:
 10.48550/arXiv.1603.00976
 arXiv:
 arXiv:1603.00976
 Bibcode:
 2016arXiv160300976S
 Keywords:

 Computer Science  Logic in Computer Science;
 Computer Science  Formal Languages and Automata Theory;
 Computer Science  Software Engineering
 EPrint:
 In Proceedings DCM 2015, arXiv:1603.00536