An extension of the notions of traces and of asynchronous automata
RAIRO-Theor. Inf. Appl., 25 4 (1991) 355-393
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Computer Science – Theory and Applications
Rémi MorinLecture Notes in Computer Science, Computer Science – Theory and Applications 6651 317 (2011)
https://doi.org/10.1007/978-3-642-20712-9_25
UNAMBIGUOUS SHARED-MEMORY SYSTEMS
RÉMI MORINInternational Journal of Foundations of Computer Science 21 (04) 665 (2010)
https://doi.org/10.1142/S0129054110007489
405 (2009)
https://doi.org/10.1007/978-3-642-01492-5_10
Applications and Theory of Petri Nets
Jean Fanchon and Rémi MorinLecture Notes in Computer Science, Applications and Theory of Petri Nets 5606 83 (2009)
https://doi.org/10.1007/978-3-642-02424-5_7
Developments in Language Theory
Rémi MorinLecture Notes in Computer Science, Developments in Language Theory 5257 516 (2008)
https://doi.org/10.1007/978-3-540-85780-8_41
CONCUR 2008 - Concurrency Theory
Rémi MorinLecture Notes in Computer Science, CONCUR 2008 - Concurrency Theory 5201 36 (2008)
https://doi.org/10.1007/978-3-540-85361-9_7
Mathematical Foundations of Computer Science 2005
Rémi MorinLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2005 3618 686 (2005)
https://doi.org/10.1007/11549345_59
Regular sets of infinite message sequence charts
Dietrich KuskeInformation and Computation 187 (1) 80 (2003)
https://doi.org/10.1016/S0890-5401(03)00123-8
STACS 2002
Dietrich KuskeLecture Notes in Computer Science, STACS 2002 2285 489 (2002)
https://doi.org/10.1007/3-540-45841-7_40
CONCUR 2002 — Concurrency Theory
Jean Fanchon and Rémi MorinLecture Notes in Computer Science, CONCUR 2002 — Concurrency Theory 2421 402 (2002)
https://doi.org/10.1007/3-540-45694-5_27
Foundations of Software Science and Computation Structures
Jean-François Husson and Rémi MorinLecture Notes in Computer Science, Foundations of Software Science and Computation Structures 1784 177 (2000)
https://doi.org/10.1007/3-540-46432-8_12
Asynchronous cellular automata for pomsets
Manfred Droste, Paul Gastin and Dietrich KuskeTheoretical Computer Science 247 (1-2) 1 (2000)
https://doi.org/10.1016/S0304-3975(00)00166-3
CONCUR 2000 — Concurrency Theory
Dietrich Kuske and Rémi MorinLecture Notes in Computer Science, CONCUR 2000 — Concurrency Theory 1877 426 (2000)
https://doi.org/10.1007/3-540-44618-4_31
Probabilistic asynchronous automata
S. Jesi, G. Pighizzini and N. SabadiniMathematical Systems Theory 29 (1) 5 (1996)
https://doi.org/10.1007/BF01201811
A partial trace semantics for Petri nets
V DiekertTheoretical Computer Science 134 (1) 87 (1994)
https://doi.org/10.1016/0304-3975(94)90280-1
Asynchronous automata versus asynchronous cellular automata
Giovanni PighizziniTheoretical Computer Science 132 (1-2) 179 (1994)
https://doi.org/10.1016/0304-3975(94)90232-1
Logic and Algebra of Specification
Wilfried BrauerLogic and Algebra of Specification 1 (1993)
https://doi.org/10.1007/978-3-642-58041-3_1