Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
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. (C) 2002 Elsevier Science B.V. All rights reserved.
testing fairness concurrent system performance mutual exclusion