Abstract
In his PhD thesis of 1985 Rocco De Nicola showed how the must testing pre-order over the process calculus CCS can be captured using a set of in-equations and an infinitary proof rule. We show how, at least for regular processes, this infinitary rule is unnecessary. We present a standard proof system, which uses a simple co-inductive rule, which is both sound and complete for regular processes.
This work was supported with the financial support of the Science Foundation Ireland grant 13/RC/2094, funding Lero – the Irish Software Research Centre.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
and some variations.
- 2.
Because of space considerations we omit the formal definition.
- 3.
For soundness the variable x in body t should be guarded.
- 4.
A maximal sequence may be finite or infinite.
- 5.
Technically here we need to work up to the idempotency of both binary operators
and 
.
and 
.References
Brandt, M., Henglein, F.: Coinductive axiomatization of recursive type equality and subtyping. Fundam. Inform. 33(4), 309–338 (1998)
De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theor. Comput. Sci. 34, 83–133 (1984)
De Nicola, R., Hennessy, M.: CCS without \(\uptau \)’s. In: Ehrig, H., Kowalski, R., Levi, G., Montanari, U. (eds.) CAAP 1987. LNCS, vol. 249, pp. 138–152. Springer, Heidelberg (1987). https://doi.org/10.1007/3-540-17660-8_53
De Nicola, R.: Testing equivalences and fully abstract models for communicating processes. Ph.D. thesis, University of Edinburgh (1985)
Hennessy, M.: Algebraic Theory of Processes. MIT Press, Cambridge (1988)
Hennessy, M.: A coinductive equational characterisation of trace inclusion for regular processes. In: Aceto, L., Bacci, G., Bacci, G., Ingólfsdóttir, A., Legay, A., Mardare, R. (eds.) Models, Algorithms, Logics and Tools. LNCS, vol. 10460, pp. 449–465. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-63121-9_22
Hoare, C.A.R.: Communicating sequential processes. Commun. ACM 26(1), 100–106 (1983). (reprint)
Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall Inc., Upper Saddle River (1985)
Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Inf. Comput. 110(2), 366–390 (1994)
Milner, R.: A complete inference system for a class of regular behaviours. J. Comput. Syst. Sci. 28(3), 439–466 (1984)
Rabinovich, A.: A complete axiomatisation for trace congruence of finite state behaviors. In: Brookes, S., Main, M., Melton, A., Mislove, M., Schmidt, D. (eds.) MFPS 1993. LNCS, vol. 802, pp. 530–543. Springer, Heidelberg (1994). https://doi.org/10.1007/3-540-58027-1_25
Salomaa, A.: Two complete axiom systems for the algebra of regular events. J. ACM 13(1), 158–169 (1966)
Acknowledgements
The author would like to thank the referees for their careful reading of the first version of this paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Hennessy, M. (2019). An Equational Characterisation of the Must Testing Pre-order for Regular Processes. In: Boreale, M., Corradini, F., Loreti, M., Pugliese, R. (eds) Models, Languages, and Tools for Concurrent and Distributed Programming. Lecture Notes in Computer Science(), vol 11665. Springer, Cham. https://doi.org/10.1007/978-3-030-21485-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-21485-2_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-21484-5
Online ISBN: 978-3-030-21485-2
eBook Packages: Computer ScienceComputer Science (R0)