A faster-than relation for asynchronous processes

DOI10.1007/3-540-44685-0_18MaRDI QIDQ4791840zbMATH OpenFDO

Authors Gerald Lüttgen, Walter Vogler

Publication date 3 February 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2154/21540262.htm

Mathematics Subject Classification ID

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

Recommendations

• Fast asynchronous systems in dense time
• scientific article; zbMATH DE number 2102738
• Efficient synchronization of asynchronous processes
• Performing work with asynchronous processors, message-delay-sensitive bounds
• Performing work with asynchronous processors: Message-delay-sensitive bounds
• Faster asynchronous systems.
• A simple characterization of asynchronous computations
• On asynchronous iterations
• Fast Multicomputation with Asynchronous Strategy
• A hierarchy of equivalences for asynchronous calculi

Cited in

(5)

• Measuring the performance of asynchronous systems with PAFAS
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• Performance preorder: ordering processes with respect to speed
• Bisimulation on speed: Worst-case efficiency
• A faster-than relation for semi-Markov decision processes

This page was built for publication: A faster-than relation for asynchronous processes

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