Testing Hennessy-Milner Logic with Recursion

Authors:
Luca Aceto;Anna Ingólfsdóttir
Affiliations:
-;-
Venue:
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Year:
1999

Citing 12
Cited 1

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
Algebraic theory of processes

Algebraic theory of processes
Substitution revisited

Theoretical Computer Science
Reasoning about infinite computations

Information and Computation
Formal verification of parallel programs

Communications of the ACM
Communication and Concurrency

Communication and Concurrency
On the temporal analysis of fairness

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From Timed Automata to Logic - and Back

MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Model Checking via Reachability Testing for Timed Automata

TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
The Power of Reachability Testing for Timed Automata

Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
Partial Model Checking

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science

Decompositional reasoning about the history of parallel processes

FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.