## Is Observational Congruence on µ-Expressions Axiomatisable in Equational Horn Logic? (2007)

Citations: | 1 - 1 self |

### BibTeX

@MISC{Mendler07isobservational,

author = {Michael Mendler and Gerald Lüttgen},

title = {Is Observational Congruence on µ-Expressions Axiomatisable in Equational Horn Logic? },

year = {2007}

}

### OpenURL

### Abstract

It is well known that bisimulation on µ-expressions cannot be finitely axiomatised in equational logic. Complete axiomatisations such as those of Milner and Bloom/Ésik necessarily involve implicational rules. However, both systems rely on features which go beyond pure equational Horn logic: either the rules are impure by involving non-equational side-conditions, or they are schematically infinitary like the congruence rule which is not Horn. It is an open question whether these complications cannot be avoided in the proof-theoretically and computationally clean and powerful setting of second-order equational Horn logic. This paper presents a positive and a negative result regarding axiomatisability of observational congruence in equational Horn logic. Firstly, we show how Milner’s impure rule system can be reworked into a pure Horn axiomatisation that is complete for guarded processes. Secondly, we prove that for unguarded processes, both Milner’s and Bloom/Ésik’s axiomatisations are incomplete without the congruence rule, and neither system has a complete extension in rank 1 equational axioms. It remains open whether there are higher-rank equational axioms or Horn rules which would render Milner’s or Bloom / Ésik’s axiomatisations complete for unguarded processes.

### Citations

3609 | Communicating Sequential Processes
- Hoare
- 1985
(Show Context)
Citation Context ...r the latter, however, this is more serious since unguardedness across unobservable actions is nontrivial when these are generated dynamically from communication (as in CCS [21]) or hiding (as in CSP =-=[17]-=-). In fact, our work was triggered by failed attempts to obtain a complete axiomatisation of observational congruence for regular processes in the timed process algebras PMC [4] and CSA [10]. In those... |

3389 |
Communication and Concurrency
- Milner
- 1989
(Show Context)
Citation Context ... rule R2, symmetry and transitivity of equality, one finally gets p = µx.(α.x+β.x) = q. Due to this issue of unguardedness, the above question is particularly challenging for observational congruence =-=[21]-=-. The question’s importance lies in the fact that the Horn rule format is crucial for standard automated reasoning based on Prolog-style SLD resolution. Moreover, the question is an interesting one si... |

307 | The linear time – branching time spectrum I
- Glabbeek
- 2001
(Show Context)
Citation Context ...enough to capture not only the object-level syntax of processes but also the meta-level syntax of schemes and rules needed to formalise logic deduction. Our language µBCCSP 2 is an extension of BCCSP =-=[15]-=- by recursion and schematic variables. It corresponds to the second-order fragment T 2 of [26]. WIAI, University of Bamberg 3 Technical Report 72(2007)sM. Mendler, G. Lüttgen Horn Axiomatisation of Ob... |

288 |
Regular Algebra and Finite Machines
- Conway
- 1971
(Show Context)
Citation Context ...uivalence [9]). The focus on finite processes is natural since many behavioural relations cannot be finitely axiomatised in the presence of recursion. This has long been known for regular expressions =-=[11]-=- and was shown to apply to µexpressions as well [8, 26]. Except for special and not very well understood situations in the language of ∗-expressions [11, 13, 14], purely equational theories appear to ... |

195 | A completeness theorem for Kleene algebras and the algebra of regular events
- Kozen
- 1994
(Show Context)
Citation Context ...e. Specifically, we conjecture that unguardedness on µ-expressions cannot be axiomatised in second-order equational Horn logic of any rank. Note that for ∗-expressions this problem does not occur. In =-=[18]-=-, Kozen presented a finitary axiomatisation of the Kleene algebra of ∗-expressions involving only pure equational implications. Since ∗-expressions do not have an explicit recursion binder, a congruen... |

126 |
A complete inference system for a class of regular behaviours
- Milner
- 1984
(Show Context)
Citation Context ...for regular processes. A suitable and quite natural setting is provided by (second-order) equational Horn logic [25]. Indeed, Milner’s axiomatisation of strong bisimulation for finite state processes =-=[20]-=- and Bloom/ Ésik’s abstract generalisation [6, 12] involve conditional equations, as does Milner’s axiomatisation of observational congruence [22] and Glabbeek’s axiomatisation of branching bisimulati... |

81 | Two complete axiom systems for the algebra of regular events - SALOMAA - 1966 |

