Compositional relational semantics for indeterminate dataflow networks

DOI10.1007/BFB0018344MaRDI QIDQ5096251zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1305006
• A relational model of non-deterministic dataflow
• scientific article; zbMATH DE number 1305005
• scientific article; zbMATH DE number 3901997
• scientific article; zbMATH DE number 742725

Cites work

• scientific article; zbMATH DE number 4030996 (Why is no real title available?)
• scientific article; zbMATH DE number 4048997 (Why is no real title available?)
• scientific article; zbMATH DE number 4060692 (Why is no real title available?)
• scientific article; zbMATH DE number 3681970 (Why is no real title available?)
• scientific article; zbMATH DE number 3759516 (Why is no real title available?)
• scientific article; zbMATH DE number 3469994 (Why is no real title available?)
• scientific article; zbMATH DE number 3566181 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• Concurrent transition systems
• Nondeterministic data flow programs: How to avoid the merge anomaly
• Theory of traces

Cited in

(18)

• Connections between a concrete and an abstract model of concurrent systems
• scientific article; zbMATH DE number 1305005 (Why is no real title available?)
• scientific article; zbMATH DE number 3901997 (Why is no real title available?)
• scientific article; zbMATH DE number 177822 (Why is no real title available?)
• Languages and logical definability in concurrency monoids
• Labelled domains and automata with concurrency
• Representation of computations in concurrent automata by dependence orders
• Context-free event domains are recognizable
• Context-free event domains are recognizable
• scientific article; zbMATH DE number 1759408 (Why is no real title available?)
• Semantics of multiway dataflow constraint systems
• scientific article; zbMATH DE number 1543343 (Why is no real title available?)
• A relational model of non-deterministic dataflow
• From domains to automata with concurrency
• A kleene theorem for recognizable languages over concurrency monoids
• Event structure spans for nondeterministic dataflow
• Compositional semantics of dataflow networks with query-driven communication of exact values
• Recognizable languages in concurrency monoids

This page was built for publication: Compositional relational semantics for indeterminate dataflow networks

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