TAPAAL and Reachability Analysis of P/T Nets

Jensen, Jonas Finnemann; Nielsen, Thomas D.; Oestergaard, Lars Kaerlund; Srba, Jǐŕı

doi:10.1007/978-3-662-53401-4_16

Cited by 23 publications

(11 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Last but not least, we implement the distributed algorithm in an extensible open source framework and we demonstrate the applicability of the framework on CTL model checking of Petri nets. In order to do so, we integrate the framework into the tool TAPAAL [16,17] and run a series of experiments on the Petri net models and queries from the Model Checking Contest (MCC) 2016 [18]. A single-core prototype of the tool implementing the negation edges and certain zero backpropagation also participated in the 2017 competition and was awarded a silver medal in the category of CTL verification with 23940 points for CTL cardinality queries, while the tool LoLA [19] took the gold medal with 28652 points in this subcategory (which includes colored net models that our tool does not support yet).…”

Section: Introductionmentioning

confidence: 99%

A Distributed Fixed-Point Algorithm for Extended Dependency Graphs*

Dalsgaard

Enevoldsen

Fogh

et al. 2018

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Introductionmentioning

confidence: 99%

A Distributed Fixed-Point Algorithm for Extended Dependency Graphs*

Dalsgaard

Enevoldsen

Fogh

et al. 2018

Self Cite

View full text Add to dashboard Cite

show abstract

“…The currently released version 3.4.3 of TAPAAL (available at www.tapaal.net) won two gold medals in the reachability and CTL category and one silver medal in upper-bounds at MCC'18. [25] is the one that participates at MCC and it relies on a preprocessing of both the Petri net model as well as the verified query. The subformulas of CTL queries are recursively analysed [12] with the use of state-equations and linear programming techniques in order to discover easyto-solve subqueries to reduce the overall query size.…”

Section: Tapaalmentioning

confidence: 99%

Presentation of the 9th Edition of the Model Checking Contest

Amparore

Berthomieu

Ciardo

et al. 2019

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

The Model Checking Contest (MCC) is an annual competition of software tools for model checking. Tools must process an increasing benchmark gathered from the whole community and may participate in various examinations: state space generation, computation of global properties, computation of some upper bounds in the model, evaluation of reachability formulas, evaluation of CTL formulas, and evaluation of LTL formulas.For each examination and each model instance, participating tools are provided with up to 3600 s and 16 gigabyte of memory. Then, tool answers are analyzed and confronted to the results produced by other competing tools to detect diverging answers (which are quite rare at this stage of the competition, and lead to penalties).For each examination, golden, silver, and bronze medals are attributed to the three best tools. CPU usage and memory consumption are reported, which is also valuable information for tool developers.

show abstract

“…In this experiment, we compare the performance of the tool TAPAAL [8] and its engine VerifyPN [21], version 2.1.0, on the Petri net models and CTL queries from the 2016 Model Checking Contest [22]. From the database of models and queries, we selected all those that do not contain logical negation in the CTL query (as they are not supported by the current implementation of abstract dependency graphs).…”

Section: Ctl Model Checking Of Petri Netsmentioning

confidence: 99%

Abstract Dependency Graphs and Their Application to Model Checking

Enevoldsen

Larsen

Srba

2019

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

Dependency graphs, invented by Liu and Smolka in 1998, are oriented graphs with hyperedges that represent dependencies among the values of the vertices. Numerous model checking problems are reducible to a computation of the minimum fixed-point vertex assignment. Recent works successfully extended the assignments in dependency graphs from the Boolean domain into more general domains in order to speed up the fixed-point computation or to apply the formalism to a more general setting of e.g. weighted logics. All these extensions require separate correctness proofs of the fixed-point algorithm as well as a one-purpose implementation. We suggest the notion of abstract dependency graphs where the vertex assignment is defined over an abstract algebraic structure of Noetherian partial orders with the least element. We show that existing approaches are concrete instances of our general framework and provide an open-source C++ library that implements the abstract algorithm. We demonstrate that the performance of our generic implementation is comparable to, and sometimes even outperforms, dedicated special-purpose algorithms presented in the literature.

show abstract

TAPAAL and Reachability Analysis of P/T Nets

Cited by 23 publications

References 9 publications

A Distributed Fixed-Point Algorithm for Extended Dependency Graphs*

A Distributed Fixed-Point Algorithm for Extended Dependency Graphs*

Presentation of the 9th Edition of the Model Checking Contest

Abstract Dependency Graphs and Their Application to Model Checking

Contact Info

Product

Resources

About