Branching-time model checking of one-counter processes

DOI10.4230/LIPICS.STACS.2010.2472MaRDI QIDQ3113767zbMATH OpenOpenAlexFDO

Authors Stefan Göller, Markus Lohrey

Publication date 23 January 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_6ac5.html

zbMATH Keywords

complexity theorycomputation tree logicmodel checking

Mathematics Subject Classification ID

Logic in computer science (03B70) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Branching-time model checking of one-counter processes and timed automata
• On the complexity of model-checking branching and alternating-time temporal logics in one-counter systems
• Model Checking FO(R) over One-Counter Processes and beyond
• Verification, Model Checking, and Abstract Interpretation
• Branching-time model checking of parametric one-counter automata

Cited in

(7)

• Bisimulation equivalence and regularity for real-time one-counter automata
• scientific article; zbMATH DE number 1670834 (Why is no real title available?)
• Branching-time model checking of one-counter processes and timed automata
• Branching-time model checking of parametric one-counter automata
• On the complexity of model-checking branching and alternating-time temporal logics in one-counter systems
• Model Checking FO(R) over One-Counter Processes and beyond
• Countdown games, and simulation on (succinct) one-counter nets

This page was built for publication: Branching-time model checking of one-counter processes

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