scientific article; zbMATH DE number 177814

MaRDI QIDQ4038692zbMATH OpenFDO

Authors Manfred Droste

Publication date 18 May 1993

zbMATH Keywords

concurrency domainsconcurrent automatalabeled transition systemsoperational model of concurrent systemsScott-domains

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• CONCURRENT AUTOMATA AND DOMAINS
• Dependence orders for computations of concurrent automata
• From domains to automata with concurrency
• Labelled domains and automata with concurrency
• scientific article; zbMATH DE number 1456962

Cited in

(16)

• Four domains for concurrency
• Defining conditional independence using collapses
• Representation of computations in concurrent automata by dependence orders
• Stable trace automata vs. full trace automata
• Labelled domains and automata with concurrency
• Automata for true concurrency properties
• Semantics of Deterministic Shared-Memory Systems
• CONCURRENT AUTOMATA AND DOMAINS
• scientific article; zbMATH DE number 554483 (Why is no real title available?)
• From domains to automata with concurrency
• A Kleene theorem for recognizable languages over concurrency monoids
• Observational trees as models for concurrency
• scientific article; zbMATH DE number 1456962 (Why is no real title available?)
• Connections between a concrete and an abstract model of concurrent systems
• Languages and logical definability in concurrency monoids
• Recognizable languages in concurrency monoids

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4038692)