论文信息 - Efficiency of Asynchronous Systems and Read Arcs in Petri Nets

Efficiency of Asynchronous Systems and Read Arcs in Petri Nets

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 nets with so-called read arcs. The close relation between efficiency-testing and fairness is pointed out, and it is shown that read arcs are necessary for any solution to the MUTEX-problem.

Walter Vogler

[1] Rocco De Nicola,et al. Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[2] Ekkart Kindler,et al. Message passing mutex , 1995, STRICT.

[3] Michel Raynal,et al. Algorithms for mutual exclusion , 1986 .

[4] Walter Vogler,et al. Timed Testing of Concurrent Systems , 1993, Inf. Comput..

[5] Ekkart Kindler,et al. Mutex Needs Fairness , 1997, Inf. Process. Lett..

[6] Walter Vogler. Fairness and Partial Order Semantics , 1995, Inf. Process. Lett..

[7] Walter Vogler,et al. Fast asynchronous systems in dense time , 1996, Theor. Comput. Sci..

[8] Søren Christensen,et al. Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs , 1992, Application and Theory of Petri Nets.

[9] Rocco De Nicola,et al. Testing Equivalence for Processes , 1983, ICALP.

[10] Wolfgang Reisig,et al. Partial Order Semantics versus Interleaving Semantics for CSP-like Languages and its Impact on Fairness , 1984, ICALP.