Free Access
RAIRO-Theor. Inf. Appl.
Volume 26, Number 1, 1992
Page(s) 19 - 44
Published online 01 February 2017
  1. 1. C. BERGE, Graphs and Hypergraphs, North Holland, 1973. [MR: 357172] [Zbl: 0254.05101] [Google Scholar]
  2. 2. E. BEST and C. FERNANDEZ, Notations and Terminology on Petri Net Theory, Arbeitspapiere der GMD 195, Bonn, 1986. [Google Scholar]
  3. 3. E. BEST, R. DEVILLERS, A. KIEHN and L. POMELLO, Fully Concurrent Bisimulation Technical report, Université libre de Bruxelles, 1989, and Acta Informatica, 1991, 28, pp. 231-264. [MR: 1093250] [Zbl: 0718.68034] [Google Scholar]
  4. 4. G.W. BRAMS, Réseaux de Petri: Théorie et Pratique, Tome 1 et 2, Masson, 1982. [MR: 692364] [Zbl: 0501.68027] [Google Scholar]
  5. 5. W. BRAUER, W. REISIG and G. ROZENBERG Eds., Petri Nets: Central Models and Their Properties, Part I, Proceedings, Advances in Petri Nets 1986, LNCS, 254, Springer-Verlag, 1987. [MR: 902651] [Zbl: 0619.00023] [Google Scholar]
  6. 6. U. GOLTZ, On Condition/Event Representations of Place/Transition Systems, in: K. Voss, H.J. GENRICH and G. ROZENBERG Eds, Concurrency and Nets, Springer-Verlag, 1987. [MR: 911919] [Zbl: 0634.68059] [Google Scholar]
  7. 7. U. GOLTZ and W. REISIG, Processes of Place/Transition-Nets in Proceedings ICALP 83, LNCS, 154, Springer-Verlag, 1983. [MR: 727662] [Zbl: 0523.68046] [Google Scholar]
  8. 8. J. GRABOWSKI, On partial languages, Annales Soc. Math. Polonae, series IV: Fund. Inform., 1981, IV. 2, pp. 427-298. [MR: 645249] [Zbl: 0468.68088] [Google Scholar]
  9. 9. M. HACK, Petri net Languages, MIT-Technical Report 159, MIT Press, Cambridge, 1975. [Google Scholar]
  10. 10. M. PARIGOT and E. PELZ, A logical approach of Petri net languages, T.C.S., 1985, 39, pp. 155-169, and to appear in Proceedings ESDA'92, ASME-Volume. [MR: 821199] [Zbl: 0605.68049] [Google Scholar]
  11. 11. E. PELZ, Place/Transitions-systems: Concurrent behaviour and logic, Rapport LRI No. 571, Université Paris-Sud, 1990. [Google Scholar]
  12. 12. E. PELZ, Normalisation of Place/Transition-Systems Preserves Net Behaviour, in part II of "Réseaux et Logique", Thèse d'État, Université Paris-Sud, 1990. [Google Scholar]
  13. 13. L. POMELLO, Some Equivalence Notions for Concurrent Systems. An Overwiew, in K. Voss, H.J. GENRICH and G. ROZENBERG Eds, Concurrency and Nets, Springer-Verlag, 1987. [MR: 864526] [Zbl: 0611.68037] [Google Scholar]
  14. 14. L. POMELLO and C. SIMONE, A survey of Equivalence Notions for Net Based Systems Systems, Conference at ESPRIT-BRA DEMON meeting, Bonn, June 1989, to appear in Advances in Petri Nets, 1991. [Google Scholar]
  15. 15. S. SCHWER, Transformation of a Petri Net into a Petri Net with Incidence Matrix on {0, 1}, Petri Nets Newsletter, 1986, 23, pp. 15-20. [Google Scholar]
  16. 16. J. SIFAKIS, Le contrôle des systèmes asynchrones: Concepts, propriétés, analyse statique, Thèse, U.S.M. Grenoble, 1979. [Google Scholar]
  17. 17. R. VALK and H. CARSTENSEN, Infinite Behaviour and Fairness in Petri Nets, in Advances in Petri nets 1984, LNCS, 188, G. ROZENBERG Ed., Springer-Verlag,, 1985. [MR: 807196] [Zbl: 0571.68045] [Google Scholar]
  18. 18. W. VOGLER, Executions: Their relations to Other Partial Order Semantics of Nets and a Compatible C/E-Representation of P/T-systems, Technical report, TUM-18806, TU München, 1988. [Google Scholar]
  19. 19. W. VOGLER, Bisimulation and action refinement, in STACS 91, C. CHOFFRUT and M. JANTZEN Eds., LNCS, 480, Springer-Verlag, 1991. [MR: 1101180] [Zbl: 0773.68052] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.