Counter machines and verification problems.
From MaRDI portal
Recommendations
- Dense counter machines and verification problems.
- scientific article; zbMATH DE number 1759429
- Publication:4941150
- On the use of counters for reproducing deterministic test sets
- Approximate verification and enumeration problems
- ON COUNTER MACHINES, REACHABILITY PROBLEMS, AND DIOPHANTINE EQUATIONS
- Machine-assisted proofs
- Counter machines, Petri nets, and consensual computation
- The use of machines to assist in rigorous proof
Cites work
- scientific article; zbMATH DE number 1670769 (Why is no real title available?)
- scientific article; zbMATH DE number 1500528 (Why is no real title available?)
- scientific article; zbMATH DE number 1759429 (Why is no real title available?)
- scientific article; zbMATH DE number 1796157 (Why is no real title available?)
- scientific article; zbMATH DE number 3336816 (Why is no real title available?)
- A theory of timed automata
- An NP-Complete Number-Theoretic Problem
- Analysis of a class of communicating finite state machines
- Bounded Algol-Like Languages
- Decidability of model checking for infinite-state concurrent systems
- Deterministic one-counter automata
- New Decidability Results Concerning Two-Way Counter Machines
- On Context-Free Languages
- Reachability analysis of pushdown automata: Application to model-checking
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Reversal-bounded multipushdown machines
- Simple counter machines and number-theoretic problems
- Verifying programs with unreliable channels
Cited in
(27)- Dense counter machines and verification problems.
- Reachability analysis of reversal-bounded automata on series-parallel graphs
- On reachability and safety in infinite-state systems
- Alternating two-way AC-tree automata
- Unboundedness problems for machines with reversal-bounded counters
- The complexity of reversal-bounded model-checking
- Past pushdown timed automata and safety verification.
- Witness runs for counter machines
- Reasoning about reversal-bounded counter machines
- On families of full trios containing counter machine languages
- On store languages of language acceptors
- Lossy counter machines decidability cheat sheet
- scientific article; zbMATH DE number 1759429 (Why is no real title available?)
- scientific article; zbMATH DE number 1408336 (Why is no real title available?)
- scientific article; zbMATH DE number 2081100 (Why is no real title available?)
- On selective unboundedness of VASS
- Semilinearity of families of languages
- Reachability analysis of reversal-bounded automata on series-parallel graphs
- scientific article; zbMATH DE number 1759611 (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 1836416 (Why is no real title available?)
- VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES
- An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines
- State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs
- scientific article; zbMATH DE number 3974295 (Why is no real title available?)
- Reversal-bounded multicounter ?-machines
This page was built for publication: Counter machines and verification problems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853523)
