scientific article
From MaRDI portal
Publication:4038692
zbMath0765.68100MaRDI QIDQ4038692
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
labeled transition systemsScott-domainsconcurrent automataconcurrency domainsoperational model of concurrent systems
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (8)
Labelled domains and automata with concurrency ⋮ Semantics of Deterministic Shared-Memory Systems ⋮ From domains to automata with concurrency ⋮ A kleene theorem for recognizable languages over concurrency monoids ⋮ Recognizable languages in concurrency monoids ⋮ Defining conditional independence using collapses ⋮ Representation of computations in concurrent automata by dependence orders ⋮ Stable trace automata vs. full trace automata
This page was built for publication: