Axiomatizing GSOS with Termination

We discuss a combination of GSOS-type structural operational semantics with explicit termination, that we call the tagh-format (tagh being short for termination and GSOS hybrid).The tagh-format distinguishes between transition and termination rules, but allows besides active and negative premises as in GSOS, also for, what is called terminating and passive arguments. We extend the result of Aceto, Bloom and Vaandrager on the automatic generation of sound and complete axiomatizations for GSOS to the setting of tagh-transition system specifications. The construction of the equational theory is based upon the notion of a smooth and distinctive operation, which have been generalized from GSOS to tagh. The examples provided indicate a significant improvement over the mechanical axiomatization techniques known so far.

[1]  Wan Fokkink,et al.  Introduction to Process Algebra , 1999, Texts in Theoretical Computer Science. An EATCS Series.

[2]  Jan A. Bergstra,et al.  Syntax and defining equations for an interrupt mechanism in process algebra , 1985 .

[3]  J. C. M. Baeten,et al.  Process Algebra: Bibliography , 1990 .

[4]  Jos C. M. Baeten,et al.  Embedding untimed into timed process algebra: the case for explicit termination , 2003, Mathematical Structures in Computer Science.

[5]  Gordon D. Plotkin,et al.  Towards a mathematical operational semantics , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[6]  J. Bergstra,et al.  Mode transfer in process algebra , 2000 .

[7]  Jos L. M. Vrancken,et al.  The Algebra of Communicating Processes With Empty Process , 1997, Theor. Comput. Sci..

[8]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[9]  Dieter Hogrefe,et al.  SDL : formal object-oriented language for communicating systems , 1997 .

[10]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[11]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[12]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[13]  Chris Verhoef,et al.  Concrete process algebra , 1995, LICS 1995.

[14]  L. Aceto.  CPO Models for GSOS Languages - Part I: Compact GSOS Languages , 1994 .

[15]  Irek Ulidowski,et al.  Finite axiom systems for testing preorder and De Simone process languages , 1996, Theor. Comput. Sci..

[16]  Frits W. Vaandrager,et al.  Turning SOS rules into equations , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[17]  J. van Leeuwen,et al.  Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

[18]  Irek Ulidowski,et al.  Axiomatisations of Weak Equivalences for De Simone Languages , 1995, CONCUR.

[19]  Chris Verhoef,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates and Negative Premises , 1994, Nord. J. Comput..

[20]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[21]  S. Griffis.  EDITOR , 1997, Journal of Navigation.

[22]  Erik P. de Vink,et al.  Axiomatizing GSOS with termination , 2002, J. Log. Algebraic Methods Program..