scientific article
From MaRDI portal
Publication:4035661
zbMath0773.68057MaRDI QIDQ4035661
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
concurrent systemssemanticsprocessesultra-metric spacedependence graphsalphabet at infinitydirect products of free monoids
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theory of computing (68Q99)
Related Items (9)
Deterministic asynchronous automata for infinite traces ⋮ Infinite concurrent systems. I: The relationship between metric and order convergence ⋮ Poset properties of complex traces ⋮ The word problem for \(1\mathcal{LC}\) congruences is NP-hard. ⋮ On the concatenation of infinite traces ⋮ The poset of infinitary traces ⋮ Asynchronous cellular automata for infinite traces ⋮ Logical definability on infinite traces ⋮ An extension of Kleene's and Ochmański's theorems to infinite traces
This page was built for publication: