Abstract
We introduce a quantitative concept for bisimulations by integrating the notion of amortisation (cf. [3]). This allows us to make behavioural comparisons between nondeterministic systems that are inherently non-terminating and to analyse the relative long-term costs of deploying them. To this end, we conservatively extend CCS to include a new set of cost-based actions and define a cost-based quantitative relation called amortised bisimulation. We demonstrate the applicability of our approach by two case studies. In both cases the cost of additional administration is shown to amortise. We furthermore show that the amortised preorder for speed introduced in [6] is naturally expressible in our setting.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Arun-Kumar, S., Hennessy, M.: An efficiency preorder for processes. Acta Informatica 1(29), 737–760 (1992)
Cleaveland, R., Parrow, J., Steffen, B.: A semantics based verification tool for finite state systems. In: Proceedings of the 9th International Symposium on Protocol Specification, Testing and Verification, North Holland (1989)
Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. Prentice-Hall, India (2004)
Hennessy, M., Regan, T.: A process algebra for timed systems. Information and Computation 117(2), 221–239 (1995)
Lin, H.: A process algebra manipulator. Formal Methods in Systems Design 7, 243–259 (1995)
Lüttgen, G., Vogler, W.: Bisimulation on speed: A unified approach. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 79–94. Springer, Heidelberg (2005)
Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)
Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
Satya Kiran, M.N.V., Jayram, N.M., Rao, P., Nandy, S.K.: A complexity effective communication model for behavioral modeling of signal processing applications. In: Proceedings of DAC 2003 (2003)
Moller, F., Tofts, C.: Relating processes with respect to speed. In: Groote, J.F., Baeten, J.C.M. (eds.) CONCUR 1991. LNCS, vol. 527, pp. 424–438. Springer, Heidelberg (1991)
Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104. Springer, Heidelberg (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 IFIP International Federation for Information Processing
About this paper
Cite this paper
Kiehn, A., Arun-Kumar, S. (2005). Amortised Bisimulations. In: Wang, F. (eds) Formal Techniques for Networked and Distributed Systems - FORTE 2005. FORTE 2005. Lecture Notes in Computer Science, vol 3731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562436_24
Download citation
DOI: https://doi.org/10.1007/11562436_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29189-3
Online ISBN: 978-3-540-32084-5
eBook Packages: Computer ScienceComputer Science (R0)