On the Complexity of Ltl Model-Checking of Recursive State Machines

DOI10.1007/978-3-540-73420-8_80MaRDI QIDQ5428871zbMATH OpenOpenAlexFDO

Authors Salvatore La Torre, Gennaro Parlato

Publication date 28 November 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://eprints.soton.ac.uk/272464/1/fulltext%25282%2529.pdf

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Be lazy and don't care: faster CTL model checking for recursive state machines
• LTL model checking for recursive programs
• scientific article; zbMATH DE number 1796135
• Tools and Algorithms for the Construction and Analysis of Systems
• Model checking of recursive probabilistic systems

Cited in

(8)

• Timed recursive state machines: expressiveness and complexity
• scientific article; zbMATH DE number 1796135 (Why is no real title available?)
• Computer Science Logic
• Length of the state trace: a method for partitioning model complexity
• Be lazy and don't care: faster CTL model checking for recursive state machines
• LTL model checking for recursive programs
• Visibly pushdown modular games
• Two variable vs. linear temporal logic in model checking and games

This page was built for publication: On the Complexity of Ltl Model-Checking of Recursive State Machines

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