Dense-choice counter machines revisited
From MaRDI portal
Publication:2015129
DOI10.1016/J.TCS.2014.04.029zbMATH Open1360.68541OpenAlexW2076654590MaRDI QIDQ2015129FDOQ2015129
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
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Cites Work
- Title not available (Why is that?)
- A theory of timed automata
- Pushdown timed automata: A binary reachability characterization and safety verification.
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Reversal-Bounded Counter Machines Revisited
- First-order hybrid Petri nets. An application to distributed manufacturing systems
- Towards a Model-Checker for Counter Systems
- Flat Parametric Counter Automata
- Reachability in Timed Counter Systems
- Continuous Petri Nets: Expressive Power and Decidability Issues
- Computer Aided Verification
- Timed Petri nets and timed automata: On the discriminating power of Zeno sequences
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Cited In (1)
Uses Software
Recommendations
- Computer Aided Verification 👍 👎
- On Counter Machines versus dP Automata 👍 👎
- Title not available (Why is that?) 👍 👎
- 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 👍 👎
- Title not available (Why is that?) 👍 👎
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)
