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

DOI10.1016/0304-3975(85)90014-3zbMath0566.68054OpenAlexW2067782667MaRDI 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 machinesPetri netsregular languagesdeterministic languagesparallel computation modelprogram machinessequential processes communicating by FIFO channels

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets