Branching-time model checking of one-counter processes

From MaRDI portal

Revision as of 21:51, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3113767

Jump to:navigation, search

DOI10.4230/LIPIcs.STACS.2010.2472zbMath1230.68142OpenAlexW2962794883MaRDI QIDQ3113767

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

model checking complexity theory computation tree logic

Mathematics Subject Classification ID

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 (2)

Countdown games, and simulation on (succinct) one-counter nets ⋮ Bisimulation equivalence and regularity for real-time one-counter automata

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3113767&oldid=16204689"