Net reductions for LTL model-checking

DOI10.1007/3-540-44798-9_25MaRDI QIDQ4787241zbMATH OpenFDO

Authors Javier Esparza, Claus Schröter

Publication date 9 January 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/2144/21440310

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)

Recommendations

• Decompositional Petri Net Reductions
• Pre- and post-agglomerations for LTL model checking
• Model checking LTL using constraint programming
• Applications and Theory of Petri Nets 2004
• scientific article; zbMATH DE number 1822435

Cited in

(13)

• A theory of structural stationarity in the \(\pi\)-calculus
• On the combination of polyhedral abstraction and SMT-based model checking for Petri nets
• Automata-driven partial order reduction and guided search for LTL model checking
• Simplification of CTL formulae for efficient model checking of Petri nets
• Counterexample-preserving reduction for symbolic model checking
• Pre- and post-agglomerations for LTL model checking
• Counterexample-preserving reduction for symbolic model checking
• Decompositional Petri Net Reductions
• Computing Petri net languages by reductions
• Structural reductions revisited
• LTL model checking with Neco
• Petri Net Reductions for Counting Markings
• Model checking LTL using constraint programming

This page was built for publication: Net reductions for LTL model-checking

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