62 | Higher-order Horn clauses
- Nadathur, Miller
- 1990
(Show Context)
Citation Context ...tting is needed in order to study the relative proof-theoretic complexities of theories for regular processes. A suitable and quite natural setting is provided by (second-order) equational Horn logic =-=[25]-=-. Indeed, Milner’s axiomatisation of strong bisimulation for finite state processes [20] and Bloom/ Ésik’s abstract generalisation [6, 12] involve conditional equations, as does Milner’s axiomatisatio... |

59 |
A complete axiomatisation for observational congruence of behaviours
- Milner
- 1989
(Show Context)
Citation Context ...ion of strong bisimulation for finite state processes [20] and Bloom/ Ésik’s abstract generalisation [6, 12] involve conditional equations, as does Milner’s axiomatisation of observational congruence =-=[22]-=- and Glabbeek’s axiomatisation of branching bisimulation [16], or the various bisimulation-style equivalences in timed process algebras [3, 4, 5, 10]. Looking at these in detail, however, reveals that... |

52 | Axioms for Concurrency - Moller - 1989 |

49 |
Process algebra with timing
- Baeten, Middelburg
- 2002
(Show Context)
Citation Context ...as does Milner’s axiomatisation of observational congruence [22] and Glabbeek’s axiomatisation of branching bisimulation [16], or the various bisimulation-style equivalences in timed process algebras =-=[3, 4, 5, 10]-=-. Looking at these in detail, however, reveals that they are not strictly Horn theories because they depend on the congruence rule for recursion (cf. rule C4 below) which is not Horn, and they are not... |

34 | Basic process algebra with iteration: Completeness of its equational xioms. The Computer Journal
- Fokkink, Zantema
- 1994
(Show Context)
Citation Context ...is has long been known for regular expressions [11] and was shown to apply to µexpressions as well [8, 26]. Except for special and not very well understood situations in the language of ∗-expressions =-=[11, 13, 14]-=-, purely equational theories appear to be inadequate for recursive processes. Thus, a more powerful setting is needed in order to study the relative proof-theoretic complexities of theories for regula... |

32 | Iteration theories: the equational logic of iterative processes - Bloom, Ésik - 1993 |

30 | Axiomatizing prefix iteration with silent steps - Aceto, Glabbeek, et al. - 1996 |

