EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 25 / No 4 (1991) RAIRO-Theor. Inf. Appl., 25 4 (1991) 355-393 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 25, Number 4, 1991
Page(s) 355 - 393
DOI https://doi.org/10.1051/ita/1991250403551
Published online 01 February 2017
  1. 1. J. J. AALSBERG, G. ROZENBERG, Theory of traces. Technical Report 86-16, Institute of Applied Mathematics and Computer Science, University of Leiden, 1986. [Google Scholar]
  2. 2. R. CORI, Y. MÉTIVIER, Approximation of a trace, asynchronous automata, and the ordering of events in a distributed system. In Lepistö and Salomaa, editors, 15th I.C.A.L.P., pp. 147-161, Lecture Notes Comput. Sci., 317, 1988. [MR: 1023633] [Zbl: 0656.68060] [Google Scholar]
  3. 3. R. CORI, D. PERRIN, Automates et commutations partielles, R.A.I.R.O. Inform. Théor. Appl., 1985,19, pp. 21-32. [EuDML: 92219] [MR: 795769] [Zbl: 0601.68055] [Google Scholar]
  4. 4. P. DEGANO, U. MONTANARI, Specification languages for distributed Systems. In H. EHRIG, C. FLOYD, M. NIVAT, J. THATCHER, Eds., Mathematical Foundations of Software Development (TAPSOFT'85), pp. 29-51, Lecture Notes Comput. Sci., 185, 1985. [MR: 818014] [Zbl: 0563.68019] [Google Scholar]
  5. 5. U. GOLTZ, W. REISIG, The non-sequential behaviour of Petri nets, Inform. and Control, 1983, 57, pp. 125-147. [MR: 742704] [Zbl: 0551.68050] [Google Scholar]
  6. 6. J. GRABOWSKI, On partial languages, Fundamenta Informaticae, 1981, IV, 2, pp. 427-498. [MR: 645249] [Zbl: 0468.68088] [Google Scholar]
  7. 7. A. MAZURKIEWICZ, Traces, histories, and graphs: Instances of process monoids, In M. CHYTIL, V. KOUBEK Eds., MFCS'84, pp. 115-133, Lecture Notes Comput. Sci., 176, 1984. [MR: 783441] [Zbl: 0577.68061] [Google Scholar]
  8. 8. A. MAZURKIEWICZ, Compositional semantics of pure place/transition systems, Fund. Inform., XI, 1988. [Zbl: 0676.68030] [MR: 982497] [Google Scholar]
  9. 9. A. MAZURKIEWICZ, Concurrency, modularity, and synchronization. In A. KRECZMAR, G. MIRKOWSKA Eds., MFCS'89, pp. 577-598, Lecture Notes Comput. Sci., 379, 1989. [MR: 1036835] [Zbl: 0755.68098] [Google Scholar]
  10. 10. Y. MÉTIVIER, Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif. R.A.I.R.O. Inform. Théor.Appl., 1985, 19, pp. 121-127. [EuDML: 92251] [MR: 860764] [Zbl: 0599.20107] [Google Scholar]
  11. 11. M. NIELSEN, G. PLOTKIN, G. WINSKEL, Petri nets, event structures and domains, Theoret. Comput. Science, 1981, 13, pp. 85-108. [MR: 593865] [Zbl: 0452.68067] [Google Scholar]
  12. 12. E. OCHMANSKI, Regular behaviour of concurrent systems, Bulletin EATCS, 1985, 27, pp. 56-67. [Google Scholar]
  13. 13. A. RABINOVICH, B. A. TRAKHTENBROT, Behavior structures and nets, Fund, Inform., XI, 1988, pp. 357-404. [MR: 982498] [Zbl: 0657.68068] [Google Scholar]
  14. 14. B. ROZOY, Un modèle de parallélisme : le monoïde distribué, Thèse d'État, Université de Caen, 1987. [Google Scholar]
  15. 15. E. SZPILRAJN, Sur l'extension de l'ordre partiel, Fund. Math., 1930, 16, pp. 386-389. [EuDML: 212499] [Zbl: 56.0843.02] [JFM: 56.0843.02] [Google Scholar]
  16. 16. J. WINKOWSKI, Behaviours of concurrent Systems, Theoret. Comput. Sci., 1980, 12, pp. 39-60. [MR: 582241] [Zbl: 0445.68044] [Google Scholar]
  17. 17. J. WINKOWSKI, An algebraic description of System behaviours, Theoret. Comput. Sci., 1982, 21, pp. 315-340. [MR: 680920] [Zbl: 0493.68049] [Google Scholar]
  18. 18. W. ZIELONKA, Notes on finite asynchronous automata, R.A.I.R.O. Inform. Théor. Appl., 1987, 21, pp. 99-135. [EuDML: 92285] [MR: 894706] [Zbl: 0623.68055] [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.