Efficient symbolic state-space construction for asynchronous systems

DOI10.1007/3-540-44988-4_8MaRDI QIDQ2766555zbMATH OpenFDO

Authors Gianfranco Ciardo, Gerald Lüttgen, Radu I. Siminiceanu

Publication date 17 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44988-4_8

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision Diagrams
• Saturation: an efficient iteration strategy for symbolic state-space generation
• Structural symbolic CTL model checking of asynchronous systems.
• Efficient hybrid reachability analysis for asynchronous concurrent systems
• Applications and Theory of Petri Nets 2004

Cited in

(9)

• Exploiting interleaving semantics in symbolic state-space generation
• Saturation: an efficient iteration strategy for symbolic state-space generation
• From synchronous programs to symbolic representations of hybrid systems
• MC-SOG: An LTL Model Checker Based on Symbolic Observation Graphs
• Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision Diagrams
• Exploiting symmetry of state tree structures for discrete-event systems with parallel components
• Efficient hybrid reachability analysis for asynchronous concurrent systems
• Structural symbolic CTL model checking of asynchronous systems.
• Symbolic state estimation in bounded timed labeled Petri nets

Describes a project that uses

Uses Software

• BDDNOW
• SPIN

This page was built for publication: Efficient symbolic state-space construction for asynchronous systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2766555)