Efficiency of Token-Passing MUTEX-Solutions — Some Experiments

DOI10.1007/3-540-69108-1_11MaRDI QIDQ6487392zbMATH OpenFDO

Authors Elmar Bihler, Walter Vogler

Publication date 9 December 2022

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
• Efficiency of asynchronous systems and read arcs in petri nets
• scientific article; zbMATH DE number 1696468
• Faster asynchronous systems.
• scientific article; zbMATH DE number 7317251

Cites work

• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 4082934 (Why is no real title available?)
• scientific article; zbMATH DE number 47952 (Why is no real title available?)
• scientific article; zbMATH DE number 2102738 (Why is no real title available?)
• Contextual nets
• Efficiency of asynchronous systems and read arcs in petri nets
• Forward and backward simulations. I. Untimed Systems
• Mutex needs fairness
• Semantics of inhibitor nets
• Testing equivalences for processes
• Timed testing of concurrent systems

Cited in

(5)

• Performance of pipelined asynchronous systems
• Bisimulation on speed: Worst-case efficiency
• Measuring the performance of asynchronous systems with PAFAS
• Faster asynchronous systems.
• Efficiency of asynchronous systems, read arcs, and the MUTEX-problem

This page was built for publication: Efficiency of Token-Passing MUTEX-Solutions — Some Experiments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487392)