Equational reasoning about nondeterministic processes
From MaRDI portal
Publication:911801
DOI10.1007/BF01888222zbMath0697.68088OpenAlexW1981514325MaRDI QIDQ911801
Publication date: 1990
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01888222
Related Items (4)
A compositional dataflow semantics for Petri nets ⋮ On nets, algebras and modularity ⋮ Dataflow semantics for Petri nets ⋮ Connectedness and synchronization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semantics of finite and infinite networks of concurrent communicating agents
- The expressive power of indeterminate dataflow primitives
- A fully abstract trace model for dataflow and asynchronous networks
- A proof of the Kahn principle for input/output automata
- Countable nondeterminism and random assignment
- A fixpoint semantics for nondeterministic data flow
- Proofs of Networks of Processes
- A Powerdomain Construction
This page was built for publication: Equational reasoning about nondeterministic processes