Notes on finite asynchronous automata
RAIRO-Theor. Inf. Appl., 21 2 (1987) 99-135
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):
FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science
Madhavan MukundLecture Notes in Computer Science, FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science 2556 289 (2002)
https://doi.org/10.1007/3-540-36206-1_26
Parallel Problem Solving from Nature — PPSN VII
Mathieu S. CapcarrereLecture Notes in Computer Science, Parallel Problem Solving from Nature — PPSN VII 2439 903 (2002)
https://doi.org/10.1007/3-540-45712-7_87
FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science
Bharat Adsul and Milind SohoniLecture Notes in Computer Science, FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science 2556 47 (2002)
https://doi.org/10.1007/3-540-36206-1_6
Formal and Natural Computing
P.S. ThiagarajanLecture Notes in Computer Science, Formal and Natural Computing 2300 244 (2002)
https://doi.org/10.1007/3-540-45711-9_14
Distributed automata in an assumption-commitment framework
Swarup Mohalik and R. RamanujamSadhana 27 (2) 209 (2002)
https://doi.org/10.1007/BF02717184
Proof and System-Reliability
G. StefanescuProof and System-Reliability 49 (2002)
https://doi.org/10.1007/978-94-010-0413-8_3
Product interval automata
Deepak D’souza and P. S. ThiagarajanSadhana 27 (2) 181 (2002)
https://doi.org/10.1007/BF02717183
Relational Methods in Computer Science
Gheorghe ŞtefĂnescuLecture Notes in Computer Science, Relational Methods in Computer Science 2561 197 (2002)
https://doi.org/10.1007/3-540-36280-0_14
Modeling visual interactive systems through dynamic visual languages
P. Bottoni, Shi-Kuo Chang, M.F. Costabile, S. Levialdi and P. MussioIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans 32 (6) 654 (2002)
https://doi.org/10.1109/TSMCA.2002.807028
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
Coordination Languages and Models
P. Katis, N. Sabadini and R. F. C. WaltersLecture Notes in Computer Science, Coordination Languages and Models 1906 267 (2000)
https://doi.org/10.1007/3-540-45263-X_17
Hierarchy of Asynchronous Automata
RéMI MORINElectronic Notes in Theoretical Computer Science 28 22 (2000)
https://doi.org/10.1016/S1571-0661(05)80628-0
Series–parallel languages and the bounded-width property
K Lodaya and P WeilTheoretical Computer Science 237 (1-2) 347 (2000)
https://doi.org/10.1016/S0304-3975(00)00031-1
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
Distributed Timed Automata
Padmanabhan KrishnanElectronic Notes in Theoretical Computer Science 28 5 (2000)
https://doi.org/10.1016/S1571-0661(05)80627-9
Undecidability of partial order logics
Rajeev Alur and Doron PeledInformation Processing Letters 69 (3) 137 (1999)
https://doi.org/10.1016/S0020-0190(99)00005-8
Automata, Languages and Programming
Marek A. Bednarczyk and Andrzej M. BorzyszkowskiLecture Notes in Computer Science, Automata, Languages and Programming 1644 190 (1999)
https://doi.org/10.1007/3-540-48523-6_16
Fundamentals of Computation Theory
Isabelle Ryl, Yves Roos and Mireille ClerboutLecture Notes in Computer Science, Fundamentals of Computation Theory 1684 451 (1999)
https://doi.org/10.1007/3-540-48321-7_38
250 (1998)
https://doi.org/10.1109/CSD.1998.657556
CONCUR'98 Concurrency Theory
Rémi MorinLecture Notes in Computer Science, CONCUR'98 Concurrency Theory 1466 549 (1998)
https://doi.org/10.1007/BFb0055647
68 (1998)
https://doi.org/10.1109/SEEP.1998.707635
Bicategories of processes
P. Katis, N. Sabadini and R.F.C. WaltersJournal of Pure and Applied Algebra 115 (2) 141 (1997)
https://doi.org/10.1016/S0022-4049(96)00012-6
Foundations of Software Technology and Theoretical Computer Science
Swarup Mohalik and R. RamanujamLecture Notes in Computer Science, Foundations of Software Technology and Theoretical Computer Science 1346 153 (1997)
https://doi.org/10.1007/BFb0058029
389 (1997)
https://doi.org/10.1007/978-3-642-59126-6_7
Representation of computations in concurrent automata by dependence orders
Felipe Bracho, Manfred Droste and Dietrich KuskeTheoretical Computer Science 174 (1-2) 67 (1997)
https://doi.org/10.1016/S0304-3975(96)00012-6
CONCUR '97: Concurrency Theory
Jesper G. Henriksen and P. S. ThiagarajanLecture Notes in Computer Science, CONCUR '97: Concurrency Theory 1243 45 (1997)
https://doi.org/10.1007/3-540-63141-0_4
Mathematical Foundations of Computer Science 1996
Madhavan Mukund and P. S. ThiagarajanLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1996 1113 62 (1996)
https://doi.org/10.1007/3-540-61550-4_140
Probabilistic asynchronous automata
S. Jesi, G. Pighizzini and N. SabadiniMathematical Systems Theory 29 (1) 5 (1996)
https://doi.org/10.1007/BF01201811
Basic notions of universal algebra for language theory and graph grammars
Bruno CourcelleTheoretical Computer Science 163 (1-2) 1 (1996)
https://doi.org/10.1016/0304-3975(95)00145-X
Application and Theory of Petri Nets 1995
Henning ReinekeLecture Notes in Computer Science, Application and Theory of Petri Nets 1995 935 357 (1995)
https://doi.org/10.1007/3-540-60029-9_49
Compilation of the ELECTRE reactive language into finite transition systems
Franck Cassez and Olivier RouxTheoretical Computer Science 146 (1-2) 109 (1995)
https://doi.org/10.1016/0304-3975(94)00136-7
Mathematical Foundations of Computer Science 1995
Sébastien Huguet and Antoine PetitLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1995 969 467 (1995)
https://doi.org/10.1007/3-540-60246-1_152
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
An extension of Kleene's and Ochmański's theorems to infinite traces
Paul Gastin, Antoine Petit and Wiesław ZielonkaTheoretical Computer Science 125 (2) 167 (1994)
https://doi.org/10.1016/0304-3975(94)90254-2
Atomic semicommutations
M. Clerbout and D. GonzalezTheoretical Computer Science 123 (2) 259 (1994)
https://doi.org/10.1016/0304-3975(92)00066-Z
Theoretical Aspects of Reasoning About Knowledge
Paul J. Krasucki and R. RamanujamTheoretical Aspects of Reasoning About Knowledge 267 (1994)
https://doi.org/10.1016/B978-1-4832-1453-5.50023-4
Structure of concurrency
Ryszard Janicki and Maciej KoutnyTheoretical Computer Science 112 (1) 5 (1993)
https://doi.org/10.1016/0304-3975(93)90238-O
TAPSOFT'93: Theory and Practice of Software Development
André ArnoldLecture Notes in Computer Science, TAPSOFT'93: Theory and Practice of Software Development 668 121 (1993)
https://doi.org/10.1007/3-540-56610-4_60
Fundamentals of Computation Theory
Dang Hung and Tran DungLecture Notes in Computer Science, Fundamentals of Computation Theory 710 309 (1993)
https://doi.org/10.1007/3-540-57163-9_26
Recognizable trace languages, distributed automata and the distribution problem
Antoine PetitActa Informatica 30 (1) 89 (1993)
https://doi.org/10.1007/BF01200264
Semicommutations and algebraic algebraic
M. Clerbout and Y. RoosTheoretical Computer Science 103 (1) 39 (1992)
https://doi.org/10.1016/0304-3975(92)90086-U
Models and logics for true concurrency
Kamal Lodaya, Madhavan Mukund, R Ramanujam and P S ThiagarajanSadhana 17 (1) 131 (1992)
https://doi.org/10.1007/BF02811341
Advances in Petri Nets 1992
Paul Gastin and Antoine PetitLecture Notes in Computer Science, Advances in Petri Nets 1992 609 392 (1992)
https://doi.org/10.1007/3-540-55610-9_179
Automata, Languages and Programming
M. Clerbout, M. Latteux, Y. Roos and W. ZielonkaLecture Notes in Computer Science, Automata, Languages and Programming 623 113 (1992)
https://doi.org/10.1007/3-540-55719-9_68
Two recognizable string-matching problems over free partially commutative monoids
Kosaburo Hashiguchi and Kazuya YamadaTheoretical Computer Science 92 (1) 77 (1992)
https://doi.org/10.1016/0304-3975(92)90136-4
String matching problems over free partially commutative monoids
Kosaburo Hashiguchi and Kazuya YamadaInformation and Computation 101 (2) 131 (1992)
https://doi.org/10.1016/0890-5401(92)90060-S
The free partially commutative Lie algebra: Bases and ranks
G Duchamp and D KrobAdvances in Mathematics 95 (1) 92 (1992)
https://doi.org/10.1016/0001-8708(92)90045-M
Automata, Languages and Programming
Paul Gastin and Antoine PetitLecture Notes in Computer Science, Automata, Languages and Programming 623 583 (1992)
https://doi.org/10.1007/3-540-55719-9_106
Probabilistic estimation of the number of prefixes of a trace
Massimiliano GoldwurmTheoretical Computer Science 92 (2) 249 (1992)
https://doi.org/10.1016/0304-3975(92)90314-6
STACS 91
Paul GastinLecture Notes in Computer Science, STACS 91 480 89 (1991)
https://doi.org/10.1007/BFb0020790
Recognizable closures and submonoids of free partially commutative monoids
Kosaburo HashiguchiTheoretical Computer Science 86 (2) 233 (1991)
https://doi.org/10.1016/0304-3975(91)90019-X
Mathematical Foundations of Computer Science 1991
Y. Roos and P. A. WacrenierLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1991 520 406 (1991)
https://doi.org/10.1007/3-540-54345-7_84
An extension of the notions of traces and of asynchronous automata
A. ArnoldRAIRO - Theoretical Informatics and Applications 25 (4) 355 (1991)
https://doi.org/10.1051/ita/1991250403551
Automata, Languages and Programming
Paul Gastin, Antoine Petit and Wieslaw ZielonkaLecture Notes in Computer Science, Automata, Languages and Programming 510 254 (1991)
https://doi.org/10.1007/3-540-54233-7_139
Automata, Languages and Programming
Wolfgang ThomasLecture Notes in Computer Science, Automata, Languages and Programming 510 441 (1991)
https://doi.org/10.1007/3-540-54233-7_154
Event structures and trace monoids
Brigitte Rozoy and P.S. ThiagarajanTheoretical Computer Science 91 (2) 285 (1991)
https://doi.org/10.1016/0304-3975(91)90087-I
Formal Models and Semantics
Dominique PERRINFormal Models and Semantics 1 (1990)
https://doi.org/10.1016/B978-0-444-88074-1.50006-8
Advances in Computing and Information — ICCI '90
Piotr W. ProszynskiLecture Notes in Computer Science, Advances in Computing and Information — ICCI '90 468 335 (1990)
https://doi.org/10.1007/3-540-53504-7_91
Distribution and synchronized automata
A. PetitTheoretical Computer Science 76 (2-3) 285 (1990)
https://doi.org/10.1016/0304-3975(90)90022-A
Semantics of Systems of Concurrent Processes
G. Duchamp and D. KrobLecture Notes in Computer Science, Semantics of Systems of Concurrent Processes 469 256 (1990)
https://doi.org/10.1007/3-540-53479-2_11
Semantics of Systems of Concurrent Processes
Paul GastinLecture Notes in Computer Science, Semantics of Systems of Concurrent Processes 469 277 (1990)
https://doi.org/10.1007/3-540-53479-2_12
Automata, Languages and Programming
Mireille Clerbout, Michel Latteux and Yves RoosLecture Notes in Computer Science, Automata, Languages and Programming 443 501 (1990)
https://doi.org/10.1007/BFb0032054
Mathematical Foundations of Computer Science 1990
M. Clerbout and D. GonzalezLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1990 452 209 (1990)
https://doi.org/10.1007/BFb0029610
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency
Antoni MazurkiewiczLecture Notes in Computer Science, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency 354 285 (1989)
https://doi.org/10.1007/BFb0013025
Logic at Botik '89
Wiesław ZielonkaLecture Notes in Computer Science, Logic at Botik '89 363 278 (1989)
https://doi.org/10.1007/3-540-51237-3_22
Compositions de fonctions de commutation partielle
Mireille ClerboutRAIRO - Theoretical Informatics and Applications 23 (4) 395 (1989)
https://doi.org/10.1051/ita/1989230403951
Automata, Languages and Programming
Dominique PerrinLecture Notes in Computer Science, Automata, Languages and Programming 372 637 (1989)
https://doi.org/10.1007/BFb0035789
Mathematical Foundations of Computer Science 1989
Antoine PetitLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1989 379 418 (1989)
https://doi.org/10.1007/3-540-51486-4_89
Machines, Languages, and Complexity
Michel LatteuxLecture Notes in Computer Science, Machines, Languages, and Complexity 381 37 (1989)
https://doi.org/10.1007/BFb0015926
TAPSOFT '89
P. Massazza and N. SabadiniLecture Notes in Computer Science, TAPSOFT '89 351 321 (1989)
https://doi.org/10.1007/3-540-50939-9_141
PARLE '89 Parallel Architectures and Languages Europe
Ryszard Janicki and Maciej KoutnyLecture Notes in Computer Science, PARLE '89 Parallel Architectures and Languages Europe 366 73 (1989)
https://doi.org/10.1007/3-540-51285-3_34
Semi-commutations and Petri nets
Dang Van Hung and Elöd KnuthTheoretical Computer Science 64 (1) 67 (1989)
https://doi.org/10.1016/0304-3975(89)90098-4
Automata, Languages and Programming
R. Cori and Y. MétivierLecture Notes in Computer Science, Automata, Languages and Programming 317 147 (1988)
https://doi.org/10.1007/3-540-19488-6_113
STACS 88
Edward OchmanskiLecture Notes in Computer Science, STACS 88 294 346 (1988)
https://doi.org/10.1007/BFb0035858
Theory of traces
IJsbrand Jan Aalbersberg and Grzegorz RozenbergTheoretical Computer Science 60 (1) 1 (1988)
https://doi.org/10.1016/0304-3975(88)90051-5
2-Asynchronous automata
Robert Cori, Eric Sopena, Michel Latteux and Yves RoosTheoretical Computer Science 61 (1) 93 (1988)
https://doi.org/10.1016/0304-3975(88)90110-7