A fully abstract trace model for dataflow and asynchronous networks
From MaRDI portal
Publication:1333374
DOI10.1007/BF02280834zbMath0813.68095OpenAlexW2060336880MaRDI QIDQ1333374
Publication date: 13 September 1994
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02280834
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)
Related Items (12)
On schematological equivalence of partially interpreted dataflow networks ⋮ On nets, algebras and modularity ⋮ Quantitative analysis of interval Markov chains ⋮ Specification and verification of concurrent systems by causality and realizability ⋮ Equational reasoning about nondeterministic processes ⋮ Network algebra for asynchronous dataflow∗ ⋮ Infinite trace equivalence ⋮ The expressive power of indeterminate dataflow primitives ⋮ Feedback in Synchronous Relational Interfaces ⋮ A fully abstract semantics for concurrent constraint programming ⋮ Strong fairness and full abstraction for communicating processes ⋮ Nonexpressibility of fairness and signaling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the behaviour of asynchronous processes
- On the suitability of trace semantics for modular proofs of communicating processes
- Specification-oriented semantics for communicating processes
- Defining liveness
- A model and temporal proof system for networks of processes
- A theory for nondeterminism, parallelism, communication, and concurrency
- Nondeterministic data flow programs: How to avoid the merge anomaly
- Proposition de semantique denotationnelle pour des réseaux de processus avec opérateur de melange équitable
- Testing equivalences for processes
- A Theory of Communicating Sequential Processes
- A fixpoint semantics for nondeterministic data flow
This page was built for publication: A fully abstract trace model for dataflow and asynchronous networks
