Extends pomsetc and step automata with communication operators and establishes algebras modulo language equivalence and truly concurrent bisimilarities.
Kozen, A completeness theorem for kleene algebras an d the algebra of regular events, Tech
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Computation and Concurrency
Extends pomsetc and step automata with communication operators and establishes algebras modulo language equivalence and truly concurrent bisimilarities.