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):

Controlling loosely cooperating processes

Anca Muscholl and Sven Schewe
Theoretical Computer Science 611 136 (2016)
DOI: 10.1016/j.tcs.2015.07.044
See this article

Compositional synthesis of asynchronous automata

Nicolas Baudru
Theoretical Computer Science 412 (29) 3701 (2011)
DOI: 10.1016/j.tcs.2011.03.030
See this article

Event structures and trace monoids

Brigitte Rozoy and P.S. Thiagarajan
Theoretical Computer Science 91 (2) 285 (1991)
DOI: 10.1016/0304-3975(91)90087-I
See this article

Semi-commutations and Petri nets

Dang Van Hung and Elöd Knuth
Theoretical Computer Science 64 (1) 67 (1989)
DOI: 10.1016/0304-3975(89)90098-4
See this article

Two optimal parallel algorithms on the commutation class of a word

René Schott and Jean-Claude Spehner
Theoretical Computer Science 324 (1) 107 (2004)
DOI: 10.1016/j.tcs.2004.03.048
See this article

Time-stamps for Mazurkiewicz traces

Wiesław Zielonka
Theoretical Computer Science 356 (1-2) 255 (2006)
DOI: 10.1016/j.tcs.2006.01.026
See this article

CONCUR 2009 - Concurrency Theory

Nicolas Baudru
Lecture Notes in Computer Science, CONCUR 2009 - Concurrency Theory 5710 115 (2009)
DOI: 10.1007/978-3-642-04081-8_9
See this article

Bicategories of processes

P. Katis, N. Sabadini and R.F.C. Walters
Journal of Pure and Applied Algebra 115 (2) 141 (1997)
DOI: 10.1016/S0022-4049(96)00012-6
See this article

Two recognizable string-matching problems over free partially commutative monoids

Kosaburo Hashiguchi and Kazuya Yamada
Theoretical Computer Science 92 (1) 77 (1992)
DOI: 10.1016/0304-3975(92)90136-4
See this article

Basic notions of universal algebra for language theory and graph grammars

Bruno Courcelle
Theoretical Computer Science 163 (1-2) 1 (1996)
DOI: 10.1016/0304-3975(95)00145-X
See this article

Semicommutations and algebraic algebraic

M. Clerbout and Y. Roos
Theoretical Computer Science 103 (1) 39 (1992)
DOI: 10.1016/0304-3975(92)90086-U
See this article

Modelling concurrency with comtraces and generalized comtraces

Ryszard Janicki and Dai Tri Man Lê
Information and Computation 209 (11) 1355 (2011)
DOI: 10.1016/j.ic.2011.08.001
See this article

The free partially commutative Lie algebra: Bases and ranks

G Duchamp and D Krob
Advances in Mathematics 95 (1) 92 (1992)
DOI: 10.1016/0001-8708(92)90045-M
See this article

On interactive knowledge with bounded communication

Ido Ben-Zvi and Yoram Moses
Journal of Applied Non-Classical Logics 21 (3-4) 323 (2011)
DOI: 10.3166/jancl.21.323-354
See this article

Distribution and synchronized automata

A. Petit
Theoretical Computer Science 76 (2-3) 285 (1990)
DOI: 10.1016/0304-3975(90)90022-A
See this article

Distributed Timed Automata

Padmanabhan Krishnan
Electronic Notes in Theoretical Computer Science 28 5 (2000)
DOI: 10.1016/S1571-0661(05)80627-9
See this article

Security and Privacy Protection in Information Processing Systems

Padmanabhan Krishnan and Kostyantyn Vorobyov
IFIP Advances in Information and Communication Technology, Security and Privacy Protection in Information Processing Systems 405 272 (2013)
DOI: 10.1007/978-3-642-39218-4_21
See this article

Transactions on Petri Nets and Other Models of Concurrency X

Ramchandra Phawade and Kamal Lodaya
Lecture Notes in Computer Science, Transactions on Petri Nets and Other Models of Concurrency X 9410 84 (2015)
DOI: 10.1007/978-3-662-48650-4_5
See this article

Mixed languages

Jean Berstel, Luc Boasson and Michel Latteux
Theoretical Computer Science 332 (1-3) 179 (2005)
DOI: 10.1016/j.tcs.2004.08.016
See this article

Hierarchy of Asynchronous Automata

Electronic Notes in Theoretical Computer Science 28 22 (2000)
DOI: 10.1016/S1571-0661(05)80628-0
See this article

A study on shuffle, stopwatches and independently evolving clocks

Cătălin Dima and Ruggero Lanotte
Distributed Computing 25 (1) 5 (2012)
DOI: 10.1007/s00446-011-0148-2
See this article

An extension of Kleene's and Ochmański's theorems to infinite traces

Paul Gastin, Antoine Petit and Wiesław Zielonka
Theoretical Computer Science 125 (2) 167 (1994)
DOI: 10.1016/0304-3975(94)90254-2
See this article

Asynchronous automata versus asynchronous cellular automata

Giovanni Pighizzini
Theoretical Computer Science 132 (1-2) 179 (1994)
DOI: 10.1016/0304-3975(94)90232-1
See this article

2-Asynchronous automata

