Pages that link to "Item:Q911263"
From MaRDI portal
The following pages link to Automated analysis of mutual exclusion algorithms using CCS (Q911263):
Displaying 14 items.
- Trapping mutual exclusion in the box calculus (Q672869) (← links)
- Symbolic bisimulations (Q674194) (← links)
- Liveness of a mutex algorithm in a fair process algebra (Q1015393) (← links)
- A note on model checking the modal \(\nu\)-calculus (Q1176250) (← links)
- Local model checking in the modal mu-calculus (Q1177939) (← links)
- Deciding bisimilarity is P-complete (Q1203120) (← links)
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus (Q1325848) (← links)
- Efficiency of asynchronous systems, read arcs, and the MUTEX-problem (Q1607225) (← links)
- Proof systems for message-passing process algebras (Q1815341) (← links)
- CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions (Q2340255) (← links)
- ACTLW -- an action-based computation tree logic with unless operator (Q2476788) (← links)
- Time and Fairness in a Process Algebra with Non-blocking Reading (Q3599073) (← links)
- (Q5014797) (← links)
- Modelling mutual exclusion in a process algebra with time-outs (Q6053409) (← links)
