Verification of Petri Nets with Read Arcs

Schwoon, Stefan

doi:10.1007/978-3-642-32940-1_33

Cited by 14 publications

(25 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Around 10 optimizations for reducing the solving time are implemented. We highlight, e.g., the elimination of stubborn events [9], i.e., certain events that negatively impact the performance of Minisat's unit-propagation; or the reductions of the asymmetric conflict graph, see [9]. In our benchmarks, Cna has better accumulated solving time than previously existing verification tools [9], which proves that Cna's algorithms are practical.…”

Section: Cunf and Cna's Algorithms And Their Implementationmentioning

confidence: 74%

“…In this paper, we present Cunf the first tool for constructing and analyzing c-net unfoldings, freely available from [8]. The theoretical basis of the tool was presented in [2,1,9].…”

Section: Overviewmentioning

confidence: 99%

“…These questions drove our experiments [1,9]. Considerable effort was invested into assuring the efficiency and correctness of the unfolder and analyser.…”

Section: Experiments and Applications For The Toolmentioning

confidence: 99%

“…A network of asynchronous boolean gates can be modelled by a c-net, where each gadget encoding a boolean gate contains many read arcs [9]. Hazards are undesirable behaviours of ACs, whose existence reduces to a coverability question on the c-net [6].…”

Section: Experiments and Applications For The Toolmentioning

confidence: 99%

“…In this paper, we present Cunf the first tool for constructing and analyzing c-net unfoldings, freely available from [8]. The theoretical basis of the tool was presented in [2,1,9].We assume the reader is familiar to Petri nets [7]. A c-net is a Petri net where in addition to the ordinary arcs (arrows) between places and transitions, one may use read arcs.…”

mentioning

confidence: 99%

See 4 more Smart Citations

Cunf: A Tool for Unfolding and Verifying Petri Nets with Read Arcs

Schwoon

2013

Automated Technology for Verification and Analysis

Self Cite

View full text Add to dashboard Cite

Abstract. Cunf is a tool for building and analyzing unfoldings of Petri nets with read arcs. An unfolding represents the behaviour of a net by a partial order, effectively coping with the state-explosion problem stemming from the interleaving of concurrent actions. C-net unfoldings can be up to exponentially smaller than Petri net unfoldings, and recent work proposed algorithms for their construction and verification. Cunf is the first implementation of these techniques, it has been carefully engineered and optimized to ensure that the theoretical gains are put into practice. OverviewPetri nets are a model for concurrent, distributed systems. Unfoldings are a well-established technique for verifying properties of Petri nets; their use for this purpose was initially proposed by McMillan [6]. The unfolding of a (Petri) net is another net of acyclic structure that fully represents the state-space (reachable markings) of the first, see, e.g., fig. 1 (c). Because unfoldings represent behaviour by acyclic structures rather than by interleaved actions, they are often exponentially smaller than the state-space of N , and never larger than it.Recently, the unfolding construction was extended to Petri nets with read arcs, also called contextual nets (c-nets) [2]. This extension is partially motivated by the fact that c-net unfoldings can yet again be exponentially smaller than Petri net unfoldings. In this paper, we present Cunf the first tool for constructing and analyzing c-net unfoldings, freely available from [8]. The theoretical basis of the tool was presented in [2,1,9].We assume the reader is familiar to Petri nets [7]. A c-net is a Petri net where in addition to the ordinary arcs (arrows) between places and transitions, one may use read arcs. Figure 1 (a) shows a c-net, read arcs are the undirected lines; we say that t 2 reads p 4 . A marking enables t 2 if it puts tokens on places p 1 and p 4 ; but firing t 2 only consumes the token in p 1 , the token in p 4 remains there.Every c-net can be seen as the marking-equivalent Petri net that results from replacing read arcs for pairs of arcs, as in fig. 1 (a) and (b). Although both nets have the same markings, remark, however, that t 1 , t 2 are concurrent in (a), both read p 4 at the same time, but not in (b), as they compete for the token in p 4 .The unfolding of a bounded c-net N is another well-defined, finite, acyclic c-net P N , where each place (resp. transition) of P N is labelled by a place (resp. transition) of N and such that runs of P N are labelled by runs of N .

show abstract

Section: Cunf and Cna's Algorithms And Their Implementationmentioning

confidence: 74%

“…In this paper, we present Cunf the first tool for constructing and analyzing c-net unfoldings, freely available from [8]. The theoretical basis of the tool was presented in [2,1,9].…”

Section: Overviewmentioning

confidence: 99%

“…These questions drove our experiments [1,9]. Considerable effort was invested into assuring the efficiency and correctness of the unfolder and analyser.…”

Section: Experiments and Applications For The Toolmentioning

confidence: 99%

Section: Experiments and Applications For The Toolmentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations

Cunf: A Tool for Unfolding and Verifying Petri Nets with Read Arcs

Schwoon

2013

Automated Technology for Verification and Analysis

Self Cite

View full text Add to dashboard Cite

show abstract

Non-atomic Transition Firing in Contextual Nets

Chatain

Haar

Koutny

et al. 2015

Application and Theory of Petri Nets and Concurrency

Self Cite

View full text Add to dashboard Cite

The firing rule for Petri nets assumes instantaneous and simultaneous consumption and creation of tokens. In the context of ordinary Petri nets, this poses no particular problem because of the system's asynchronicity, even if token creation occurs later than token consumption in the firing. With read arcs, the situation changes, and several different choices of semantics are possible. The step semantics introduced by Janicki and Koutny can be seen as imposing a two-phase firing scheme: first, the presence of the required tokens is checked, then consumption and production of tokens happens. Pursuing this approach further, we develop a more general framework based on explicitly splitting the phases of firing, allowing to synthesize coherent steps. This turns out to define a more general non-atomic semantics, which has important potential for safety as it allows to detect errors that were missed by the previous semantics. Then we study the characterization of partial-order processes feasible under one or the other semantics.

show abstract