The sweep-line state space exploration method

DOI10.1016/j.tcs.2011.12.036zbMath1238.68085DBLPjournals/tcs/JensenKM12OpenAlexW2133556419WikidataQ58624699 ScholiaQ58624699MaRDI QIDQ418783

Kurt Jensen, Thomas Mailund, Lars Michael Kristensen

Publication date: 30 May 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.036

zbMATH Keywords

verificationconcurrent systemsmodel checkingcoloured Petri netsexplicit state space explorationstate explosionsweep-line method

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• CPN/Tools
• Design/CPN
• SPIN
• DiVinE
• LoLA
• Murphi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lectures on Petri nets. 1: Basic models. Advances in Petri nets
• A theory of timed automata
• An improvement of McMillan's unfolding algorithm
• State space reduction using partial order techniques
• The ComBack Method – Extending Hash Compaction with Backtracking
• Coloured Petri Nets
• Tools and Algorithms for the Construction and Analysis of Systems
• Tools and Algorithms for the Construction and Analysis of Systems
• Revisiting Resistance Speeds Up I/O-Efficient LTL Model Checking
• Formal Methods in Computer-Aided Design
• Lectures on Concurrency and Petri Nets
• Computer Aided Verification

This page was built for publication: The sweep-line state space exploration method