Counter machines, Petri nets, and consensual computation

DOI10.1016/J.TCS.2015.12.004MaRDI QIDQ517037zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

formal languagesconsensual languagemodulo schedulingmulti-counter machinemultiset machinePetri net languagePetri net normal formquasi-deterministic counter machinereal-time partially blind machine

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

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

Cites work

• scientific article; zbMATH DE number 3932419 (Why is no real title available?)
• scientific article; zbMATH DE number 3628412 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• An Optimal Simulation of Counter Machines
• An Optimal Simulation of Counter Machines: The ACM Case
• Commutative languages and their composition by consensual methods
• Concurrent regular expressions and their relationship to Petri nets
• Consensual Definition of Languages by Regular Sets
• Consensual languages and matching finite-state computations
• Counter machines and counter languages
• Deterministic counter machines and parallel matching computations
• Languages generated by context-free grammars extended by type \(AB\to BA\) rules
• Multiset processing. Mathematical, computer science, and molecular computing points of view
• On CD-systems of stateless deterministic R-automata with window size one
• Petri nets and szilard languages
• Real time scheduling theory: A historical perspective
• 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
• Remarks on the complexity of nondeterministic counter languages
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Shuffle languages are in P
• Shuffled languages -- representation and recognition
• Strict local testability with consensus equals regularity
• Strict local testability with consensus equals regularity, and other properties
• What makes some language theory problems undecidable

Cited in

(3)

• Counter machines and verification problems.
• Deterministic counter machines and parallel matching computations
• Witness Runs for Counter Machines

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)