Sequential and distributed model checking of Petri nets


Bell, Alexander and Haverkort, Boudewijn R. (2005) Sequential and distributed model checking of Petri nets. International Journal on Software Tools for Technology Transfer (STTT), 7 (1). pp. 43-60. ISSN 1433-2779

[img] PDF
Restricted to UT campus only
: Request a copy
Abstract:In this paper we present sequential as well as distributed algorithms for model checking computational tree logic over finite-state systems specified as Petri nets. The algorithms rely on an explicit representation of the systemrsquos state space but do not require the transition relation to be explicitly available; it is recomputed whenever required. This approach allows us to model check very large systems, with hundreds of millions of states, in a fast and efficient way. For the case studies addressed, the distributed algorithms scale very well, as they show efficiencies in the range of 60% to 95%, depending on the test cases and case studies at hand.
Item Type:Article
Additional information:Imported from research group DACS (ID number 433)
Copyright:© 2006 Springer
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 224117