Local Model-Checking for Context-Free Processes

We present a local model checking algorithm that decides for a given contextfree process whether it satisfies a property written in the alternation-free modal mu-calculus. Heart of this algorithm is a purely syntactical sound and complete formal system, which in contrast to the known tableau techniques, uses intermediate higher-order assertions. These assertions provide a finite representation of all the infinite state sets which may arise during the proof in terms of the finite representation of the context-free argument process. This is the key to the effectiveness of our local model checking procedure.

[1]  David E. Muller,et al.  The Theory of Ends, Pushdown Automata, and Second-Order Logic , 1985, Theor. Comput. Sci..

[2]  David Walker,et al.  Local Model Checking in the Modal mu-Calculus , 1991, Theor. Comput. Sci..

[3]  Henrik Reif Andersen.  Model Checking and Boolean Graphs , 1992, ESOP.

[4]  Chin-Laung Lei,et al.  Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract) , 1986, LICS.

[5]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[6]  Kim G. Larsen,et al.  Proof Systems for Satisfiability in Hennessy-Milner Logic with Recursion , 1990, Theor. Comput. Sci..

[7]  Rance Cleaveland,et al.  The Concurrency Workbench , 1990, Automatic Verification Methods for Finite State Systems.

[8]  Bernhard Steffen,et al.  Model Checking for Context-Free Processes , 1992, CONCUR.

[9]  Jan A. Bergstra,et al.  Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages , 1987, PARLE.

[10]  Colin Stirling,et al.  Verifying Temporal Properties of Processes , 1990, CONCUR.

[11]  Lu Tian,et al.  Deciding Bisimilarity of Normed Context-Free Processes is in Sigma^p_2 , 1994, Theor. Comput. Sci..

[12]  James Bret Michael.  Book Review: Verifying Temporal Properties of Systems, by Julian Charles Bradfield: (Birkhäuser Boston, Cambridge, Massachusetts, 1992) , 1992, SIGP.

[13]  Kim G. Larsen,et al.  Efficient Local Correctness Checking , 1992, CAV.

[14]  Hardi Hungar,et al.  Model Checking of macro Processes , 1994, CAV.

[15]  Julian Bradfield.  Verifying Temporal Properties of Systems , 1992, Progress in Theoretical Computer Science.

[16]  Bernhard Steffen,et al.  Pushdown Processes: Parallel Composition and Model Checking , 1994, CONCUR.

[17]  Rance Cleaveland,et al.  Computing Behavioural Relations, Logically , 1991, ICALP.

[18]  Didier Caucal,et al.  On the transition graphs of automata and grammars , 1990, WG.

[19]  Rance Cleaveland,et al.  A linear-time model-checking algorithm for the alternation-free modal mu-calculus , 1993, Formal Methods Syst. Des..

[20]  Glynn Winskel,et al.  A Note on Model Checking the Modal nu-Calculus , 1991, Theor. Comput. Sci..