Abstract
In this paper, we propose the notion of partial time abstraction for timed process algebras, which introduces the possibility to abstract away parts of the timing of system behaviour. Adding this notion leads to so-called partially timed process algebras and partially timed labelled transition systems. We describe these notions, and generalise timed branching bisimilarity to partially timed branching bisimilarity, allowing the comparison of systems with partial timing. Finally, with several examples and a case study, we demonstrate how partial time abstraction can be a useful modelling technique for timed models, which can lead to rigorous minimisations of state spaces.
Chapter PDF
References
Alur, R., Dill, D.: Automata for Modeling Real-Time Systems. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 322–335. Springer, Heidelberg (1990)
Alur, R., Dill, D.: A Theory of Timed Automata. Theoretical Computer Science 126(2), 183–235 (1994)
Baeten, J.C.M., Bergstra, J.A.: Real time process algebra. Formal Aspects of Computing 3(2), 142–188 (1991)
Baeten, J.C.M., Middelburg, C.A., Reniers, M.: A New Equivalence for Processes with Timing – With an Application to Protocol Verification. CSR 02-10, Eindhoven University of Technology (2002)
Bergstra, J.A., Klop, J.W.: Algebra of Communicating Processes with Abstraction. Theoretical Computer Science 37(1), 77–121 (1985)
Berthomieu, B., Diaz, M.: Modeling and Verification of Time Dependent Systems Using Time Petri Nets. IEEE Trans. on Softw. Engin. 17(3), 259–273 (1991)
Blom, S.C.C., Fokkink, W.J., Groote, J.F., van Langevelde, I., Lisser, B., van de Pol, J.C.: μCRL: A Toolset for Analysing Algebraic Specifications. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 250–254. Springer, Heidelberg (2001)
Blom, S.C.C., van de Pol, J.C., Weber, M.: Bridging the Gap between Enumerative and Symbolic Model Checkers. CTIT Technical Report TR-CTIT-09-30, University of Twente (2009)
Chkliaev, D., Hooman, J., de Vink, E.: Verification and Improvement of the Sliding Window Protocol. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 113–127. Springer, Heidelberg (2003)
Fokkink, W.J., Pang, J., Wijs, A.J.: Is Timed Branching Bisimilarity a Congruence Indeed? Fundamenta Informaticae 87(3/4), 287–311 (2008)
van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. Journal of the ACM 43(3), 555–600 (1996)
Larsen, K., Wang, Y.: Time-abstracted bisimulation: Implicit specifications and decidability. Information and Computation 134(2), 75–101 (1997)
Luttik, S.P.: Choice Quantification in Process Algebra. PhD thesis, University of Amsterdam (2002)
Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
Reniers, M.A., Groote, J.F., van der Zwaag, M.B., van Wamel, J.: Completeness of Timed μCRL. Fundamenta Informaticae 50(3-4), 361–402 (2002)
Reniers, M.A., van Weerdenburg, M.: Action Abstraction in Timed Process Algebra: The Case for an Untimed Silent Step. In: Arbab, F., Sirjani, M. (eds.) FSEN 2007. LNCS, vol. 4767, pp. 287–301. Springer, Heidelberg (2007)
Tripakis, S., Yovine, S.: Analysis of Timed Systems using Time-Abstracting Bisimulations. Formal Methods in System Design 18(1), 25–68 (2001)
Wijs, A.J.: Forgetting the Time in Timed Process Algebra - Appendix (2010), http://www.win.tue.nl/~awijs/timeabstraction/timeabs.html
van der Zwaag, M.B.: The cones and foci proof technique for timed transition systems. Information Processing Letters 80(1), 33–40 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wijs, A. (2010). Forgetting the Time in Timed Process Algebra. In: Hatcliff, J., Zucca, E. (eds) Formal Techniques for Distributed Systems. FMOODS FORTE 2010 2010. Lecture Notes in Computer Science, vol 6117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13464-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-13464-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13463-0
Online ISBN: 978-3-642-13464-7
eBook Packages: Computer ScienceComputer Science (R0)