Algorithms for mutual exclusion
Algorithms for mutual exclusion
Weak and strong fairness in CCS
Information and Computation
Communication and concurrency
Automated analysis of mutual exclusion algorithms using CCS
Formal Aspects of Computing
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
Theoretical Computer Science
Contextual Occurence Nets and Concurrent Constraint Programming
Proceedings of the International Workshop on Graph Transformations in Computer Science
Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Measuring the performance of asynchronous systems with PAFAS
Theoretical Computer Science - Process algebra
Timed petri nets and timed automata: on the discriminating power of zeno sequences
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Checking a mutex algorithm in a process algebra with fairness
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
| Hi-index | 0.00 |
We introduce the first process algebra with non-blocking reading actions for modelling concurrent asynchronous systems. We study the impact this new kind of actions has on fairness, liveness and the timing of systems, using as application Dekker's mutual exclusion algorithm we already considered in [4]. Regarding some actions as reading, this algorithm satisfies MUTEX liveness already under the assumption of fairness of actions. We demonstrate an interesting correspondence between liveness and the catastrophic cycles that we introduced in [6] when studying the performance of pipelining. Finally, our previous result on the correspondence between timing and fairness [4] scales up to the extended language.