More than a decade ago, Moller and Tofts published their seminal work on relating processes, which are annotated with lower time bounds, with respect to speed. Their paper has left open many questions regarding the semantic theory for the suggested bisimulation-based faster-than preorder, the MT-preorder, which have not been addressed since. The encountered difficulties concern a general compositionality result, a complete axiom system for finite processes, a convincing intuitive justification of the MT-preorder, and the abstraction from internal computation. This article solves these difficulties by developing and employing a novel commutation lemma relating the sequencing of action and clock transitions in discrete-time process algebra. Most importantly, it is proved that the MT-preorder is fully-abstract with respect to a natural amortized preorder that uses a simple bookkeeping mechanism for deciding whether one process is faster than another. Together these results reveal the intuitive roots of the MT-preorder as a faster-than relation, while testifying to its semantic elegance. This lifts some of the barriers that have so far hampered progress in semantic theories for comparing the speed of processes.
Mots-clés : asynchronous systems, timed process algebra, lower time bounds, faster-than relation, Moller-Tofts preorder, bisimulation
@article{ITA_2005__39_3_587_0,
author = {L\"uttgen, Gerald and Vogler, Walter},
title = {Bisimulation on speed : lower time bounds},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {587--618},
publisher = {EDP-Sciences},
volume = {39},
number = {3},
year = {2005},
doi = {10.1051/ita:2005030},
mrnumber = {2157048},
zbl = {1077.68064},
language = {en},
url = {http://archive.numdam.org/articles/10.1051/ita:2005030/}
}
TY - JOUR AU - Lüttgen, Gerald AU - Vogler, Walter TI - Bisimulation on speed : lower time bounds JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 2005 SP - 587 EP - 618 VL - 39 IS - 3 PB - EDP-Sciences UR - http://archive.numdam.org/articles/10.1051/ita:2005030/ DO - 10.1051/ita:2005030 LA - en ID - ITA_2005__39_3_587_0 ER -
%0 Journal Article %A Lüttgen, Gerald %A Vogler, Walter %T Bisimulation on speed : lower time bounds %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 2005 %P 587-618 %V 39 %N 3 %I EDP-Sciences %U http://archive.numdam.org/articles/10.1051/ita:2005030/ %R 10.1051/ita:2005030 %G en %F ITA_2005__39_3_587_0
Lüttgen, Gerald; Vogler, Walter. Bisimulation on speed : lower time bounds. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 39 (2005) no. 3, pp. 587-618. doi : 10.1051/ita:2005030. http://archive.numdam.org/articles/10.1051/ita:2005030/
[1] ,,, and, Characteristic formulae for timed automata. RAIRO-Theor. Inform. Appl. 34 (2000) 565-584. | Numdam | Zbl
[2] and, Timing and causality in process algebra. Acta Inform. 33 (1996) 317-350. | Zbl
[3] and, A theory of timed automata. TCS 126 (1994) 183-235. | Zbl
[4] and, An efficiency preorder for processes. Acta Inform. 29 (1992) 737-760. | Zbl
[5] and, Conformance: A precongruence close to bisimilarity, in STRICT '95, Workshops in Comp., Springer-Verlag (1995) 55-68.
[6] and, On guarded recursion. TCS 82 (1991) 403-408. | Zbl
[7] and, Process algebra with timing: Real time and discrete time, in Bergstra et al. [8], Chap. 10, 627-684. | Zbl
[8] , and, editors, Handbook of Process Algebra. Elsevier Science (2001). | MR | Zbl
[9] , and, An algebraic theory of multiple clocks, in CONCUR '97, Springer-Verlag. Lect. Notes Comput. Sci. 1243 (1997) 166-180.
[10] and, The NCSU Concurrency Workbench, in CAV '96, Springer-Verlag. Lect. Notes Comput. Sci. 1102 (1996) 394-397.
[11] ,, and, Performance preorder and competitive equivalence. Acta Inform. 34 (1997) 805-835. | Zbl
[12] , and, Comparing the worst-case efficiency of asynchronous systems with PAFAS. Acta Inform. 38 (2002) 735-792. | Zbl
[13] and, Testing equivalences for processes. TCS 34 (1984) 83-133. | Zbl
[14] , and, A theory of processes with durational actions. TCS 140 (1995) 73-94. | Zbl
[15] and, A process algebra for timed systems. Inform. Comp. 117 (1995) 221-239. | Zbl
[16] , Communicating Sequential Processes. Prentice Hall (1985). | MR | Zbl
[17] and, Comparing the efficiency of asynchronous systems, in ARTS '99, Springer-Verlag. Lect. Notes Comput. Sci. 1601 (1999) 172-191.
[18] and, Fast asynchronous systems in dense time. TCS 254 (2001) 379-422. | Zbl
[19] and, Bisimulation on speed: Lower time bounds, in FOSSACS 2004, Springer-Verlag. Lect. Notes Comput. Sci. (2004). | MR | Zbl
[20] , Communication and Concurrency. Prentice Hall (1989). | Zbl
[21] and, A temporal calculus of communicating systems, in CONCUR '90, Springer-Verlag. Lect. Notes Comput. Sci. 458 (1990) 401-415.
[22] and, Relating processes with respect to speed, in CONCUR '91, Springer-Verlag. Lect. Notes Comput. Sci. 527 (1991) 424-438.
[23] and, An algebraic theory of process efficiency, in LICS '96, IEEE, Computer Society Press (1996) 63-72.
[24] , An operational semantics for timed CSP. Inform. Comp. 116 (1995) 193-213. | Zbl
[25] , Faster asynchronous systems. Inform. Comput. 184 (2003) 311-342. | Zbl
Cité par Sources :
