Abstract
We present an unfolding-based approach to LTL-X model-checking of high-level Petri nets. It is based on the method proposed by Esparza and Heljanko for low-level nets [4, 5] and a state of the art parallel high-level net unfolder described in [15, 13], We present experimental results comparing our approach to the one of [4, 5] and the model-checker SPIN [12]. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Schröter, C., & Khomenko, V. (2004). Parallel LTL-X model checking of high-level Petri nets based on unfoldings. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3114, 109–121. https://doi.org/10.1007/978-3-540-27813-9_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
