Abstract
In this paper I characterize a class of infinitary GSOS specifications, obtained by relaxing some of the finiteness constraints of the original format of Bloom, Istrail and Meyer, which generate regular processes. I then show how the techniques of Aceto, Bloom and Vaandrager can be adapted to give a procedure for converting any such language definition to a complete equational axiom system for strong bisimulation of processes which does not use infinitary proof rules. Equalities between recursive, regular processes can be established in the resulting inference systems by means of standard axioms to unwind recursive definitions, and the so-called Recursive Specification Principle (RSP).
The work reported in this paper was partly carried out during a stay at Aalborg University Centre, 9220 Aalborg Ø, Denmark, and was partially supported by the Danish Natural Science Research Council under project DART. Additional funding was received by the HCM project EXPRESS.
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
L. Aceto, Deriving complete inference systems for a class of GSOS languages generating regular behaviours, Report IR 93–2009, Institute for Electronic Systems, Department of Mathematics and Computer Science, Aalborg University, Aalborg, November 1993. Also available as Computer Science Report 1/94, University of Sussex, January 1994.
L. Aceto, GSOS and finite labelled transition systems, Report 6/93, Computer Science, University of Sussex, Brighton, 1993. To appear in Theoretical Computer Science.
L. Aceto, B. Bloom, and F. Vaandrager, Turning SOS rules into equations, Report CS-R9218, Cwi, Amsterdam, June 1992. To appear in Information and Compu-tation 111(1/2), May/June 1994.
J. Baeten and W. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, 1990.
J. Bergstra, I. Bethke, and A. Ponse, Process algebra with iteration and nesting, Report P9314ó, University of Amsterdam, Amsterdam, February 1994.
J. Bergstra and J. Klop, A complete inference system for regular processes with silent moves, in Proceedings Logic Colloquium 1986, F. Drake and J. Truss. Eds., Hull, 1988, North-Holland, pp. 21–81. First appeared as: Report CS-R8420, Cwi, Amsterdam, 1984.
B. Bloom, S. Istrail, and A. Meyer, Bisimulation can’t be traced: preliminary re-port, in Conference Record of the Fifteenth Annual Acm Symposium on Principles of Programming Languages, 1988, pp. 229–239. Full version available as Technical Report 90–1150, Department of Computer Science, Cornell University, Ithaca, New York, August 1990. To appear in the Journal of the Acm.
R. Bol and J. Groote, The meaning of negative premises in transition system spec-ifications (extended abstract), in Proceedings 18th Icalp, Madrid, J. Leach Albert, B. Monien, and M. Rodriguez, Eds., vol. 510 of Lecture Notes in Computer Science, Springer-Verlag, 1991, pp. 481–494. Full version available as Report CS-R9054, Cwi, Amsterdam, 1990.
S. Brookes, C. Hoare, and A. Roscoe, A theory of communicating sequential processes, J. Assoc. Comput. Mach., 31 (1984), pp. 560–599.
J. Groote and F. Vaandrager, Structured operational semantics and bisimulation as a congruence, Information and Computation, 100 (1992), pp. 202–260.
M. Hennessy, Algebraic Theory of Processes, Mit Press, Cambridge, Massachusetts, 1988.
M. Hennessy and R. Milner, Algebraic laws for nondeterminism and concurrency, J. Assoc. Comput. Mach., 32 (1985), pp. 137–161.
R. Milner, On relating synchrony and asynchrony, Tech. Report Csr-75–80, Depart-ment of Computer Science, University of Edinburgh, 1981.
R. Milner, A complete inference system for a class of regular behaviours, J. Comput. System Sci., 28 (1984), pp. 439–466.
R. Milner, Communication and Concurrency, Prentice-Hall International, Englewood Cliffs, 1989.
R. Milner, A complete axiomatisation for observational congruence of finite-state behaviors, Information and Computation, 81 (1989), pp. 227–247.
D. Park, Concurrency and automata on infinite sequences, in 5th GI Conference, P. Deussen, ed., vol. 104 of Lecture Notes in Computer Science, Springer-Verlag, 1981, pp. 167–183.
G. Plotkin, A structural approach to operational semantics, Report Daimi FN-19, Computer Science Department, Aarhus University, 1981.
R. D. Simone, Higher-level synchronising devices in Meije-SCCS, Theoretical Comput. Sci., 37 (1985), pp. 245–267.
F. Vaandrager, Expressiveness results for process algebras, in Proceedings Rex Workshop on Semantics: Foundations and Applications, Beekbergen, The Netherlands, J. de Bakker, W. de Roever, and G. Rozenberg, Eds., vol. 666 of Lecture Notes in Com-puter Science, Springer-Verlag, 1993, pp. 609–638.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aceto, L. (1994). Deriving Complete Inference Systems for a Class of GSOS Languages Generating Regular Behaviours. In: Jonsson, B., Parrow, J. (eds) CONCUR ’94: Concurrency Theory. CONCUR 1994. Lecture Notes in Computer Science, vol 836. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48654-1_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-48654-1_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58329-5
Online ISBN: 978-3-540-48654-1
eBook Packages: Springer Book Archive