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

DOI10.1007/978-3-540-73420-8_80zbMath1171.68552OpenAlexW1777291824MaRDI QIDQ5428871

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

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

Related Items (2)

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