Counter machines, Petri nets, and consensual computation
DOI10.1016/J.TCS.2015.12.004zbMATH Open1359.68162OpenAlexW2207622479MaRDI QIDQ517037FDOQ517037
Authors: Stefano Crespi Reghizzi, Pierluigi San Pietro 
Publication date: 16 March 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11311/1122533
Recommendations
- Deterministic counter machines and parallel matching computations
- scientific article; zbMATH DE number 5201373
- Petri net controlled finite automata
- Characterizations of CD grammar systems working in competence mode by multicounter machine resources
- Concurrent regular expressions and their relationship to Petri nets
formal languagesconsensual languagemodulo schedulingmulti-counter machinemultiset machinePetri net languagePetri net normal formquasi-deterministic counter machinereal-time partially blind machine
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Commutative languages and their composition by consensual methods
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Remarks on blind and partially blind one-way multicounter machines
- Multiset processing. Mathematical, computer science, and molecular computing points of view
- Concurrent regular expressions and their relationship to Petri nets
- Shuffle languages are in P
- Languages generated by context-free grammars extended by type \(AB\to BA\) rules
- Shuffled languages -- representation and recognition
- Title not available (Why is that?)
- Real time scheduling theory: A historical perspective
- Remarks on the complexity of nondeterministic counter languages
- Counter machines and counter languages
- On CD-systems of stateless deterministic R-automata with window size one
- What makes some language theory problems undecidable
- Strict local testability with consensus equals regularity
- Consensual languages and matching finite-state computations
- Consensual Definition of Languages by Regular Sets
- An Optimal Simulation of Counter Machines
- An Optimal Simulation of Counter Machines: The ACM Case
- Title not available (Why is that?)
- Petri nets and szilard languages
- Title not available (Why is that?)
- Deterministic counter machines and parallel matching computations
- Strict local testability with consensus equals regularity, and other properties
Cited In (3)
This page was built for publication: Counter machines, Petri nets, and consensual computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q517037)
