Stubborn Sets for Simple Linear Time Properties

DOI10.1007/978-3-642-31131-4_13zbMath1357.68114OpenAlexW9285581MaRDI QIDQ2908210

Andreas Lehmann, Niels Lohmann, Karsten Schmidt

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) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)

Related Items (4)

Automata-driven partial order reduction and guided search for LTL model checking ⋮ Unnamed Item ⋮ Partial order reduction for reachability games ⋮ A lazy query scheme for reachability analysis in Petri nets

This page was built for publication: Stubborn Sets for Simple Linear Time Properties