A fully abstract trace model for dataflow and asynchronous networks

DOI10.1007/BF02280834MaRDI QIDQ1333374zbMATH OpenOpenAlexFDO

Authors Bengt Jonsson

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

zbMATH Keywords

asynchronous channelsdataflow networksemantic model

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Recommendations

• Asynchronous traces and open Petri nets
• Publication:4723281
• Trace-oriented models of concurrency
• Data flow analysis of asynchronous systems using infinite abstract domains
• Trace nets and conflict-free computations
• Network algebra for asynchronous dataflow^∗
• Efficient trace encodings of bounded synthesis for asynchronous distributed systems
• scientific article; zbMATH DE number 1759408
• scientific article; zbMATH DE number 1927580

Cites work

• A fixpoint semantics for nondeterministic data flow
• A model and temporal proof system for networks of processes
• A theory for nondeterminism, parallelism, communication, and concurrency
• A Theory of Communicating Sequential Processes
• Computing the behaviour of asynchronous processes
• Defining liveness
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 52331 (Why is no real title available?)
• scientific article; zbMATH DE number 3469994 (Why is no real title available?)
• Nondeterministic data flow programs: How to avoid the merge anomaly
• On the suitability of trace semantics for modular proofs of communicating processes
• Proposition de semantique denotationnelle pour des réseaux de processus avec opérateur de melange équitable
• Specification-oriented semantics for communicating processes
• Testing equivalences for processes

Cited in

(19)

• The expressive power of indeterminate dataflow primitives
• A fully abstract semantics for concurrent constraint programming
• Nonexpressibility of fairness and signaling
• On schematological equivalence of partially interpreted dataflow networks
• Strong fairness and full abstraction for communicating processes
• Infinite trace equivalence
• scientific article; zbMATH DE number 554489 (Why is no real title available?)
• Network algebra for asynchronous dataflow^∗
• scientific article; zbMATH DE number 7020152 (Why is no real title available?)
• scientific article; zbMATH DE number 3997145 (Why is no real title available?)
• scientific article; zbMATH DE number 915918 (Why is no real title available?)
• On nets, algebras and modularity
• Towards a complete hierarchy of compositional dataflow models
• Feedback in synchronous relational interfaces
• A generalized Kahn Principle for abstract asynchronous networks
• Quantitative analysis of interval Markov chains
• Specification and verification of concurrent systems by causality and realizability
• Nondeterministic asynchronous dataflow in Isabelle/HOL
• Equational reasoning about nondeterministic processes

This page was built for publication: A fully abstract trace model for dataflow and asynchronous networks

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