An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets

DOI10.1016/0304-3975(85)90014-3zbMath0566.68054MaRDI QIDQ1059399

Alain Finkel, G. Memmi

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90014-3

zbMATH Keywords

Turing machines; Petri nets; regular languages; deterministic languages; parallel computation model; program machines; sequential processes communicating by FIFO channels

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

68N25: Theory of operating systems

Related Items

Behavioural and structural composition rules preserving liveness by synchronization for colored FIFO nets, Well-structured transition systems everywhere!, A methodology for constructing communication protocols with multiple concurrent functions, Reduction and covering of infinite reachability trees, Verifying identical communicating processes is undecidable, Well-abstracted transition systems: Application to FIFO automata., Fifo nets without order deadlock, Boundedness, hierarchy of fairness, and communication networks with delay

Cites Work

• Automates a file
• A note on colored Petri nets
• Petri nets and regular languages
• Coloured Petri nets and the invariant-method
• Deterministic buffer synchronization of sequential processes
• Homomorphisms between models of parallel computation
• Parallel program schemata
• Communicating sequential processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item