Fifo nets without order deadlock

DOI10.1007/BF00268843zbMath0614.68050OpenAlexW1998467885MaRDI QIDQ1819941

Alain Finkel, Annie Choquet

Publication date: 1988

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00268843

zbMATH Keywords

finite terminationfree choice netsfifo netsfifo queuesquasi-liveness

Mathematics Subject Classification ID

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

Related Items

Unnamed Item ⋮ Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework ⋮ Well-structured transition systems everywhere!

Cites Work

• Unnamed Item
• Unnamed Item
• Reachability trees for high-level Petri nets
• An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets
• Automates a file
• An Algorithm for the General Petri Net Reachability Problem
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: Fifo nets without order deadlock