Fast asynchronous systems in dense time

DOI10.1016/S0304-3975(99)00304-7MaRDI QIDQ5940928zbMATH OpenWikidataFDO

Authors L. Jenner, Walter Vogler

Publication date 20 August 2001

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(99)00304-7

zbMATH Keywords

asynchronous systemsdiscretizationefficiencyPetri netstesting

Mathematics Subject Classification ID

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

Review text

A testing scenario in the sense of De Nicola and Hennessy is developed to measure the worst-case efficiency of asynchronous systems using dense time. For all three variants considered, it is shown that one can equivalently use discrete time; in the discrete versions, one variant coincides with an approach based on discrete time in \textit{W. Vogler} [CONCUR95, Lect. Notes Comput. Sci. 962, 299-312 (1995)], and thus we can clarify the assumptions behind this approach. The resulting testing-preorders are characterized with some kind of refusal traces and shown to satisfy some properties that make them attractive as faster-than relations. The three testing preorders are incomparable in general, but for some interesting classes of systems implications are shown.

Recommendations

• scientific article; zbMATH DE number 2102738
• Faster asynchronous systems.
• Comparing the worst-case efficiency of asynchronous systems with PAFAS
• Formal Methods for the Design of Real-Time Systems
• scientific article; zbMATH DE number 1696468

Cites work

• A process algebra for timed systems
• A theory of timed automata
• An efficiency preorder for processes
• Efficiency of asynchronous systems and read arcs in petri nets
• Forward and backward simulations. I. Untimed Systems
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 3885321 (Why is no real title available?)
• scientific article; zbMATH DE number 4209631 (Why is no real title available?)
• scientific article; zbMATH DE number 3722109 (Why is no real title available?)
• scientific article; zbMATH DE number 2102738 (Why is no real title available?)
• Modular construction and partial order semantics of Petri nets
• On describing the behavior and implementation of distributed systems
• Performance preorder and competitive equivalence
• Refusal testing
• Testing equivalences for processes
• Timed testing of concurrent systems

Cited in

(13)

• Faster asynchronous systems.
• Comparing the worst-case efficiency of asynchronous systems with PAFAS
• Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
• Measuring the performance of asynchronous systems with PAFAS
• Fairness of actions in system computations
• Bisimulation on speed: a unified approach
• Asynchronous traces and open Petri nets
• scientific article; zbMATH DE number 1863169 (Why is no real title available?)
• scientific article; zbMATH DE number 2102738 (Why is no real title available?)
• Bisimulation on speed: Lower time bounds
• Formal Modeling and Analysis of Timed Systems
• Bisimulation on speed: Worst-case efficiency
• Performance of pipelined asynchronous systems

This page was built for publication: Fast asynchronous systems in dense time

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