A generalization of traces
RAIRO-Theor. Inf. Appl., 25 2 (1991) 147-156
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):
13929 145 (2023)
https://doi.org/10.1007/978-3-031-33620-1_8
Paradigms of Concurrency
Ryszard Janicki, Jetty Kleijn, Maciej Koutny and Łukasz MikulskiStudies in Computational Intelligence, Paradigms of Concurrency 1020 313 (2022)
https://doi.org/10.1007/978-3-662-64821-6_11
Relational structures for concurrent behaviours
Ryszard Janicki, Jetty Kleijn, Maciej Koutny and Łukasz MikulskiTheoretical Computer Science 862 174 (2021)
https://doi.org/10.1016/j.tcs.2020.10.019
Classifying invariant structures of step traces
Ryszard Janicki, Jetty Kleijn, Maciej Koutny and Łukasz MikulskiJournal of Computer and System Sciences 104 297 (2019)
https://doi.org/10.1016/j.jcss.2017.05.002
Step traces
Ryszard Janicki, Jetty Kleijn, Maciej Koutny and Łukasz MikulskiActa Informatica 53 (1) 35 (2016)
https://doi.org/10.1007/s00236-015-0244-z
Application and Theory of Petri Nets and Concurrency
Thomas Chatain, Stefan Haar, Maciej Koutny and Stefan SchwoonLecture Notes in Computer Science, Application and Theory of Petri Nets and Concurrency 9115 117 (2015)
https://doi.org/10.1007/978-3-319-19488-2_6
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
The word problem for 1LC congruences is NP-hard
Laurent RosazTheoretical Computer Science 306 (1-3) 245 (2003)
https://doi.org/10.1016/S0304-3975(03)00283-4
Structures in Concurrency Theory
I. Biermann and B. RozoyWorkshops in Computing, Structures in Concurrency Theory 101 (1995)
https://doi.org/10.1007/978-1-4471-3078-9_7