Stubborn sets for simple linear time properties

DOI10.1007/978-3-642-31131-4_13MaRDI QIDQ2908210zbMATH OpenOpenAlexFDO

Authors Andreas Lehmann, Niels Lohmann, Karsten Wolf

Publication date 4 September 2012

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

Full work available at URL https://doi.org/10.1007/978-3-642-31131-4_13

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On Stubborn Sets in the Verification of Linear Time Temporal Properties
• On stubborn sets in the verification of linear time temporal properties
• scientific article; zbMATH DE number 177511
• scientific article; zbMATH DE number 1278351
• scientific article; zbMATH DE number 177237

Cited in

(10)

• Partial order reduction for reachability games
• A lazy query scheme for reachability analysis in Petri nets
• Stubborn Sets, Frozen Actions, and Fair Testing
• scientific article; zbMATH DE number 6017853 (Why is no real title available?)
• Stubborn set reduction for two-player reachability games
• Automata-driven partial order reduction and guided search for LTL model checking
• Invariance properties of RAMs and linear time
• Experimenting with stubborn sets on Petri nets
• On Stubborn Sets in the Verification of Linear Time Temporal Properties
• On stubborn sets in the verification of linear time temporal properties

This page was built for publication: Stubborn sets for simple linear time properties

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