Invariance and non-determinacy
Proc. of a discussion meeting of the Royal Society of London on Mathematical logic and programming languages
The mutual exclusion problem: partII—statement and solutions
Journal of the ACM (JACM)
Algorithms for mutual exclusion
Algorithms for mutual exclusion
Fairness
Theoretical Computer Science
Automated analysis of mutual exclusion algorithms using CCS
Formal Aspects of Computing
Handbook of theoretical computer science (vol. B)
An efficiency preorder for processes
Acta Informatica
Theoretical Computer Science
A process algebra for timed systems
Information and Computation
Fairness and partial order semantics
Information Processing Letters
Information and Computation
Timed testing of concurrent systems
Information and Computation
Forward and backward simulations I.: untimed systems
Information and Computation
Information Processing Letters
Fast asynchronous systems in dense time
Theoretical Computer Science
Distributed Algorithms
Modular Construction and Partial Order Semantics of Petri Nets
Modular Construction and Partial Order Semantics of Petri Nets
Performance Preorder: Ordering Processes with Respect to Speed
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Partial Order Semantics and Read Arcs
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Relating Processes With Respect to Speed
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Mobile Processes with Local Clocks
Selected papers from the 5th LOMAPS Workshop on Analysis and Verification of Multiple-Agent Languages
Non Sequential Semantics for Contextual P/T Nets
Proceedings of the 17th International Conference on Application and Theory of Petri Nets
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
An Algebraic Theory of Process Efficiency
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Economical solutions for the critical section problem in a distributed system (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Bisimulation on speed: worst-case efficiency
Information and Computation
Fairness of components in system computations
Theoretical Computer Science - Expressiveness in concurrency
Bisimulation on speed: a unified approach
Theoretical Computer Science
Timed Petri nets and timed automata: On the discriminating power of zeno sequences
Information and Computation
Time and Fairness in a Process Algebra with Non-blocking Reading
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Bisimulation on speed: a unified approach
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 5.23 |
Two solutions to the MUTEX-problem are compared w.r.t. their temporal efficiency. For this, a formerly developed efficiency testing for asynchronous systems is adapted to Petri nets with so-called read arcs. Furthermore, a compositional semantics for fair behaviour (in the sense of the progress assumption) is presented. On the one hand, this semantics is related to efficiency testing. On the other hand, it is used to specify formally what a solution to the MUTEX-problem is. It is shown that one of our solutions indeed satisfies this specification and that ordinary nets without read arcs cannot solve the MUTEX-problem.