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

DOI10.1016/0304-3975(85)90014-3MaRDI QIDQ1059399zbMATH OpenOpenAlexFDO

Authors G. Memmi, Alain Finkel

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

Petri netsregular languagesTuring machinesdeterministic 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)

Recommendations

• Publication:3776642
• Publication:4730790
• Fifo nets without order deadlock
• Vocabulary Petri nets
• Reachability problems in piecewise FIFO systems

Cites work

• scientific article; zbMATH DE number 3825180 (Why is no real title available?)
• scientific article; zbMATH DE number 3825214 (Why is no real title available?)
• scientific article; zbMATH DE number 3932399 (Why is no real title available?)
• scientific article; zbMATH DE number 3660797 (Why is no real title available?)
• scientific article; zbMATH DE number 3780569 (Why is no real title available?)
• scientific article; zbMATH DE number 3789841 (Why is no real title available?)
• scientific article; zbMATH DE number 3602663 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• A note on colored Petri nets
• Automates a file
• Coloured Petri nets and the invariant-method
• Communicating sequential processes
• Deterministic buffer synchronization of sequential processes
• Homomorphisms between models of parallel computation
• Parallel program schemata
• Petri nets and regular languages

Cited in

(17)

• A methodology for constructing communication protocols with multiple concurrent functions
• Verification, Model Checking, and Abstract Interpretation
• scientific article; zbMATH DE number 4037223 (Why is no real title available?)
• Well-abstracted transition systems: Application to FIFO automata.
• Boundedness, hierarchy of fairness, and communication networks with delay
• Bounded-memory algorithms for verification on-the-fly
• Reduction and covering of infinite reachability trees
• Behavioural and structural composition rules preserving liveness by synchronization for colored FIFO nets
• scientific article; zbMATH DE number 7471708 (Why is no real title available?)
• Testing for unboundedness of fifo channels
• Verifying identical communicating processes is undecidable
• Well-structured transition systems everywhere!
• Fifo nets without order deadlock
• Vocabulary Petri nets
• Non axiomatisability of positive relation algebras with constants, via graph homomorphisms
• Reachability problems in piecewise FIFO systems
• scientific article; zbMATH DE number 176515 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1059399)