Optimized Colored Nets Unfolding

Kordon, Fabrice; Linard, Alban; Paviot-Adet, Emmanuel

doi:10.1007/11888116_25

Cited by 20 publications

(12 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are some usual sufficient conditions preventing the previous circumstances to occur. For instance, the use of finite domains for variables, as well as the use of mapping having finite images for the case of infinite variable domains, allows to avoid having an infinite number of different tokens [12,30]. With respect to the possibility of having an infinite number of repeated tokens in the 652 E. GONZÁLEZ-LÓPEZ DE MURILLAS ET AL.…”

Section: Computation Of the Reachability Graphmentioning

confidence: 99%

Parallel computation of the reachability graph of petri net models with semantic information

et al. 2016

View full text Add to dashboard Cite

Summary Formal verification plays a crucial role when dealing with correctness of systems. In a previous work, the authors proposed a class of models, the Unary Resource Description Framework Petri Nets (U‐RDF‐PN), which integrated Petri nets and (RDF‐based) semantic information. The work also proposed a model checking approach for the analysis of system behavioural properties that made use of the net reachability graph. Computing such a graph, specially when dealing with high‐level structures as RDF graphs, is a very expensive task that must be considered. This paper describes the development of a parallel solution for the computation of the reachability graph of U‐RDF‐PN models. Besides that, the paper presents some experimental results when the tool was deployed in cluster and cloud frameworks. The results not only show the improvement in the total time required for computing the graph, but also the high scalability of the solution, which make it very useful thanks to the current (and future) availability of cloud infrastructures. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

Section: Computation Of the Reachability Graphmentioning

confidence: 99%

Parallel computation of the reachability graph of petri net models with semantic information

et al. 2016

View full text Add to dashboard Cite

show abstract

“…The scaling parameter is the number of machines. The following values were used: 5,10,15,20,30,40,50,100,200, 300, 400, 500.…”

Section: Models From Mcc'2011mentioning

confidence: 99%

Report on the Model Checking Contest at Petri Nets 2011

Kordon

Linard

Buchs

et al. 2012

Transactions on Petri Nets and Other Models of Concurrency VI

Self Cite

View full text Add to dashboard Cite

Abstract. This article presents the results of the Model Checking Contest held within the SUMo 2011 workshop, a satellite event of Petri Nets 2011. This contest aimed at a fair and experimental evaluation of the performances of model checking techniques applied to Petri nets. The participating tools were compared on several examinations (state space generation, deadlock detection and evaluation of reachability formulae) run on a set of common models (Place/Transition and Symmetric Petri nets). The collected data gave some hints about the way techniques can scale up depending on both examinations and the characteristics of the models. This paper also presents the lessons learned from the organizer's point of view. It discusses the enhancements required for future editions of the Model Checking Contest event at the Petri Nets conference.

show abstract

“…[16][17][18][19][20][21], and Transmit Packet from Network (ll. [22][23][24][25][26][27][28][29]. Like places, all transitions are referred to by a generated identifier rather that their user-recognisable name.…”

Section: The Old Sml Interfacementioning

confidence: 99%

“…We then load the state-space algorithm developed previously (l. 23), and launch an exploration (ll. [24][25][26][27][28][29][30]. We process the result of the exploration so the result we show the user is the violating state (if any) and the number of nodes explored.…”

Section: Command-line State-space Analysermentioning

confidence: 99%