Stability and sequentiality in dataflow networks
From MaRDI portal
(Redirected from Stability and sequentiality in dataflow networks)
Recommendations
Cited in
(16)- Representation of computations in concurrent automata by dependence orders
- Nonexpressibility of fairness and signaling
- Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin
- Stability, sequentiality and demand driven evaluation in dataflow
- A proof of the Kahn principle for input/output automata
- Asynchronous games. II: The true concurrency of innocence
- Non modularity and expressibility for nets of relations (extended abstract)
- Directed homotopy in non-positively curved spaces
- From sequential specifications to eventual consistency
- scientific article; zbMATH DE number 4060692 (Why is no real title available?)
- scientific article; zbMATH DE number 517054 (Why is no real title available?)
- A compositional model for confluent dynamic data-flow networks
- Turing machines, transition systems, and interaction
- Towards a complete hierarchy of compositional dataflow models
- Languages and logical definability in concurrency monoids
- Turing machines, transition systems, and interaction
This page was built for publication: Stability and sequentiality in dataflow networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4038701)