From domains to automata with concurrency

DOI10.1007/3-540-56939-1_111zbMath1418.68134OpenAlexW1549720865MaRDI QIDQ4630301

Felipe Bracho, Manfred Droste

Publication date: 29 March 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56939-1_111

zbMATH Keywords

transition systemlambda-calculustrace theorylabeled transition systemcomputation sequence

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categories of machines, automata (18B20)

Related Items

Labelled domains and 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

Cites Work

• Models for concurrency: Towards a classification
• Theory of traces
• Concurrent transition systems
• A calculus of communicating systems
• Labelled domains and automata with concurrency
• Concurrent Machines
• CONCURRENT AUTOMATA AND DOMAINS
• Communicating sequential processes
• Minimal and Optimal Computations of Recursive Programs
• 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