Efficiency of Token-Passing MUTEX-Solutions — Some Experiments

DOI10.1007/3-540-69108-1_11zbMATH Open1510.68052MaRDI QIDQ6487392FDOQ6487392

Authors: Elmar Bihler, Walter Vogler 

Publication date: 9 December 2022

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

Mathematics Subject Classification ID

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

Cites Work

• Forward and backward simulations. I. Untimed Systems
• Title not available (Why is that?)
• Testing equivalences for processes
• Mutex needs fairness
• Efficiency of asynchronous systems and read arcs in petri nets
• Title not available (Why is that?)
• Semantics of inhibitor nets
• Contextual nets
• Timed testing of concurrent systems
• Title not available (Why is that?)
• Title not available (Why is that?)

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)