Dense-choice counter machines revisited

DOI10.1016/J.TCS.2014.04.029MaRDI QIDQ2015129zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 23 June 2014

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2014.04.029

zbMATH Keywords

counter machinesmixed real-integer logicreachabilityreversal-boundedverification

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45)

Recommendations

• Dense counter machines and verification problems.
• On Counter Machines versus dP Automata
• scientific article; zbMATH DE number 1759429
• Deterministic counter machines and parallel matching computations
• Reversal-Bounded Counter Machines Revisited
• On the complexity of decision problems for counter machines with applications to coding theory
• New decidability results concerning two-way counter machines and applications
• New Decidability Results Concerning Two-Way Counter Machines
• Nondeterministic multicounter machines and complementation
• Publication:4941150

Cites work

• A theory of timed automata
• Continuous Petri Nets: Expressive Power and Decidability Issues
• Dense counter machines and verification problems.
• First-order hybrid Petri nets. An application to distributed manufacturing systems
• Flat Parametric Counter Automata
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• Pushdown timed automata: A binary reachability characterization and safety verification.
• Reachability in timed counter systems
• Reversal-Bounded Counter Machines Revisited
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Timed Petri nets and timed automata: On the discriminating power of Zeno sequences
• Towards a Model-Checker for Counter Systems

Cited in

(2)

• On Counter Machines versus dP Automata
• Dense counter machines and verification problems.

Describes a project that uses

Uses Software

• FAST

This page was built for publication: Dense-choice counter machines revisited

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