|
 
|
[BBL18] Exploiting Local Persistency for Reduced State Space Generation
Conférence Internationale avec comité de lecture : International Conference on Verification and Evaluation of Computer and Communication Systems VECoS 2018, October 2018, Vol. 11181, pp. pp 166-181, Series LNCS, Grenoble, France, (DOI: 10.1007/978-3-030-00359-3_11)Mots clés: Petri nets Reachability analysis State explosion problem Persistent sets Partial order techniques Step graphs
Résumé:
This paper deals with the partial order techniques of Petri nets, based on persistent sets and step graphs. To take advantage of the strengths of each method, it proposes the persistent step sets as a parametric combination of the both methods. The persistent step sets method allows to fix, for each marking, the set of transitions to be covered by the selected steps and then to control their maximal length and number. Moreover, this persistent step selective search preserves, at least, deadlocks of Petri nets.
This paper also provides two practical computation procedures of the persistent step sets based on the strong-persistent sets and the persistent sets, respectively.
BibTeX
| @inproceedings { | |||
| BBL18, | |||
| title | = | "{Exploiting Local Persistency for Reduced State Space Generation}", | |
| author | = | " K. Barkaoui and H. Boucheneb and . Li ", | |
| booktitle | = | "{International Conference on Verification and Evaluation of Computer and Communication Systems VECoS 2018}", | |
| year | = | 2018, | |
| edition | = | "Springer", | |
| month | = | "October", | |
| series | = | "LNCS", | |
| volume | = | 11181, | |
| pages | = | " pp 166-181", | |
| address | = | "Grenoble, France", | |
| doi | = | "10.1007/978-3-030-00359-3_11", | |
| } | |||
