Faster asynchronous systems.
type: Item
instance of: scholarly article
title: Faster asynchronous systems.
zbMATH Open document ID: 1054.68097
DOI: 10.1016/S0890-5401(03)00065-8
author: Walter Vogler
published in: Information and Computation
publication date: 2003-08-19T00:00:00Z
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 1967138
zbMATH Keywords: Asynchronous systems
zbMATH Keywords: Testing theory
zbMATH Keywords: Worst-case performance
zbMATH Keywords: Petri nets
MaRDI profile type: Publication
cites work: An efficiency preorder for processes
cites work: Performance preorder and competitive equivalence
cites work: Comparing the worst-case efficiency of asynchronous systems with PAFAS
cites work: Extensional equivalences for transition systems
cites work: Testing equivalences for processes
cites work: A brief history of Timed CSP
cites work: A process algebra for timed systems
cites work: Fast asynchronous systems in dense time
cites work: On describing the behavior and implementation of distributed systems
cites work: Forward and backward simulations. I. Untimed Systems
cites work: Q3126969
cites work: Recoverability of Communication Protocols--Implications of a Theoretical Study
cites work: Q3911403
cites work: Q4431372
cites work: Q3787461
cites work: Modular construction and partial order semantics of Petri nets
cites work: Timed testing of concurrent systems
cites work: Efficiency of Token-Passing MUTEX-Solutions — Some Experiments
description: scientific article; zbMATH DE number 1967138