Boundedness, hierarchy of fairness, and communication networks with delay

DOI10.1080/00207168908803692zbMath0688.68010OpenAlexW2055021865MaRDI QIDQ4207557

Anil Kumar Sharma, Hsu-Chun Yen

Publication date: 1989

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168908803692

zbMATH Keywords

complexityfairnessPetri netscommunicating finite-state machinesboundedness problem

Mathematics Subject Classification ID

Theory of software (68N99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fairness and conspiracies
• Unboundedness detection for a class of communicating finite-state machines
• An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets
• Boundedness, empty channel detection, and synchronization for communicating finite automata
• On Communicating Finite-State Machines
• Priority Networks of Communicating Finite State Machines
• Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning $\omega $-Machines

This page was built for publication: Boundedness, hierarchy of fairness, and communication networks with delay