29 | Finite Equational Bases in Process Algebra: Results and Open Questions
- Aceto, Fokkink, et al.
- 2005
(Show Context)
Citation Context ...Observational Congruence 1 Introduction The existence and nonexistence of equational axiomatisations of behavioural equivalences in process algebra has received significant interest in the literature =-=[2, 8, 23, 24, 26]-=-. Most recent work is concerned with finite processes and equational axiomatisations for a range of operators (such as for priority [1]) and behavioural semantics (such as for simulation equivalence [... |

29 | Veri of an alternating bit protocol by means of process algebra - Bergstra, Klop - 1985 |

27 | A complete axiomatization for branching bisimulation congruence of behaviours
- Glabbeek
- 1993
(Show Context)
Citation Context ...d Bloom/ Ésik’s abstract generalisation [6, 12] involve conditional equations, as does Milner’s axiomatisation of observational congruence [22] and Glabbeek’s axiomatisation of branching bisimulation =-=[16]-=-, or the various bisimulation-style equivalences in timed process algebras [3, 4, 5, 10]. Looking at these in detail, however, reveals that they are not strictly Horn theories because they depend on t... |

25 | An asynchronous process algebra with multiple clocks, in
- Andersen, Mendler
- 1994
(Show Context)
Citation Context ...as does Milner’s axiomatisation of observational congruence [22] and Glabbeek’s axiomatisation of branching bisimulation [16], or the various bisimulation-style equivalences in timed process algebras =-=[3, 4, 5, 10]-=-. Looking at these in detail, however, reveals that they are not strictly Horn theories because they depend on the congruence rule for recursion (cf. rule C4 below) which is not Horn, and they are not... |

25 |
Iteration Theories: The Equational Logic
- Bloom, Ésik
- 1993
(Show Context)
Citation Context ...t and the more difficult case of equational Horn rules other than R2 and GA to future work. Future work shall also investigate whether categorical languages, such as the one used by Bloom and Ésik in =-=[7]-=-, can help to simplify our technical framework. WIAI, University of Bamberg 15 Technical Report 72(2007)sM. Mendler, G. Lüttgen Horn Axiomatisation of Observational Congruence A Proofs for Section 3 a... |

25 | A complete inference system for regular processes with silent moves - Bergstra, Klop - 1986 |

21 | An algebraic theory of multiple clocks
- Cleaveland, Lüttgen, et al.
- 1997
(Show Context)
Citation Context ...as does Milner’s axiomatisation of observational congruence [22] and Glabbeek’s axiomatisation of branching bisimulation [16], or the various bisimulation-style equivalences in timed process algebras =-=[3, 4, 5, 10]-=-. Looking at these in detail, however, reveals that they are not strictly Horn theories because they depend on the congruence rule for recursion (cf. rule C4 below) which is not Horn, and they are not... |

21 | A complete equational axiomatization for prefix iteration
- Fokkink
- 1994
(Show Context)
Citation Context ...is has long been known for regular expressions [11] and was shown to apply to µexpressions as well [8, 26]. Except for special and not very well understood situations in the language of ∗-expressions =-=[11, 13, 14]-=-, purely equational theories appear to be inadequate for recursive processes. Thus, a more powerful setting is needed in order to study the relative proof-theoretic complexities of theories for regula... |

20 | A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours
- Aceto, Jeffrey
- 1995
(Show Context)
Citation Context |

19 | CCS with Hennessy’s merge has no finite equational axiomatization - Aceto, Fokkink, et al. - 2005 |

16 |
The nonexistence of finite axiomatisations for CCS congruences
- Moller
- 1990
(Show Context)
Citation Context ...Observational Congruence 1 Introduction The existence and nonexistence of equational axiomatisations of behavioural equivalences in process algebra has received significant interest in the literature =-=[2, 8, 23, 24, 26]-=-. Most recent work is concerned with finite processes and equational axiomatisations for a range of operators (such as for priority [1]) and behavioural semantics (such as for simulation equivalence [... |

15 |
Nonaxiomatisability of equivalences over finite state processes
- Sewell
- 2000
(Show Context)
Citation Context ...Observational Congruence 1 Introduction The existence and nonexistence of equational axiomatisations of behavioural equivalences in process algebra has received significant interest in the literature =-=[2, 8, 23, 24, 26]-=-. Most recent work is concerned with finite processes and equational axiomatisations for a range of operators (such as for priority [1]) and behavioural semantics (such as for simulation equivalence [... |

13 | On the axiomatizability of priority
- Aceto, Chen, et al.
(Show Context)
Citation Context ...s received significant interest in the literature [2, 8, 23, 24, 26]. Most recent work is concerned with finite processes and equational axiomatisations for a range of operators (such as for priority =-=[1]-=-) and behavioural semantics (such as for simulation equivalence [9]). The focus on finite processes is natural since many behavioural relations cannot be finitely axiomatised in the presence of recurs... |

8 |
algebras
- Brzozowski, Esik, et al.
- 2003
(Show Context)
Citation Context ...ural setting is provided by (second-order) equational Horn logic [25]. Indeed, Milner’s axiomatisation of strong bisimulation for finite state processes [20] and Bloom/ Ésik’s abstract generalisation =-=[6, 12]-=- involve conditional equations, as does Milner’s axiomatisation of observational congruence [22] and Glabbeek’s axiomatisation of branching bisimulation [16], or the various bisimulation-style equival... |

8 | Completeness of Park induction - Ésik - 1997 |

8 | On the completeness of the equations for the Kleene star in bisimulation - Fokkink - 1996 |

5 | On finite alphabets and infinite bases III: Simulation
- Chen, Fokkink
- 2006
(Show Context)
Citation Context ...]. Most recent work is concerned with finite processes and equational axiomatisations for a range of operators (such as for priority [1]) and behavioural semantics (such as for simulation equivalence =-=[9]-=-). The focus on finite processes is natural since many behavioural relations cannot be finitely axiomatised in the presence of recursion. This has long been known for regular expressions [11] and was ... |

5 | Impossibility results for the equational theory of Timed CCS - Aceto, Ingolfsdottir, et al. - 2007 |

4 |
Iteration algebras are not finitely axiomatizable
- Bloom, Ésik
- 2000
(Show Context)
Citation Context |

3 | Axiomatizing the least fixed point operation and binary supremum - Ésik - 2000 |

2 | The equational theory of fixed points with applications to generalized language theory
- Ésik
- 2001
(Show Context)
Citation Context ...ural setting is provided by (second-order) equational Horn logic [25]. Indeed, Milner’s axiomatisation of strong bisimulation for finite state processes [20] and Bloom/ Ésik’s abstract generalisation =-=[6, 12]-=- involve conditional equations, as does Milner’s axiomatisation of observational congruence [22] and Glabbeek’s axiomatisation of branching bisimulation [16], or the various bisimulation-style equival... |

2 | The Algebra of Finite State Processes - Sewell - 1995 |

1 | An equational axiomatisation of bisimulation over regular expressions - Corradini, Nicola, et al. - 2002 |

1 | A fully abstract denotational model for observational precongruence - Ingólfsdóttir, Schalk - 2001 |