Lossy counter machines decidability cheat sheet

DOI10.1007/978-3-642-15349-5_4MaRDI QIDQ3584961zbMATH OpenOpenAlexFDO

Authors Philippe Schnoebelen

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Undecidable problems in unreliable computations.
• scientific article; zbMATH DE number 1512704
• Publication:4941150
• scientific article; zbMATH DE number 1759429
• Counter machines and verification problems.

Cited in

(15)

• Undecidable problems in unreliable computations.
• Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals
• On the termination and structural termination problems for counter machines with incrementing errors
• Computable fixpoints in well-structured symbolic model checking
• Forward analysis and model checking for trace bounded WSTS
• Undecidable propositional bimodal logics and one-variable first-order linear temporal logics with counting
• Multiply-recursive upper bounds with Higman's lemma
• scientific article; zbMATH DE number 1512704 (Why is no real title available?)
• Regular separability of one counter automata
• The Parametric Complexity of Lossy Counter Machines
• Forward analysis for WSTS. III: Karp-Miller trees
• Forward analysis for WSTS. III: Karp-Miller trees
• Counter abstraction for regular open teams
• Lost in abstraction: monotonicity in multi-threaded programs
• Languages of boundedly-ambiguous vector addition systems with states

Describes a project that uses

Uses Software

• TaPAS

This page was built for publication: Lossy counter machines decidability cheat sheet

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