scientific article; zbMATH DE number 3963175
From MaRDI portal
Publication:3731015
Recommendations
Cited in
(19)- Sémantique asynchrone et comportements infinis en CPS
- Appraising fairness in languages for distributed programming
- Sequential and concurrent behaviour in Petri net theory
- Verification of distributed programs using representative interleaving sequences
- On equivalence-completions of fairness assumptions
- The connection between an event structure semantics and an operational semantics for TCSP
- Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
- Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP
- On fairness notions in distributed systems. II: Equivalence-completions and their hierarchies
- Observable liveness of Petri nets
- Interleaving set temporal logic
- Undecidability of partial order logics
- scientific article; zbMATH DE number 4092736 (Why is no real title available?)
- Efficiency of asynchronous systems and read arcs in petri nets
- The semantics of priority and fairness in occam
- Adding partial orders to linear temporal logic
- Fairness and partial order semantics
- Event fairness and non-interleaving concurrency
- Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3731015)