Labelled domains and automata with concurrency

DOI10.1016/0304-3975(94)00030-1zbMath0829.68087OpenAlexW2075557235MaRDI QIDQ1346626

Felipe Bracho, Manfred Droste

Publication date: 6 April 1995

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00030-1

zbMATH Keywords

concurrent systemsautomata with concurrency relations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Labelled domains and automata with concurrency, Topology for Computations of Concurrent Automata, From domains to automata with concurrency, A kleene theorem for recognizable languages over concurrency monoids, Recognizable languages in concurrency monoids, Representation of computations in concurrent automata by dependence orders, Stable trace automata vs. full trace automata, RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA

Cites Work

• Concurrent transition systems
• A calculus of communicating systems
• Combinatorics on traces
• Labelled domains and automata with concurrency
• Concurrent Machines
• CONCURRENT AUTOMATA AND DOMAINS
• Communicating sequential processes
• Minimal and Optimal Computations of Recursive Programs
• From domains to automata with concurrency
• Compositional relational semantics for indeterminate dataflow networks
• Connections between a concrete and an abstract model of concurrent systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item