EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 27 / No 1 (1993) RAIRO-Theor. Inf. Appl., 27 1 (1993) 7-22 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 27, Number 1, 1993
Page(s) 7 - 22
DOI https://doi.org/10.1051/ita/1993270100071
Published online 01 February 2017
  1. [AR1] IJ. J. AALBERSBERG and G. ROZENBERG, Theory of Traces, Theoretical Computer Science, Vol. 60 1988, pp. 1-82. [MR: 947532] [Zbl: 0652.68017] [Google Scholar]
  2. [AR2] IJ. J. AALBERSBERG and G. ROZENBERG, Traces, Dependency Graphs and DNLC Grammars, Discrete Applied Mathematics, Vol. 11 1985, pp. 299-306. [MR: 792896] [Zbl: 0601.68045] [Google Scholar]
  3. [AW] IJ. J. AALBERSBERG and E. WELZL, Trace Languages Defined by Regular String Languages, RAIRO Informatique Théorique, Vol. 20 1986, pp. 103-119 [EuDML: 92250] [MR: 860763] [Zbl: 0612.68071] [Google Scholar]
  4. [BMS] A. BERTON, G. MAURI and N. SABADIN, Equivalence and Membership Problems for Regular Trace Languages, Lecture Notes in Computer Science, Vol. 140, 1982, pp. 61-71. [MR: 675445] [Zbl: 0486.68079] [Google Scholar]
  5. [CF] P. CARTIER and D. FOATA, Problèmes combinatoires de commutation et rearrangements, Lecture Notes in Mathematics, Vol. 85, 1981. [Zbl: 0186.30101] [Google Scholar]
  6. [CP] R. CORI and D. PERRIN, Automates et commutations partielles, RAIRO Informatique Théorique, Vol. 19, 1985, pp. 21-32 [EuDML: 92219] [MR: 795769] [Zbl: 0601.68055] [Google Scholar]
  7. [ENR] H. EHRIG, M. NAGL and G. ROZENBERG eds. Graph Grammars and their Applications to Computer Science, Lecture Notes in Computer Science, Vol. 153 1983. [MR: 707856] [Zbl: 0512.00027] [Google Scholar]
  8. [ER] A. EHRENFEUCHT and G. ROZENBERG, On the structure of dependency graphs, in: Concurrency and nets, K. Voss, H. J. GENRICH, G. ROZENBERG Eds., Springer Verlag, 1987, pp. 141-170. [MR: 911917] [Zbl: 0642.68031] [Google Scholar]
  9. [FR] M. P. FLÉ and G. ROUCAIROL, On Serizlizability of Iterated Transactions, Proc. ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, 1982, pp. 194-200. [Google Scholar]
  10. [K] R. M. KELLER, A Solvable Program-Schema Equivalence Problem, Proc. 5th Annual Princeton Conference on Information Sciences and Systems, Princeton, 1971, pp. 301-306. [Google Scholar]
  11. [Ml] A. MAZURKIEWICZ, Concurrent Program Schemes and their Interpretations, Dept. of Computer Science, University of Aarhus, Technical Report No. PB-78, Aarhus, 1977. [Google Scholar]
  12. [M2] A. MAZURKIEWICZ, Semantics of Concurrent Systems: a Modular Fixed Point Approach, Lecture Notes in Computer Science, Vol. 188, 1985, pp. 353-375. [MR: 807209] [Zbl: 0576.68044] [Google Scholar]
  13. [Me] Y. METIVIER, Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif, RAIRO Informatique Théorique, Vol. 20, 1986, pp. 121-127. [EuDML: 92251] [MR: 860764] [Zbl: 0599.20107] [Google Scholar]
  14. [O] E. OCHMANSKI, Regular Trace Languages, Ph.D. Thesis, Dept. of Mathematics, University of Warsaw, 1985. [Google Scholar]
  15. [P] D. PERRIN, Partial Commutations, Lecture Notes in Computer Science, Vol. 372, pp. 637-651. [MR: 1037081] [Google Scholar]
  16. [RW] G. ROZENBERG and E. WELZL, Boundary NLC grammars. Basic Definitions, Normal Forms and Complexity, Information and Control, Vol. 69, 1986, pp. 136-167. [MR: 848438] [Zbl: 0608.68060] [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.