Abstract
This paper characterises the coarsest refinement preorders on labelled transition systems that are precongruences for renaming and partially synchronous interleaving operators, and respect all safety, liveness, and conditional liveness properties, respectively.
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
Alexander, M., Gardner, W. (eds.): Process Algebra for Parallel and Distributed Processing. Chapman & Hall, Boca Raton (2008)
Baeten, J.C.M., Bergstra, J.A.: Global renaming operators in concrete process algebra. Information and Computation 78(3), 205–245 (1988)
Bergstra, J.A., Klop, J.W.: Algebra of communicating processes with abstraction. Theoretical Computer Science 37(1), 77–121 (1985)
Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. Journal of the ACM 31(3), 560–599 (1984)
De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoretical Computer Science 34, 83–133 (1984)
van Glabbeek, R.J., Voorhoeve, M.: Liveness, Fairness and Impossible Futures. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 126–141. Springer, Heidelberg (2006)
van Glabbeek, R.J.: The Linear Time – Branching Time Spectrum I; The Semantics of Concrete, Sequential Processes. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, ch.1, pp. 3–99. Elsevier, Amsterdam (2001)
Kaivola, R., Valmari, A.: The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear Temporal Logic. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 207–221. Springer, Heidelberg (1992), http://dx.doi.org/10.1007/BFb0084793
Lamport, L.: Proving the correctness of multiprocess programs. IEEE Transactions on Software Engineering 3(2), 125–143 (1977)
Lamport, L.: Proving Possibility Properties. Theoretical Computer Science 206(1-2), 341–352 (1998), http://research.microsoft.com/en-us/um/people/lamport/pubs/pubs.html#lamport-possibility
Levy, P.B.: Infinite trace equivalence. Annals of Pure and Applied Logic 151(2-3), 170–198 (2008), http://dx.doi.org/10.1016/j.apal.2007.10.007
Milner, R.: Operational and algebraic semantics of concurrent processes. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch.19, pp. 1201–1242. Elsevier Science Publishers B.V, North-Holland (1990); Alternatively see Communication and Concurrency. Prentice-Hall, Englewood Cliffs, (1989), an earlier version appeared as A Calculus of Communicating systems. LNCS, vol. 92. Springer, Heidelberg (1980)
Puhakka, A.: Weakest Congruence Results Concerning “Any-Lock”. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol. 2215, pp. 400–419. Springer, Heidelberg (2001)
Roscoe, A.W.: Seeing Beyond Divergence. In: Abdallah, A.E., Jones, C.B., Sanders, J.W. (eds.) Communicating Sequential Processes. LNCS, vol. 3525, pp. 15–35. Springer, Heidelberg (2005)
Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1997), http://www.comlab.ox.ac.uk/bill.roscoe/publications/68b.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 IFIP
About this paper
Cite this paper
van Glabbeek, R.J. (2010). The Coarsest Precongruences Respecting Safety and Liveness Properties. In: Calude, C.S., Sassone, V. (eds) Theoretical Computer Science. TCS 2010. IFIP Advances in Information and Communication Technology, vol 323. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15240-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-15240-5_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15239-9
Online ISBN: 978-3-642-15240-5
eBook Packages: Computer ScienceComputer Science (R0)