Iteration theories of synchronization trees
From MaRDI portal
Publication:1207946
DOI10.1006/inco.1993.1001zbMath0780.68088OpenAlexW1967390724MaRDI QIDQ1207946
Dirk Taubner, Stephen L. Bloom, Zoltán Ésik
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 theoriessynchronization treesbranching time semantics\(\omega\)-continuous 2-theorybisimulation equivalence classessynchronization theories
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Abstract and axiomatic computability and recursion theory (03D75)
Related Items
A connection between concurrency and language theory, Symbolic model checking for probabilistic processes, Nonaxiomatisability of equivalences over finite state processes, Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview, The equational logic of fixed points, Nondeterministic regular expressions as solutions of equational systems., Unnamed Item, Traced monoidal categories, Equational properties of fixed-point operations in cartesian categories: An overview, Axiomatizing weighted synchronization trees and weighted bisimilarity, Models of nondeterministic regular expressions, A Finite Axiomatization of Nondeterministic Regular Expressions, The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics, Tile formats for located and mobile systems.
