Trace languages defined by regular string languages
RAIRO-Theor. Inf. Appl., 20 2 (1986) 103-119
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):
1015 (2020)
https://doi.org/10.1109/ICARCV50220.2020.9305409
On Distributed and Parameterized Supervisor Synthesis Problems
Liyong Lin, Alin Stefanescu and Rong SuIEEE Transactions on Automatic Control 61 (3) 777 (2016)
https://doi.org/10.1109/TAC.2015.2447193
Two techniques in the area of the star problem in trace monoids
Daniel Kirsten and Jerzy MarcinkowskiTheoretical Computer Science 309 (1-3) 381 (2003)
https://doi.org/10.1016/S0304-3975(03)00313-X
Analysis of algorithms for the recognition of rational and context-free trace languages
A. Avellone and M. GoldwurmRAIRO - Theoretical Informatics and Applications 32 (4-6) 141 (1998)
https://doi.org/10.1051/ita/1998324-601411
Fundamentals of Computation Theory
Christian Choffrut and Leucio GuerraLecture Notes in Computer Science, Fundamentals of Computation Theory 1279 138 (1997)
https://doi.org/10.1007/BFb0036178
Logical definability of some rational trace languages
C. Choffrut and L. GuerraMathematical Systems Theory 28 (5) 397 (1995)
https://doi.org/10.1007/BF01185864
STACS 93
C. Choffrut and L. GuerraLecture Notes in Computer Science, STACS 93 665 494 (1993)
https://doi.org/10.1007/3-540-56503-5_49
On the structure of recognizable languages of dependence graphs
A. Ehrenfeucht, H. J. Hoogeboom and G. RozenbergRAIRO - Theoretical Informatics and Applications 27 (1) 7 (1993)
https://doi.org/10.1051/ita/1993270100071
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
On the decidability of the equivalence problem for partially commutative rational power series
Stefano VarricchioTheoretical Computer Science 99 (2) 291 (1992)
https://doi.org/10.1016/0304-3975(92)90354-I
LATIN '92
Jacques SakarovitchLecture Notes in Computer Science, LATIN '92 583 460 (1992)
https://doi.org/10.1007/BFb0023848
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
Complete subgraphs of bipartite graphs and applications to trace languages
G. Guaiana, A. Restivo and S. SalemiRAIRO - Theoretical Informatics and Applications 24 (4) 409 (1990)
https://doi.org/10.1051/ita/1990240404091
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
Automata, Languages and Programming
Dominique PerrinLecture Notes in Computer Science, Automata, Languages and Programming 372 637 (1989)
https://doi.org/10.1007/BFb0035789
Machines, Languages, and Complexity
Michel LatteuxLecture Notes in Computer Science, Machines, Languages, and Complexity 381 37 (1989)
https://doi.org/10.1007/BFb0015926
Characterizations of the decidability of some problems for regular trace languages
IJ. J. Aalbersberg and H. J. HoogeboomMathematical Systems Theory 22 (1) 1 (1989)
https://doi.org/10.1007/BF02088289
Advances in Petri Nets 1988
Peter GraubmannLecture Notes in Computer Science, Advances in Petri Nets 1988 340 133 (1988)
https://doi.org/10.1007/3-540-50580-6_27
STACS 88
D. Bruschi, G. Pighizzini and N. SabadiniLecture Notes in Computer Science, STACS 88 294 334 (1988)
https://doi.org/10.1007/BFb0035857
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
Petri Nets: Applications and Relationships to Other Models of Concurrency
Antoni MazurkiewiczLecture Notes in Computer Science, Petri Nets: Applications and Relationships to Other Models of Concurrency 255 278 (1987)
https://doi.org/10.1007/3-540-17906-2_30
Automata, Languages and Programming
IJsbrand Jan Abalbersberg and Hendrik Jan HoogeboomLecture Notes in Computer Science, Automata, Languages and Programming 267 250 (1987)
https://doi.org/10.1007/3-540-18088-5_20
Mixed product and asynchronous automata
Christine DubocTheoretical Computer Science 48 183 (1986)
https://doi.org/10.1016/0304-3975(86)90094-0