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):
16503 133 (2026)
https://doi.org/10.1007/978-3-032-22730-0_7
15471 183 (2026)
https://doi.org/10.1007/978-3-031-97537-0_11
16503 396 (2026)
https://doi.org/10.1007/978-3-032-22730-0_19
Implementability of Global Distributed Protocols Modulo Network Architectures
Elaine Li and Thomas WiesProceedings of the ACM on Programming Languages 10 (PLDI) 1812 (2026)
https://doi.org/10.1145/3808319
Backwards-reachability for cooperating multi-pushdown systems
Chris Köcher and Dietrich KuskeJournal of Computer and System Sciences 148 103601 (2025)
https://doi.org/10.1016/j.jcss.2024.103601
15402 69 (2025)
https://doi.org/10.1007/978-3-031-89610-1_5
15695 314 (2025)
https://doi.org/10.1007/978-3-031-91121-7_13
15054 160 (2025)
https://doi.org/10.1007/978-3-031-78709-6_8
15262 399 (2025)
https://doi.org/10.1007/978-3-031-75778-5_19
Hypernode automata
Ezio Bartocci, Marek Chalupa, Thomas A. Henzinger, Dejan Nickovic and Ana Oliveira da CostaActa Informatica 62 (4) (2025)
https://doi.org/10.1007/s00236-025-00509-8
Characterizing Implementability of Global Protocols with Infinite States and Data
Elaine Li, Felix Stutz, Thomas Wies and Damien ZuffereyProceedings of the ACM on Programming Languages 9 (OOPSLA1) 1434 (2025)
https://doi.org/10.1145/3720493
14791 51 (2024)
https://doi.org/10.1007/978-3-031-66159-4_5
Adding Reconfiguration to Zielonka's Asynchronous Automata
Mathieu Lehaut and Nir PitermanElectronic Proceedings in Theoretical Computer Science 409 88 (2024)
https://doi.org/10.4204/EPTCS.409.10
14151 21 (2023)
https://doi.org/10.1007/978-3-031-40247-0_2
14292 318 (2023)
https://doi.org/10.1007/978-3-031-43587-4_23
Coordination Models and Languages
Franco Barbanera, Ivan Lanese and Emilio TuostoLecture Notes in Computer Science, Coordination Models and Languages 13271 121 (2022)
https://doi.org/10.1007/978-3-031-08143-9_8
Modeling and Verification of Asynchronous Systems Using Timed Integrated Model of Distributed Systems
Wiktor B. DaszczukSensors 22 (3) 1157 (2022)
https://doi.org/10.3390/s22031157
Application and Theory of Petri Nets and Concurrency
Paul Hannibal and Ernst-Rüdiger OlderogLecture Notes in Computer Science, Application and Theory of Petri Nets and Concurrency 13288 236 (2022)
https://doi.org/10.1007/978-3-031-06653-5_13
Computer Aided Verification
Mateus de Oliveira OliveiraLecture Notes in Computer Science, Computer Aided Verification 13372 447 (2022)
https://doi.org/10.1007/978-3-031-13188-2_22
Theoretical Aspects of Computing – ICTAC 2022
Yehia Abd Alrahman, Mauricio Martel and Nir PitermanLecture Notes in Computer Science, Theoretical Aspects of Computing – ICTAC 2022 13572 42 (2022)
https://doi.org/10.1007/978-3-031-17715-6_5
Graphic modeling in Distributed Autonomous and Asynchronous Automata (DA3)
Wiktor B. DaszczukSoftware and Systems Modeling 21 (1) 363 (2022)
https://doi.org/10.1007/s10270-021-00917-7
955 (2021)
https://doi.org/10.1109/ASE51524.2021.9678572
Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
Benedikt Bollig, Marie Fortin and Paul GastinJournal of Computer and System Sciences 115 22 (2021)
https://doi.org/10.1016/j.jcss.2020.06.006
Model Checking, Synthesis, and Learning
Manuel Gieseking and Ernst-Rüdiger OlderogLecture Notes in Computer Science, Model Checking, Synthesis, and Learning 13030 115 (2021)
https://doi.org/10.1007/978-3-030-91384-7_7
Automata and fixpoints for asynchronous hyperproperties
Jens Oliver Gutsfeld, Markus Müller-Olm and Christoph OhremProceedings of the ACM on Programming Languages 5 (POPL) 1 (2021)
https://doi.org/10.1145/3434319
Integrated Model of Distributed Systems
Wiktor B. DaszczukStudies in Computational Intelligence, Integrated Model of Distributed Systems 817 1 (2020)
https://doi.org/10.1007/978-3-030-12835-7_1
Solving high-level Petri games
Manuel Gieseking, Ernst-Rüdiger Olderog and Nick WürdemannActa Informatica 57 (3-5) 591 (2020)
https://doi.org/10.1007/s00236-020-00368-5
Integrated Model of Distributed Systems
Wiktor B. DaszczukStudies in Computational Intelligence, Integrated Model of Distributed Systems 817 125 (2020)
https://doi.org/10.1007/978-3-030-12835-7_8
11990 314 (2020)
https://doi.org/10.1007/978-3-030-39322-9_15
Transactions on Petri Nets and Other Models of Concurrency XIV
Ramchandra PhawadeLecture Notes in Computer Science, Transactions on Petri Nets and Other Models of Concurrency XIV 11790 146 (2019)
https://doi.org/10.1007/978-3-662-60651-3_6
Specification and Verification in Integrated Model of Distributed Systems (IMDS)
Wiktor B. DaszczukComputers 7 (4) 65 (2018)
https://doi.org/10.3390/computers7040065
Realizability of concurrent recursive programs
Benedikt Bollig, Manuela-Lidia Grindei and Peter HabermehlFormal Methods in System Design 53 (3) 339 (2018)
https://doi.org/10.1007/s10703-017-0282-y
Petri games: Synthesis of distributed systems with causal memory
Bernd Finkbeiner and Ernst-Rüdiger OlderogInformation and Computation 253 181 (2017)
https://doi.org/10.1016/j.ic.2016.07.006
Classifying recognizable infinitary trace languages using word automata
Namit Chaturvedi and Marcus GelderieInformation and Computation 256 23 (2017)
https://doi.org/10.1016/j.ic.2017.04.006
Symbolic vs. Bounded Synthesis for Petri Games
Bernd Finkbeiner, Manuel Gieseking, Jesko Hecking-Harbusch and Ernst-Rüdiger OlderogElectronic Proceedings in Theoretical Computer Science 260 23 (2017)
https://doi.org/10.4204/EPTCS.260.5
Controlling loosely cooperating processes
Anca Muscholl and Sven ScheweTheoretical Computer Science 611 136 (2016)
https://doi.org/10.1016/j.tcs.2015.07.044
Distributed Computing and Internet Technology
Massimo Bartoletti, Tiziana Cimoli, G. Michele Pinna and Roberto ZuninoLecture Notes in Computer Science, Distributed Computing and Internet Technology 8956 1 (2015)
https://doi.org/10.1007/978-3-319-14977-6_1
Business Process Management
Søren Debois, Thomas Hildebrandt and Tijs SlaatsLecture Notes in Computer Science, Business Process Management 9253 72 (2015)
https://doi.org/10.1007/978-3-319-23063-4_5
Implementation and Application of Automata
Benedikt BolligLecture Notes in Computer Science, Implementation and Application of Automata 9223 3 (2015)
https://doi.org/10.1007/978-3-319-22360-5_1
Enforcement of privacy requirements
Padmanabhan Krishnan and Kostyantyn VorobyovComputers & Security 52 164 (2015)
https://doi.org/10.1016/j.cose.2015.03.004
Evolving Computability
Anca MuschollLecture Notes in Computer Science, Evolving Computability 9136 54 (2015)
https://doi.org/10.1007/978-3-319-20028-6_6
Transactions on Petri Nets and Other Models of Concurrency X
Ramchandra Phawade and Kamal LodayaLecture Notes in Computer Science, Transactions on Petri Nets and Other Models of Concurrency X 9410 84 (2015)
https://doi.org/10.1007/978-3-662-48650-4_5
Automata, Languages, and Programming
Anca MuschollLecture Notes in Computer Science, Automata, Languages, and Programming 9135 11 (2015)
https://doi.org/10.1007/978-3-662-47666-6_2
Transactions on Petri Nets and Other Models of Concurrency IX
Thomas Chatain and Stefan HaarLecture Notes in Computer Science, Transactions on Petri Nets and Other Models of Concurrency IX 8910 83 (2014)
https://doi.org/10.1007/978-3-662-45730-6_5
1 (2014)
https://doi.org/10.1145/2603088.2603093
Temporal logics for concurrent recursive programs: Satisfiability and model checking
Benedikt Bollig, Aiswarya Cyriac, Paul Gastin and Marc ZeitounJournal of Applied Logic 12 (4) 395 (2014)
https://doi.org/10.1016/j.jal.2014.05.001
Contracts for cross-organizational workflows as timed Dynamic Condition Response Graphs
Thomas Hildebrandt, Raghava Rao Mukkamala, Tijs Slaats and Francesco ZanittiThe Journal of Logic and Algebraic Programming 82 (5-7) 164 (2013)
https://doi.org/10.1016/j.jlap.2013.05.005
Models for quantitative distributed systems and multi-valued logics
Martin HuschenbettInternational Journal of Computer Mathematics 90 (6) 1223 (2013)
https://doi.org/10.1080/00207160.2012.702211
Automata, Languages, and Programming
Blaise Genest, Hugo Gimbert, Anca Muscholl and Igor WalukiewiczLecture Notes in Computer Science, Automata, Languages, and Programming 7966 275 (2013)
https://doi.org/10.1007/978-3-642-39212-2_26
Mathematical Foundations of Computer Science 2013
Anca Muscholl and Sven ScheweLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2013 8087 691 (2013)
https://doi.org/10.1007/978-3-642-40313-2_61
Security and Privacy Protection in Information Processing Systems
Padmanabhan Krishnan and Kostyantyn VorobyovIFIP Advances in Information and Communication Technology, Security and Privacy Protection in Information Processing Systems 405 272 (2013)
https://doi.org/10.1007/978-3-642-39218-4_21
A quadratic construction for Zielonka automata with acyclic communication structure
Siddharth Krishna and Anca MuschollTheoretical Computer Science 503 109 (2013)
https://doi.org/10.1016/j.tcs.2013.07.015
7400 24 (2012)
https://doi.org/10.1007/978-3-642-35179-2_2
A study on shuffle, stopwatches and independently evolving clocks
Cătălin Dima and Ruggero LanotteDistributed Computing 25 (1) 5 (2012)
https://doi.org/10.1007/s00446-011-0148-2
Asynchronous trace-matching automata
K. V. Shahbazyan and Yu. H. ShoukourianCybernetics and Systems Analysis 48 (3) 323 (2012)
https://doi.org/10.1007/s10559-012-9411-1
Solving parity games by a reduction to SAT
Keijo Heljanko, Misa Keinänen, Martin Lange and Ilkka NiemeläJournal of Computer and System Sciences 78 (2) 430 (2012)
https://doi.org/10.1016/j.jcss.2011.05.004
Foundations of Health Informatics Engineering and Systems
Thomas Hildebrandt, Raghava Rao Mukkamala and Tijs SlaatsLecture Notes in Computer Science, Foundations of Health Informatics Engineering and Systems 7151 39 (2012)
https://doi.org/10.1007/978-3-642-32355-3_3
REASONING WITH PROTOCOLS UNDER IMPERFECT INFORMATION
ERIC PACUIT and SUNIL SIMONThe Review of Symbolic Logic 4 (3) 412 (2011)
https://doi.org/10.1017/S1755020311000190
Compositional synthesis of asynchronous automata
Nicolas BaudruTheoretical Computer Science 412 (29) 3701 (2011)
https://doi.org/10.1016/j.tcs.2011.03.030
Software Engineering and Formal Methods
Thomas Hildebrandt, Raghava Rao Mukkamala and Tijs SlaatsLecture Notes in Computer Science, Software Engineering and Formal Methods 7041 237 (2011)
https://doi.org/10.1007/978-3-642-24690-6_17
On interactive knowledge with bounded communication
Ido Ben-Zvi and Yoram MosesJournal of Applied Non-Classical Logics 21 (3-4) 323 (2011)
https://doi.org/10.3166/jancl.21.323-354
Modelling concurrency with comtraces and generalized comtraces
Ryszard Janicki and Dai Tri Man LêInformation and Computation 209 (11) 1355 (2011)
https://doi.org/10.1016/j.ic.2011.08.001
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
Descriptional Complexity of Formal Systems
Kamal Lodaya, Madhavan Mukund and Ramchandra PhawadeLecture Notes in Computer Science, Descriptional Complexity of Formal Systems 6808 235 (2011)
https://doi.org/10.1007/978-3-642-22600-7_19
UNAMBIGUOUS SHARED-MEMORY SYSTEMS
RÉMI MORINInternational Journal of Foundations of Computer Science 21 (04) 665 (2010)
https://doi.org/10.1142/S0129054110007489
Automated Technology for Verification and Analysis
Igor WalukiewiczLecture Notes in Computer Science, Automated Technology for Verification and Analysis 6252 18 (2010)
https://doi.org/10.1007/978-3-642-15643-4_3
A nice labelling for tree-like event structures of degree 3
Luigi SantocanaleInformation and Computation 208 (6) 652 (2010)
https://doi.org/10.1016/j.ic.2009.05.006
CONCUR 2010 - Concurrency Theory
Anca MuschollLecture Notes in Computer Science, CONCUR 2010 - Concurrency Theory 6269 40 (2010)
https://doi.org/10.1007/978-3-642-15375-4_4
Automata for Epistemic Temporal Logic with Synchronous Communication
Swarup Mohalik and R. RamanujamJournal of Logic, Language and Information 19 (4) 451 (2010)
https://doi.org/10.1007/s10849-009-9118-5
Automata, Languages and Programming
Blaise Genest, Hugo Gimbert, Anca Muscholl and Igor WalukiewiczLecture Notes in Computer Science, Automata, Languages and Programming 6199 52 (2010)
https://doi.org/10.1007/978-3-642-14162-1_5
Trace monoids with idempotent generators and measure-only quantum automata
Alberto Bertoni, Carlo Mereghetti and Beatrice PalanoNatural Computing 9 (2) 383 (2010)
https://doi.org/10.1007/s11047-009-9154-8
CONCUR 2009 - Concurrency Theory
Nicolas BaudruLecture Notes in Computer Science, CONCUR 2009 - Concurrency Theory 5710 115 (2009)
https://doi.org/10.1007/978-3-642-04081-8_9
405 (2009)
https://doi.org/10.1007/978-3-642-01492-5_10
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
Theoretical Aspects of Computing – ICTAC 2007
Cătălin Dima and Ruggero LanotteLecture Notes in Computer Science, Theoretical Aspects of Computing – ICTAC 2007 4711 185 (2007)
https://doi.org/10.1007/978-3-540-75292-9_13
Weighted asynchronous cellular automata
Dietrich KuskeTheoretical Computer Science 374 (1-3) 127 (2007)
https://doi.org/10.1016/j.tcs.2006.11.031
13 (2007)
https://doi.org/10.1109/ACSD.2007.33
Logical Foundations of Computer Science
Benedikt Bollig and Ingmar MeineckeLecture Notes in Computer Science, Logical Foundations of Computer Science 4514 54 (2007)
https://doi.org/10.1007/978-3-540-72734-7_5
Computer Science – Theory and Applications
Nicolas Baudru and Rémi MorinLecture Notes in Computer Science, Computer Science – Theory and Applications 3967 46 (2006)
https://doi.org/10.1007/11753728_8
Petri Nets and Other Models of Concurrency - ICATPN 2006
Nicolas Baudru and Rémi MorinLecture Notes in Computer Science, Petri Nets and Other Models of Concurrency - ICATPN 2006 4024 84 (2006)
https://doi.org/10.1007/11767589_6
128 (2006)
https://doi.org/10.1109/SEFM.2006.30
ENFORCING CONCURRENT TEMPORAL BEHAVIORS
DORON PELED and HONGYANG QUInternational Journal of Foundations of Computer Science 17 (04) 743 (2006)
https://doi.org/10.1142/S012905410600408X
Time-stamps for Mazurkiewicz traces
Wiesław ZielonkaTheoretical Computer Science 356 (1-2) 255 (2006)
https://doi.org/10.1016/j.tcs.2006.01.026
78 (2005)
https://doi.org/10.1109/ACSD.2005.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
Machines, Computations, and Universality
René Schott and Jean-Claude SpehnerLecture Notes in Computer Science, Machines, Computations, and Universality 3354 316 (2005)
https://doi.org/10.1007/978-3-540-31834-7_26
CONCUR 2005 – Concurrency Theory
Blaise GenestLecture Notes in Computer Science, CONCUR 2005 – Concurrency Theory 3653 443 (2005)
https://doi.org/10.1007/11539452_34
Mixed languages
Jean Berstel, Luc Boasson and Michel LatteuxTheoretical Computer Science 332 (1-3) 179 (2005)
https://doi.org/10.1016/j.tcs.2004.08.016
Fundamentals of Computation Theory
Benedikt BolligLecture Notes in Computer Science, Fundamentals of Computation Theory 3623 528 (2005)
https://doi.org/10.1007/11537311_46
98 (2005)
https://doi.org/10.1109/ACSD.2005.33
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Bharat Adsul and Milind SohoniLecture Notes in Computer Science, FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science 3328 84 (2004)
https://doi.org/10.1007/978-3-540-30538-5_8
Developments in Language Theory
Blaise Genest, Anca Muscholl and Dietrich KuskeLecture Notes in Computer Science, Developments in Language Theory 3340 30 (2004)
https://doi.org/10.1007/978-3-540-30550-7_4
Two optimal parallel algorithms on the commutation class of a word
René Schott and Jean-Claude SpehnerTheoretical Computer Science 324 (1) 107 (2004)
https://doi.org/10.1016/j.tcs.2004.03.048
CONCUR 2003 - Concurrency Theory
Alin Ştefănescu, Javier Esparza and Anca MuschollLecture Notes in Computer Science, CONCUR 2003 - Concurrency Theory 2761 27 (2003)
https://doi.org/10.1007/978-3-540-45187-7_2
Applications and Theory of Petri Nets 2003
Marek A. Bednarczyk, Luca Bernardinello, Benoît Caillaud, Wiesław Pawłowski and Lucia PomelloLecture Notes in Computer Science, Applications and Theory of Petri Nets 2003 2679 140 (2003)
https://doi.org/10.1007/3-540-44919-1_12
Synchronizations in Team Automata for Groupware Systems
Maurice H. ter Beek, Clarence A. Ellis, Jetty Kleijn and Grzegorz RozenbergComputer Supported Cooperative Work (CSCW) 12 (1) 21 (2003)
https://doi.org/10.1023/A:1022407907596
Petri Net Technology for Communication-Based Systems
Jetty KleijnLecture Notes in Computer Science, Petri Net Technology for Communication-Based Systems 2472 295 (2003)
https://doi.org/10.1007/978-3-540-40022-6_15
Evolvable Systems: From Biology to Hardware
Christof Teuscher and Mathieu S. CapcarrereLecture Notes in Computer Science, Evolvable Systems: From Biology to Hardware 2606 1 (2003)
https://doi.org/10.1007/3-540-36553-2_1
Parallel asynchronous computations for image analysis
B. Ducourthial and A. MerigotProceedings of the IEEE 90 (7) 1218 (2002)
https://doi.org/10.1109/JPROC.2002.801454