CONCURRENT AUTOMATA AND DOMAINS
From MaRDI portal
Publication:4032921
DOI10.1142/S0129054192000218zbMath0820.68045MaRDI QIDQ4032921
Publication date: 16 May 1993
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Labelled domains and automata with concurrency, The topology of Mazurkiewicz traces., From domains to automata with concurrency, A kleene theorem for recognizable languages over concurrency monoids, Models for concurrency: Towards a classification, Recognizable languages in concurrency monoids, Model-checking games for fixpoint logics with partial order models, A Nice labelling for tree-like event structures of degree 3, Concurrent semantics for fusions: weak prime domains and connected event structures, Representation of computations in concurrent automata by dependence orders, RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA
