Branching-Time Model Checking of One-Counter Processes and Timed Automata

DOI10.1137/120876435zbMath1275.68092OpenAlexW2078894460MaRDI QIDQ2848205

Stefan Göller, Markus Lohrey

Publication date: 25 September 2013

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/120876435

zbMATH Keywords

timed automataone-counter automatacomputation free logic model checking

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (5)

Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic ⋮ Equivalence between model-checking flat counter systems and Presburger arithmetic ⋮ Unnamed Item ⋮ On the complexity of resource-bounded logics ⋮ The Complexity of Flat Freeze LTL

This page was built for publication: Branching-Time Model Checking of One-Counter Processes and Timed Automata