Branching-time model checking of one-counter processes
From MaRDI portal
Publication:3113767
DOI10.4230/LIPIcs.STACS.2010.2472zbMath1230.68142OpenAlexW2962794883MaRDI QIDQ3113767
Publication date: 23 January 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_6ac5.html
Formal languages and automata (68Q45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Countdown games, and simulation on (succinct) one-counter nets, Bisimulation equivalence and regularity for real-time one-counter automata