An extension of Kleene's and Ochmański's theorems to infinite traces
- 28 March 1994
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 125 (2) , 167-204
- https://doi.org/10.1016/0304-3975(94)90254-2
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The poset of infinitary tracesTheoretical Computer Science, 1993
- Recognizable closures and submonoids of free partially commutative monoidsTheoretical Computer Science, 1991
- ON THE STAR OPERATION IN FREE PARTIALLY COMMUTATIVE MONOIDSInternational Journal of Foundations of Computer Science, 1991
- On recognizable subsets of free partially commutative monoidsTheoretical Computer Science, 1988
- Theory of tracesTheoretical Computer Science, 1988
- Sequential and concurrent behaviour in Petri net theoryTheoretical Computer Science, 1987
- Semi-commutationsInformation and Computation, 1987
- Maximal serializability of iterated transactionsTheoretical Computer Science, 1985
- A syntactic congruence for rational ω-languagesTheoretical Computer Science, 1985
- Automates et commutations partiellesRAIRO. Informatique théorique, 1985