scientific article; zbMATH DE number 1456962
From MaRDI portal
Publication:4954451
zbMath0938.68743MaRDI QIDQ4954451
Publication date: 7 June 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
A kleene theorem for recognizable languages over concurrency monoids, Recognizable languages in concurrency monoids, Asynchronous games. II: The true concurrency of innocence, Representation of computations in concurrent automata by dependence orders, Stable trace automata vs. full trace automata, Directed Homotopy in Non-Positively Curved Spaces
