A Survey on the Decidability Questions for Classes of FIFO Nets

[1]  Alain Finkel,et al.  A Generalization of the Procedure of Karp and Miller to Well Structured Transition Systems , 1987, ICALP.

[2]  Mohamed G. Gouda,et al.  On deadlock detection in systems of communicating finite state machines , 1987 .

[3]  C. A. Petri,et al.  Concurrency Theory , 1986, Advances in Petri Nets.

[4]  Gérard Roucairol,et al.  FIFO-Nets , 1986, Advances in Petri Nets.

[5]  Jacques Vautherin,et al.  Analysing Nets by the Invariant Method , 1986, Advances in Petri Nets.

[6]  Hsu-Chun Yen,et al.  Boundedness, Empty Channel Detection, and Synchronization for Communicating Finite Automata , 1986, Theor. Comput. Sci..

[7]  Mohamed G. Gouda,et al.  On Deciding Progress for a Class of Communication Protocols , 1983 .

[8]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

[9]  Alain Finkel,et al.  Fifo nets: a new model of parallel computation , 1983, Theoretical Computer Science.

[10]  Gérard Berthelot,et al.  Petri Nets Theory for the Correctness of Protocols , 1982, PSTV.

[11]  S. Rao Kosaraju,et al.  Decidability of reachability in vector addition systems (Preliminary Version) , 1982, STOC '82.

[12]  Rüdiger Valk,et al.  Petri Nets and Regular Languages , 1981, J. Comput. Syst. Sci..

[13]  Ernst W. Mayr,et al.  An algorithm for the general Petri net reachability problem , 1981, STOC '81.

[14]  Maurice Nivat,et al.  Centers of Languages , 1981, Theoretical Computer Science.

[15]  Bernard Vauquelin,et al.  Automates a File , 1980, Theor. Comput. Sci..

[16]  Daniel Brand,et al.  Towards Analyzing and Synthesizing Protocols , 1980, IEEE Trans. Commun..

[17]  Alfred V. Aho,et al.  Modeling communications protocols by automata , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[18]  Gregor von Bochmann,et al.  Finite State Description of Communication Protocols , 1978, Comput. Networks.

[19]  Michel Hack,et al.  ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS , 1972 .

[20]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[21]  Annie Choquet-Geniet,et al.  Analyse et propriétés des processus communiquant par files fifo : réseaux à files à choix libre topologique et réseaux à files linéaires , 1987 .

[22]  Gregor von Bochmann,et al.  Protocol specification, testing, and verification, VI : proceedings of the IFIP WG 6.1 Sixth International Workshop on Protocol Specification, Testing, and Verification organized by Concordia University and Université de Montréal, Montreal, Quebec, Canada, June 10-13, 1986 , 1987 .

[23]  Wolfgang Reisig,et al.  Petri Nets: Central Models and Their Properties , 1986, Lecture Notes in Computer Science.

[24]  Alain Finkel,et al.  Structuration des systèmes de transitions-applications au contrôle du parallélisme par Files Fifo , 1986 .

[25]  Wolfgang Reisig,et al.  Petri Nets: Applications and Relationships to Other Models of Concurrency , 1986, Lecture Notes in Computer Science.

[26]  Alain Finkel,et al.  Applications of residues for the analysis of parallel systems communicating by fifo channels , 1986, Bull. EATCS.

[27]  Alain Finkel,et al.  An Introduction to Fifo Nets-Monogeneous Nets: A Subclass of Fifo Nets , 1985, Theor. Comput. Sci..

[28]  Gérard Roucairol,et al.  Fair serializability of iterated transactions using FIFO-nets , 1984, European Workshop on Applications and Theory in Petri Nets.

[29]  Peter H. Starke,et al.  Monogenous FIFO-nets and PETRI-nets are equivalent , 1983, Bull. EATCS.

[30]  G. Gagne,et al.  Operating System Concepts , 1983 .

[31]  Matthias Jantzen,et al.  On the hierarchy of Petri net languages , 1979, RAIRO Theor. Informatics Appl..

[32]  Michel Hack,et al.  Decidability Questions for Petri Nets , 1975, Outstanding Dissertations in the Computer Sciences.

[33]  Graham Higman,et al.  Ordering by Divisibility in Abstract Algebras , 1952 .