Robert Cori, Eric Sopena, Michel Latteux and Yves Roos
Theoretical Computer Science 61 (1) 93 (1988)
DOI: 10.1016/0304-3975(88)90110-7
See this article

Structure of concurrency

Ryszard Janicki and Maciej Koutny
Theoretical Computer Science 112 (1) 5 (1993)
DOI: 10.1016/0304-3975(93)90238-O
See this article

Weighted asynchronous cellular automata

Dietrich Kuske
Theoretical Computer Science 374 (1-3) 127 (2007)
DOI: 10.1016/j.tcs.2006.11.031
See this article

Asynchronous trace-matching automata

K. V. Shahbazyan and Yu. H. Shoukourian
Cybernetics and Systems Analysis 48 (3) 323 (2012)
DOI: 10.1007/s10559-012-9411-1
See this article

A quadratic construction for Zielonka automata with acyclic communication structure

Siddharth Krishna and Anca Muscholl
Theoretical Computer Science 503 109 (2013)
DOI: 10.1016/j.tcs.2013.07.015
See this article

Representation of computations in concurrent automata by dependence orders

Felipe Bracho, Manfred Droste and Dietrich Kuske
Theoretical Computer Science 174 (1-2) 67 (1997)
DOI: 10.1016/S0304-3975(96)00012-6
See this article

Compilation of the ELECTRE reactive language into finite transition systems

Franck Cassez and Olivier Roux
Theoretical Computer Science 146 (1-2) 109 (1995)
DOI: 10.1016/0304-3975(94)00136-7
See this article

Contracts for cross-organizational workflows as timed Dynamic Condition Response Graphs

Thomas Hildebrandt, Raghava Rao Mukkamala, Tijs Slaats and Francesco Zanitti
The Journal of Logic and Algebraic Programming 82 (5-7) 164 (2013)
DOI: 10.1016/j.jlap.2013.05.005
See this article

Series–parallel languages and the bounded-width property

K Lodaya and P Weil
Theoretical Computer Science 237 (1-2) 347 (2000)
DOI: 10.1016/S0304-3975(00)00031-1
See this article

Models for quantitative distributed systems and multi-valued logics

Martin Huschenbett
International Journal of Computer Mathematics 90 (6) 1223 (2013)
DOI: 10.1080/00207160.2012.702211
See this article

Probabilistic estimation of the number of prefixes of a trace

Massimiliano Goldwurm
Theoretical Computer Science 92 (2) 249 (1992)
DOI: 10.1016/0304-3975(92)90314-6
See this article

Computer Science – Theory and Applications

Rémi Morin
Lecture Notes in Computer Science, Computer Science – Theory and Applications 6651 317 (2011)
DOI: 10.1007/978-3-642-20712-9_25
See this article

Descriptional Complexity of Formal Systems

Kamal Lodaya, Madhavan Mukund and Ramchandra Phawade
Lecture Notes in Computer Science, Descriptional Complexity of Formal Systems 6808 235 (2011)
DOI: 10.1007/978-3-642-22600-7_19
See this article

Recognizable closures and submonoids of free partially commutative monoids

Kosaburo Hashiguchi
Theoretical Computer Science 86 (2) 233 (1991)
DOI: 10.1016/0304-3975(91)90019-X
See this article


International Journal of Foundations of Computer Science 17 (04) 743 (2006)
DOI: 10.1142/S012905410600408X
See this article

Enforcement of privacy requirements

Padmanabhan Krishnan and Kostyantyn Vorobyov
Computers & Security 52 164 (2015)
DOI: 10.1016/j.cose.2015.03.004
See this article

Atomic semicommutations

M. Clerbout and D. Gonzalez
Theoretical Computer Science 123 (2) 259 (1994)
DOI: 10.1016/0304-3975(92)00066-Z
See this article

Synchronizations in Team Automata for Groupware Systems

Maurice H. ter Beek, Clarence A. Ellis, Jetty Kleijn and Grzegorz Rozenberg
Computer Supported Cooperative Work (CSCW) 12 (1) 21 (2003)
DOI: 10.1023/A:1022407907596
See this article

Petri games: Synthesis of distributed systems with causal memory

Bernd Finkbeiner and Ernst-Rüdiger Olderog
Information and Computation 253 181 (2017)
DOI: 10.1016/j.ic.2016.07.006
See this article

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)
DOI: 10.1016/j.jcss.2011.05.004
See this article

Theory of traces

IJsbrand Jan Aalbersberg and Grzegorz Rozenberg
Theoretical Computer Science 60 (1) 1 (1988)
DOI: 10.1016/0304-3975(88)90051-5
See this article

Classifying recognizable infinitary trace languages using word automata

Namit Chaturvedi and Marcus Gelderie
Information and Computation (2017)
DOI: 10.1016/j.ic.2017.04.006
See this article

A nice labelling for tree-like event structures of degree 3

Luigi Santocanale
Information and Computation 208 (6) 652 (2010)
DOI: 10.1016/j.ic.2009.05.006
See this article

Software Engineering and Formal Methods

Thomas Hildebrandt, Raghava Rao Mukkamala and Tijs Slaats
Lecture Notes in Computer Science, Software Engineering and Formal Methods 7041 237 (2011)
DOI: 10.1007/978-3-642-24690-6_17
See this article