scientific article; zbMATH DE number 177814

MaRDI QIDQ4038692zbMATH OpenFDO

Authors Manfred Droste

Publication date 18 May 1993

zbMATH Keywords

labeled transition systemsScott-domainsconcurrent automataconcurrency domainsoperational model of concurrent systems

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

(14)

• Connections between a concrete and an abstract model of concurrent systems
• Four domains for concurrency
• Languages and logical definability in concurrency monoids
• Defining conditional independence using collapses
• Labelled domains and automata with concurrency
• Representation of computations in concurrent automata by dependence orders
• Stable trace automata vs. full trace automata
• Automata for true concurrency properties
• Observational trees as models for concurrency
• From domains to automata with concurrency
• A kleene theorem for recognizable languages over concurrency monoids
• CONCURRENT AUTOMATA AND DOMAINS
• Semantics of Deterministic Shared-Memory Systems
• 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)