Structural Operational Semantics with First-Order Logic

We define a formalism for Structural Operational Semantics (SOS) with first-order-logic formulas as premises. It is shown that in most uses (including all practical uses) this formalism has the same expressivity as SOS without first-order logic. Furthermore, we give a congruence format for (strong) bisimilarity. The latter is shown to be strongly related to the ntyft/ntyxt format.

[1]  Luca Aceto,et al.  Termination, Deadlock and Divergence , 1989, Mathematical Foundations of Programming Semantics.

[2]  Mohammad Reza Mousavi,et al.  A Congruence Rule Format with Universal Quantification , 2007, Electron. Notes Theor. Comput. Sci..

[3]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[4]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[5]  T. Langholm.  Partiality, truth and persistence , 1988 .

[6]  Jcm Jos Baeten,et al.  Processen en procesexpressies , 1987 .

[7]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

[8]  Jan Friso Groote,et al.  The Meaning of Negative Premises in Transition System Specifications , 1991, ICALP.

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

[10]  Jos C. M. Baeten,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates , 1993, CONCUR.

[11]  Jan Friso Groote,et al.  Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..

[12]  Luca Aceto,et al.  Structural Operational Semantics , 1999, Handbook of Process Algebra.

[13]  Farhad Arbab,et al.  Formal Semantics and Analysis of Component Connectors in Reo , 2006, FOCLASA.

[14]  Gordon D. Plotkin,et al.  The origins of structural operational semantics , 2004, J. Log. Algebraic Methods Program..

[15]  Jaco van de Pol.  Operational Semantics of Rewriting with Priorities , 1998, Theor. Comput. Sci..

[16]  Stephen Cole Kleene,et al.  On notation for ordinal numbers , 1938, Journal of Symbolic Logic.

[17]  Jan Friso Groote,et al.  Transition System Specifications with Negative Premises , 1993, Theor. Comput. Sci..

[18]  Jan Friso Groote,et al.  SOS formats and meta-theory: 20 years after , 2007, Theor. Comput. Sci..

[19]  Wan Fokkink,et al.  Ntyft/Ntyxt Rules Reduce to Ntree Rules , 1996, Inf. Comput..

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