Counter machines: Decidable properties and applications to verification problems
From MaRDI portal
Recommendations
- Counter machines and verification problems.
- Counter machines: Decision problems and applications
- New Decidability Results Concerning Two-Way Counter Machines
- Reachability analysis for some models of infinite-state transition systems
- New decidability results concerning two-way counter machines and applications
Cited in
(34)- An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines
- Generalized discrete timed automata: Decidable approximations for safety verification.
- Reachability analysis of reversal-bounded automata on series-parallel graphs
- Counter machines and verification problems.
- Eliminating the storage tape in reachability constructions.
- Dense-choice counter machines revisited
- On the termination and structural termination problems for counter machines with incrementing errors
- On the complexity of decision problems for counter machines with applications to coding theory
- On the termination problem for counter machines with incrementing errors
- On store languages and applications
- VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES
- Orchestrated session compliance
- ON COUNTER MACHINES, REACHABILITY PROBLEMS, AND DIOPHANTINE EQUATIONS
- Lossy counter machines decidability cheat sheet
- scientific article; zbMATH DE number 3974295 (Why is no real title available?)
- New Decidability Results Concerning Two-Way Counter Machines
- scientific article; zbMATH DE number 1948510 (Why is no real title available?)
- scientific article; zbMATH DE number 2081100 (Why is no real title available?)
- Reachability analysis for some models of infinite-state transition systems
- New decidability results concerning two-way counter machines and applications
- Counter machines: Decision problems and applications
- Reachability analysis of reversal-bounded automata on series-parallel graphs
- On reachability and safety in infinite-state systems
- On the Complexity of Verifying Regular Properties on Flat Counter Systems,
- On Counter Machines versus dP Automata
- Semilinearity of families of languages
- Witness runs for counter machines
- Witness Runs for Counter Machines
- Dense counter machines and verification problems.
- Boundedness problems for Minsky counter machines
- Reasoning about reversal-bounded counter machines
- Counter machines with infrequent reversals
- Store languages of Turing machines and counter machines
- An automata-theoretic approach to constraint LTL
This page was built for publication: Counter machines: Decidable properties and applications to verification problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536378)
