Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
type: Item
instance of: scholarly article
title: Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
zbMATH Open document ID: 1026.68099
DOI: 10.1016/S0304-3975(01)00300-0
author: Walter Vogler
published in: Theoretical Computer Science
publication date: 2002-07-31T00:00:00Z
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 1774112
zbMATH Keywords: concurrent system
zbMATH Keywords: testing
zbMATH Keywords: performance
zbMATH Keywords: fairness
zbMATH Keywords: mutual exclusion
MaRDI profile type: Publication
cites work: A theory of timed automata
cites work: An efficiency preorder for processes
cites work: Non sequential semantics for contextual P/T nets
cites work: Performance preorder: Ordering processes with respect to speed
cites work: Testing equivalences for processes
cites work: Invariance and non-determinacy
cites work: Q3738540
cites work: A process algebra for timed systems
cites work: Semantics of inhibitor nets
cites work: Fast asynchronous systems in dense time
cites work: Mutex needs fairness
cites work: The mutual exclusion problem
cites work: Q3126969
cites work: Forward and backward simulations. I. Untimed Systems
cites work: Contextual nets
cites work: Q3911403
cites work: Refusal testing
cites work: Q3357558
cites work: Q3813266
cites work: Q3731015
cites work: Q3219122
cites work: Q4385530
cites work: Modular construction and partial order semantics of Petri nets
cites work: Fairness and partial order semantics
cites work: Timed testing of concurrent systems
cites work: Automated analysis of mutual exclusion algorithms using CCS
description: scientific article; zbMATH DE number 1774112