A Distributed Fixed-Point Algorithm for Extended Dependency Graphs*

Dalsgaard, Andreas Engelbredt; Enevoldsen, Søren; Fogh, Peter; Jensen, Lars Rosgaard; Jensen, Peter Gjøl; Jepsen, Tobias Skovgaard; Kaufmann, Isabella; Larsen, Kim Guldstrand; Nielsen, Søren M.; Olesen, Mads Chr.; Pastva, Samuel; Srba, Jǐŕı

doi:10.3233/fi-2018-1707

Cited by 9 publications

(6 citation statements)

References 26 publications

(40 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our experiments presented in Sect. 6 show a clear advantage of the certainzero algorithm over the classical one, as also demonstrated in [19].…”

Section: Certain-zero Dependency Graphssupporting

confidence: 57%

“…On the other hand, if the final value of the root is 0 then the whole graph has to be explored and no early termination is possible. Recently, it has been noticed [19] that the speed of fixed-point computation by Liu and Smolka's algorithm can been considerably improved by considering also certain-zero value in the assignment that can, in certain situations, propagate from children vertices to their parents and once it reaches the root vertex, the algorithm can early terminate.…”

Section: Certain-zero Dependency Graphsmentioning

confidence: 99%

“…so that it rephrases the method described in [19]. In order to achieve a competitive performance, we use the following ignore function.…”

Section: Certain-zero Dependency Graphsmentioning

confidence: 99%

See 2 more Smart Citations

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

“…Our experiments presented in Sect. 6 show a clear advantage of the certainzero algorithm over the classical one, as also demonstrated in [19].…”

Section: Certain-zero Dependency Graphssupporting

confidence: 57%

Section: Certain-zero Dependency Graphsmentioning

confidence: 99%

See 1 more Smart Citation

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

show abstract

“…The verification of colored Petri nets is achieved by a selfcontained unfolder implemented in the verifypn engine in combination with over-approximation by state-equations applied for a given query on the colored net before its unfolding. Furthermore the tool employs a state-of-the-art dependency-graph technique for verification of CTL properties, utilizing the socalled certain zero optimization [17]. Another critical component is an efficient successor-generator, which paired with a compressing, time and memory-efficient state-storage data structure PTrie [26] gives verifypn a competitive advantage in MCC.…”

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

“…We propose approximate syntax-driven conditions of a stable Petri net game reduction satisfying the sufficient conditions for our stable reductions and demonstrate their applicability in an efficient, open source implementation in the model checker TAPAAL [8]. Our implementation is based on dependency graphs, following the approach from [7,17], and we demonstrate on several case studies that the computation of the stubborn sets only has a minor overhead while having the potential of achieving exponential reduction both in the running time as well as in the number of searched configurations. To the best of our knowledge, this is the first efficient implementation of a 2-player game partial order reduction technique for Petri nets games.…”

Section: Introductionmentioning

confidence: 99%

Stubborn Set Reduction for Two-Player Reachability Games

Bønneland,

Jensen,

Larsen

et al. 2019

Preprint

Self Cite

View full text Add to dashboard Cite

Partial order reductions have been successfully applied to model checking of concurrent systems and practical applications of the technique show nontrivial reduction in the size of the explored state space. We present a theory of partial order reduction based on stubborn sets in the game-theoretical setting of 2-player games with reachability objectives. Our stubborn reduction allows us to prune the interleaving behaviour of both players in the game, and we formally prove its correctness on the class of games played on general labelled transition systems. We then instantiate the framework to the class of weighted Petri net games with inhibitor arcs and provide its efficient implementation in the model checker TAPAAL. Finally, we evaluate our stubborn reduction on several case studies and demonstrate its efficiency.

show abstract

A Distributed Fixed-Point Algorithm for Extended Dependency Graphs*

Cited by 9 publications

References 26 publications

Abstract Dependency Graphs and Their Application to Model Checking

Abstract Dependency Graphs and Their Application to Model Checking

Presentation of the 9th Edition of the Model Checking Contest

Stubborn Set Reduction for Two-Player Reachability Games

Contact Info

Product

Resources

About