Bounded reachability checking with process semantics

DOI10.1007/3-540-44685-0_15MaRDI QIDQ4791837zbMATH OpenFDO

Authors Keijo Heljanko

Publication date 3 February 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2154/21540218.htm

Mathematics Subject Classification ID

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

Recommendations

• Checking bounded reachability in asynchronous systems by symbolic event tracing
• Bounded Reachability Checking of Asynchronous Systems Using Decision Diagrams
• Automated Technology for Verification and Analysis
• Bounded LTL model checking with stable models
• Bounded ITL model checking with stable models

Cited in

(12)

• Planning as satisfiability: parallel plans and algorithms for plan search
• Under-approximation of reachability in multivalued asynchronous networks
• Bounded synthesis for Petri games
• Bounded Asynchrony: Concurrency for Modeling Cell-Cell Interactions
• Checking bounded reachability in asynchronous systems by symbolic event tracing
• A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
• Exploiting step semantics for efficient bounded model checking of asynchronous systems
• Bounded ITL model checking with stable models
• Bounded LTL model checking with stable models
• A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking
• Bounded Reachability Checking of Asynchronous Systems Using Decision Diagrams
• Using transition set sequences to partition behaviors of Petri nets

This page was built for publication: Bounded reachability checking with process semantics

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