Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
From MaRDI portal
Publication:1607225
DOI10.1016/S0304-3975(01)00300-0zbMath1026.68099MaRDI QIDQ1607225
Publication date: 31 July 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (12)
Bisimulation on speed: Worst-case efficiency ⋮ Modelling mutual exclusion in a process algebra with time-outs ⋮ Just testing ⋮ Unnamed Item ⋮ Timed Petri nets and timed automata: On the discriminating power of Zeno sequences ⋮ Ensuring liveness properties of distributed systems: open problems ⋮ Fairness of components in system computations ⋮ Time and Fairness in a Process Algebra with Non-blocking Reading ⋮ Fairness of actions in system computations ⋮ Bisimulation on speed: a unified approach ⋮ Liveness of a mutex algorithm in a fair process algebra ⋮ CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mutex needs fairness
- Modular construction and partial order semantics of Petri nets
- Refusal testing
- Fairness and partial order semantics
- Automated analysis of mutual exclusion algorithms using CCS
- A theory of timed automata
- An efficiency preorder for processes
- Testing equivalences for processes
- A process algebra for timed systems
- Timed testing of concurrent systems
- Forward and backward simulations. I. Untimed Systems
- Contextual nets
- Semantics of inhibitor nets
- Invariance and non-determinacy
- Performance preorder: Ordering processes with respect to speed
- Non sequential semantics for contextual P/T nets
- The mutual exclusion problem
- Fast asynchronous systems in dense time
This page was built for publication: Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
