Abstract
AbstractThis paper introduces the counterpart of strong bisimilarity for labelled transition systems extended with timeout transitions. It supports this concept through a modal characterisation, congruence results for a standard process algebra with recursion, and a complete axiomatisation.
Funder
University of New South Wales
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Information Systems,Software
Reference41 articles.
1. Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: Syntax and defining equations for an interrupt mechanism in process algebra. Fundam. Inform. 9(2), 127–168 (1986). https://doi.org/10.3233/FI-1986-9202
2. Baeten, J.C.M., Weijland, W.P.: Process Algebra. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (1990). https://doi.org/10.1017/CBO9780511624193
3. Bisping, B., Nestmann, U., Peters, K.: Coupled similarity: the first 32 years. Acta Inform. 57(3–5), 439–463 (2020). https://doi.org/10.1007/s00236-019-00356-4
4. Bouwman, M.S.: Liveness analysis in process algebra: simpler techniques to model mutex algorithms. Technical Report, Eindhoven University of Technology (2018). http://www.win.tue.nl/~timw/downloads/bouwman_seminar.pdf
5. Bouwman, M.S., Luttik, B., Willemse, T.A.C.: Off-the-shelf automated analysis of liveness properties for just paths. Acta Inform. 57(3–5), 551–590 (2020). https://doi.org/10.1007/s00236-020-00371-w