Bisimulation on speed: a unified approach

  • Two process-algebraic approaches have been developed for comparing two bisimulation-equivalent processes with respect to speed: the one of Moller-Tofts equips actions with lower time bounds, while the other by Lüttgen-Vogler considers upper time bounds instead. This paper sheds new light onto both approaches by testifying to their close relationship and brings the research into bisimulation-based faster-than preorders to a close. We introduce a general, very intuitive concept of "faster-than", which is formalised by a notion of amortised faster-than preorder. When closing this preorder under all contexts, exactly the two faster-than preorders investigated by Moller/Tofts and Lüttgen/Vogler arise. For processes incorporating both lower and upper time bounds we also show that the largest precongruence contained in the amortised faster-than preorder is not a proper preorder but a timed bisimulation. In the light of this result we systematically investigate under which circumstances theTwo process-algebraic approaches have been developed for comparing two bisimulation-equivalent processes with respect to speed: the one of Moller-Tofts equips actions with lower time bounds, while the other by Lüttgen-Vogler considers upper time bounds instead. This paper sheds new light onto both approaches by testifying to their close relationship and brings the research into bisimulation-based faster-than preorders to a close. We introduce a general, very intuitive concept of "faster-than", which is formalised by a notion of amortised faster-than preorder. When closing this preorder under all contexts, exactly the two faster-than preorders investigated by Moller/Tofts and Lüttgen/Vogler arise. For processes incorporating both lower and upper time bounds we also show that the largest precongruence contained in the amortised faster-than preorder is not a proper preorder but a timed bisimulation. In the light of this result we systematically investigate under which circumstances the amortised faster-than preorder degrades to an equivalence.show moreshow less

Download full text files

Export metadata

Statistics

Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Gerald LüttgenGND, Walter VoglerGND
URN:urn:nbn:de:bvb:384-opus4-1316
Frontdoor URLhttps://opus.bibliothek.uni-augsburg.de/opus4/180
Series (Serial Number):Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (2004-15)
Type:Report
Language:English
Year of first Publication:2004
Publishing Institution:Universität Augsburg
Release Date:2006/06/07
Tag:asynchronous systems; timed process algebra; time bounds; faster than relation; amortised faster than preorder; bisimulation
GND-Keyword:Bisimulation
Institutes:Fakultät für Angewandte Informatik
Fakultät für Angewandte Informatik / Institut für Informatik
Fakultät für Angewandte Informatik / Institut für Informatik / Lehrstuhl für Softwaretechnik
Fakultät für Angewandte Informatik / Institut für Informatik / Lehrstuhl für Softwaretechnik / Professur für Theorie verteilter Systeme
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik