Testing Hennessy-Milner Logic with Recursion

This study offers a characterization of the collection of properties expressible in Hennessy-Milner Logic (HML) with recursion that can be tested using finite LTSs. In addition to actions used to probe the behaviour of the tested system, the LTSs that we use as tests will be able to perform a distinguished action nok to signal their dissatisfaction during the interaction with the tested process. A process s passes the test T iff T does not perform the action nok when it interacts with s. A test T tests for a property Φ in HML with recursion iff it is passed by exactly the states that satisfy Φ. The paper gives an expressive completeness result offering a characterization of the collection of properties in HML with recursion that are testable in the above sense.

[1]  Luca Aceto,et al.  A Cook's Tour of Equational Axiomatizations for Prefix Iteration , 1998, FoSSaCS.

[2]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[3]  Alley Stoughton,et al.  Substitution Revisited , 1988, Theor. Comput. Sci..

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

[5]  Brian Nielsen,et al.  Towards Re-usable Real-Time Objects , 1998 .

[6]  Kim Guldstrand Larsen,et al.  From Timed Automata to Logic - and Back , 1995 .

[7]  Xinxin Liu,et al.  Compositionality through an Operational Semantics of Contexts , 1990, J. Log. Comput..

[8]  Saharon Shelah,et al.  On the temporal analysis of fairness , 1980, POPL '80.

[9]  Kim G. Larsen,et al.  The power of reachability testing for timed automata , 1998, Theor. Comput. Sci..

[10]  Peter D. Mosses.  CASL: A Guided Tour of Its Design , 1998, WADT.

[11]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

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

[13]  Robert M. Keller,et al.  Formal verification of parallel programs , 1976, CACM.

[14]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[15]  Saharon Shelah,et al.  On the Temporal Basis of Fairness. , 1980 .

[16]  Wang Yi,et al.  Efficient Timed Reachability Analysis using Clock Difference Diagrams , 1998 .

[17]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[18]  Pierre Wolper,et al.  Reasoning About Infinite Computations , 1994, Inf. Comput..

[19]  Wang Yi,et al.  Clock Difference Diagrams , 1998, Nord. J. Comput..

[20]  Brian Nielsen,et al.  Real-Time Layered Video Compression Using SIMD Computation , 1999, ACPC.

[21]  Kim G. Larsen,et al.  Model Checking via Reachability Testing for Timed Automata , 1997, TACAS.

[22]  Henrik Reif Andersen,et al.  Partial Model Checking (Extended Abstract) , 1995, LICS 1995.

[23]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[24]  Henrik Reif Andersen,et al.  Partial model checking , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.