Invariance and non-determinacy
Proc. of a discussion meeting of the Royal Society of London on Mathematical logic and programming languages
Algorithms for mutual exclusion
Algorithms for mutual exclusion
Information and Computation
Timed testing of concurrent systems
Information and Computation
Forward and backward simulations I.: untimed systems
Information and Computation
Information Processing Letters
Distributed Algorithms
Fast Asynchronous Systems in Dense Time
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Efficiency of Asynchronous Systems and Read Arcs in Petri Nets
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
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
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
A Faster-than Relation for Asynchronous Processes
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Partial S-Invariants for the Verification of Infinite Systems Families
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Performance of pipelined asynchronous systems
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
A formerly developed approach for comparing the efficiency of asynchronous systems is applied to some token-passing systems (one of them presumably new) that solve the MUTEX-problem. While the original approach compares systems, we also quantify the efficiency by a number and used our tool FastAsy to assess the effects the number of users and the delay in their communication links have. Finally, some new results allowed us to prove correctness of the solutions with FastAsy.