Fair Petri nets and structural induction for rings of processes

DOI10.1016/0304-3975(94)90113-9zbMath0829.68091OpenAlexW1963735927WikidataQ126573415 ScholiaQ126573415MaRDI QIDQ1346633

Ichiro Suzuki, Jianan Li, Masafumi Yamashita

Publication date: 6 April 1995

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

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90113-9

zbMATH Keywords

Petri net

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• A taxonomy of fairness and temporal logic problems for Petri nets
• Distributed mutual exclusion on a ring of processes
• The complementation problem for Büchi automata with applications to temporal logic
• Proving properties of a ring of finite-state machines
• Problems concerning fairness and temporal logic for conflict-free Petri nets
• Infinite behaviour of Petri nets
• Synthesis of Communicating Processes from Temporal Logic Specifications
• Reasoning about systems with many processes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fair Petri nets and structural induction for rings of processes