On distributive fixed-point expressions

For every fixed-point expression e of alternation-depth r, we construct a new fixed-point expression e' of alternation-depth 2 and size O(r. |e|). Expression e' is equivalent to e whenever operators are distributive and the underlying complete lattice has a co-continuous least upper bound. We show that our transformation is optimal not only w.r.t. alternation-depth but also w.r.t. the increase in size of the resulting expression.

[1]  Julian Bradfield.  CONCUR '96: Concurrency Theory , 1996 .

[2]  Edmund M. Clarke,et al.  Characterizing Correctness Properties of Parallel Programs Using Fixpoints , 1980, ICALP.

[3]  David Michael Ritchie Park,et al.  On the Semantics of Fair Parallelism , 1979, Abstract Software Specifications.

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

[5]  Bart Vergauwen,et al.  Efficient Checking of Behavioural Relations and Modal Assertions using Fixed-Point Inversion , 1995, CAV.

[6]  Damian Niwinski,et al.  Fixed points vs. infinite generation , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[7]  Julian C. Bradfield,et al.  The Modal µ-Calculus Alternation Hierarchy is Strict , 1998, Theor. Comput. Sci..

[8]  Roland Carl Backhouse,et al.  A Calculational Approach to Mathematical Induction , 1997, Theor. Comput. Sci..

[9]  A. Prasad Sistla,et al.  On Model-Checking for Fragments of µ-Calculus , 1993, CAV.

[10]  R. Sikorski,et al.  The mathematics of metamathematics , 1963 .

[11]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[12]  André Arnold,et al.  p329 The µ-calculus alternation-depth hierarchy is strict on binary trees , 1999, RAIRO Theor. Informatics Appl..

[13]  Girish Bhat,et al.  Efficent Local Model-Checking for Fragments of teh Modal µ-Calculus , 1996, TACAS.

[14]  David E. Muller,et al.  Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity , 1986, ICALP.

[15]  Lawrence Flon,et al.  Consistent and complete proof rules for the total correctness of parallel programs , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[16]  Giacomo Lenzi.  A Hierarchy Theorem for the µ-Calculus , 1996, ICALP.

[17]  R. Cleaveland.  Eecient Local Model-checking for Fragments of the Modal -calculus , 1996 .

[18]  Damian Niwinski,et al.  Fixed Point Characterization of Infinite Behavior of Finite-State Systems , 1997, Theor. Comput. Sci..

[19]  Damian Niwinski,et al.  Fixed point characterization of weak monadic logic definable sets of trees , 1992, Tree Automata and Languages.

[20]  Marcin Jurdziński,et al.  Deciding the Winner in Parity Games is in UP \cap co-Up , 1998, Inf. Process. Lett..

[21]  Damian Niwinski.  On Fixed-Point Clones (Extended Abstract) , 1986, ICALP.