Extends pomsetc and step automata with communication operators and establishes algebras modulo language equivalence and truly concurrent bisimilarities.
Fokkink, A complete equational axiomatization for p refix iteration, Information pro- cessing letters 52 (6) (1994) 333–337
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.