Lossy Counter Machines Decidability Cheat Sheet
From MaRDI portal
Publication:3584961
DOI10.1007/978-3-642-15349-5_4zbMath1287.68101OpenAlexW1496021453MaRDI QIDQ3584961
Publication date: 31 August 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15349-5_4
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (11)
Forward analysis and model checking for trace bounded WSTS ⋮ Unnamed Item ⋮ Undecidable Propositional Bimodal Logics and One-Variable First-Order Linear Temporal Logics with Counting ⋮ Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals ⋮ Multiply-Recursive Upper Bounds with Higman’s Lemma ⋮ Computable fixpoints in well-structured symbolic model checking ⋮ Lost in abstraction: monotonicity in multi-threaded programs ⋮ On the termination and structural termination problems for counter machines with incrementing errors ⋮ Unnamed Item ⋮ The Parametric Complexity of Lossy Counter Machines ⋮ Unnamed Item
Uses Software
This page was built for publication: Lossy Counter Machines Decidability Cheat Sheet