Compositional relational semantics for indeterminate dataflow networks

DOI10.1007/BFb0018344zbMath1493.68199OpenAlexW2099361053MaRDI QIDQ5096251

Eugene W. Stark

Publication date: 16 August 2022

Published in: Category Theory and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0018344

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) Categories of machines, automata (18B20)

Related Items

Connections between a concrete and an abstract model of concurrent systems ⋮ Labelled domains and automata with concurrency ⋮ 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 ⋮ Context-free event domains are recognizable ⋮ Context-free event domains are recognizable

Cites Work

• Nondeterministic data flow programs: How to avoid the merge anomaly
• Theory of traces
• Concurrent transition systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item