11
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

Boundedness, hierarchy of fairness, and communication networks with delay

&
Pages 161-178 | Received 01 Mar 1988, Published online: 19 Mar 2007

References

  • Best , E. 1984 . Fairness and conspiracies . Information Processing Letters , 18 : 215 – 220 .
  • Bochmann , G. and Sunshine , C. 1980 . Formal methods in communication protocol design . IEEE Trans. Comm. , : 624 – 631 .
  • Brand , D. and Zafiropulo , P. 1983 . On communicating finite-state machines . J. ACM , 30 ( 2 ) : 323 – 342 .
  • Carstensen , H. 1987 . Proc. of 4th Annual Symp. on Theoretical Aspects of Computer Science . Decidability questions for fairness in Petri nets . 1987 . pp. 396 – 407 . LNCS
  • Carstensen , H. and Valk , R. 1985 . Proc. of Advances in Petri Nets . Infinite behaviour and fairness in Petri nets . 1985 . pp. 83 – 100 . LNCS
  • Gouda , M. and Rosier , L. 1985 . Priority networks of communicating finite state machines . SIAM J. Computing , 14 ( 3 ) : 157 – 166 .
  • Gouda , M. , Gurari , E. , Lai , T. and Rosier , L. 1987 . On deadlock detection in systems of communicating finite state machines . Computers and Artificial Intelligence , 6 ( 3 ) : 209 – 228 .
  • Howell , R. and Rosier , L. 1987 . Proceedings of the 8th European Workshop on Applications and Theory of Petri Nets . On questions of fairness and temporal logic for conflict-free Petri nets . 1987 . pp. 197 – 214 .
  • Memmi , G. and Finkel , A. 1985 . An introduction to fifo nets—monogeneous nets: a subclass of fifo nets . Theoretical Computer Science , 35 ( 2,3 ) : 191 – 214 .
  • Minsky , M. 1967 . Computation: Finite and Infinite Machines , Englewood Cliffs, NJ : Prentice-Hall .
  • Peterson , J. 1981 . Petri Net Theory and the Modeling of Systems , Englewood Cliffs, N.J : Prentice-Hall .
  • Rosier , L. and Yen , H. 1986 . Boundedness, empty channel detection, and synchronization for communicating finite state automata . Theoretical Computer Science , 44 ( 1 ) : 69 – 106 .
  • Rosier , L. and Yen , H. 1987 . Logspace hierarchies, polynomial time and the complexity of fairness problems concerning ω-machines . SIAM J. Computing , 16 ( 5 ) : 779 – 807 .
  • Yu , Y. and Gouda , M. 1983 . Unboundedness detection for a class of communicating finite state machines . Information Processing Letters , 17 ( 5 ) : 235 – 240 .
  • Zafiropulo , P. 1980 . Towards analyzing and synthesizing protocols . IEEE Trans. Comm. , 28 ( 4 ) : 651 – 661 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.