Iteration theories of synchronization trees
From MaRDI portal
Publication:1207946
DOI10.1006/inco.1993.1001zbMath0780.68088MaRDI QIDQ1207946
Zoltán Ésik, Dirk Taubner, Stephen L. Bloom
Publication date: 16 May 1993
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1993.1001
iteration theories; synchronization trees; branching time semantics; \(\omega\)-continuous 2-theory; bisimulation equivalence classes; synchronization theories
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
03B70: Logic in computer science
68Q55: Semantics in the theory of computing
03D75: Abstract and axiomatic computability and recursion theory
Related Items
Traced monoidal categories, A Finite Axiomatization of Nondeterministic Regular Expressions, Nonaxiomatisability of equivalences over finite state processes, The equational logic of fixed points, Nondeterministic regular expressions as solutions of equational systems., Tile formats for located and mobile systems., Models of nondeterministic regular expressions