Counter machines, Petri nets, and consensual computation
DOI10.1016/j.tcs.2015.12.004zbMath1359.68162OpenAlexW2207622479MaRDI QIDQ517037
Pierluigi San Pietro, Stefano Crespi Reghizzi
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
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Shuffled languages -- representation and recognition
- On CD-systems of stateless deterministic R-automata with window size one
- Real time scheduling theory: A historical perspective
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Concurrent regular expressions and their relationship to Petri nets
- Remarks on the complexity of nondeterministic counter languages
- Remarks on blind and partially blind one-way multicounter machines
- Shuffle languages are in P
- 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
- Petri nets and szilard languages
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Deterministic Counter Machines and Parallel Matching Computations
- STRICT LOCAL TESTABILITY WITH CONSENSUS EQUALS REGULARITY, AND OTHER PROPERTIES
- Counter machines and counter languages
- Multiset processing. Mathematical, computer science, and molecular computing points of view
This page was built for publication: Counter machines, Petri nets, and consensual computation
