Abstract
The aim in the paper is to investigate four implementable formats of rules in the setting of Transition System Specifications (TSS) and in the presence of silent actions and divergence. For each of the formats the coarsest equivalence is proposed such that it refines trace equivalence and it is a congruence for the format.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Abramsky. Observation equivalence as a testing equivalence. Theoretical Computer Science, 53, 1987.
B. Bloom. Strong process equivalence in the presence of hidden moves. Preliminary report, MIT, 1990.
B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can’t be traced: preliminary report. In Conference Record of the 15th ACM Symposium on Principles of Programming Languages, San Diego, California, 1988.
B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can’t be traced. Technical report, MIT, 1992.
R.N. Bol and J.F. Groote. The meaning of negative premises in transition system specifications. Technical Report CS-9054, CWI, 1990.
R. de Simone. Higher-level synchronising devices in MEIJE-SCCS. Theoretical Computer Science, 37, 1985.
J.F. Groote. Transition system specifications with negative premises. Technical Report CS-8950, CWI, 1989. An extended abstract appeared in J.C.M. Baeten and J.W. Klop, editors, Proceedings of Concur90, Amsterdam, LNCS 458, pages 332–341. Springer-Verlag, 1990.
J.F. Groote and F. Vaandrager. Structured operational semantics and bisimulation as a congruence. Technical Report CS-8845, CWI, 1988. An extended abstract appeared in G. Ausiello and M. Dezani-Ciancaglini, and S. Ronchi Della Rocca, editors, Proceedings ICALP, 89, Stresa, LNCS 372, pages 423–438. Springer-Verlag, 1989.
C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall International, 1985.
R. Milner. Communication and Concurrency. Prentice Hall International, 1989.
R. De Nicola and M. Hennessy. CCS without T’s. In H. Ehrig, R. Kowalski, G. Levi, and U. Montanari, editors, TAPSOFT ‘87, Berlin, 1987. Springer-Verlag. LNCS 250.
I. Phillips. Copy testing. Unpublished manuscript, 1985.
I. Phillips. Refusal testing. Theoretical Computer Science, 50, 1987.
I. Phillips. CCS with broadcast stability. Technical report, Imperial College, 1988.
I. Ulidowski. Local Testing and Implementable Concurrent Processes Forthcoming PhD thesis, Imperial College, University of London.
I. Ulidowski. Equivalences on observable processes. In Proceedings of 7th Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, California, 1992.
F.W. Vaandrager. On the relationship between process algebra and input/output automata. In Proceedings of 6th Annual IEEE Symposium on Logic in Computer Science, Amsterdam,The Netherlands, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 British Computer Society
About this paper
Cite this paper
Ulidowski, I. (1993). Congruences for τ-respecting Formats of Rules. In: Burn, G., Gay, S., Ryan, M. (eds) Theory and Formal Methods 1993. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3503-6_25
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3503-6_25
Publisher Name: Springer, London
Print ISBN: 978-3-540-19842-0
Online ISBN: 978-1-4471-3503-6
eBook Packages: Springer Book Archive