Local model-checking of modal mu-calculus on acyclic labeled transition systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2280 LNCS, Issue , 2002, Pages 281-295

  Mateescu, Radu ^a  

^a INRIA RHÔNE ALPES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; CALCULATIONS; TEMPORAL LOGIC;

BOOLEAN EQUATION SYSTEM; EXPRESSIVE POWER; FINITE-STATE CONCURRENT SYSTEM; LABELED TRANSITION SYSTEMS; LOCAL MODEL CHECKING; MODAL MU CALCULUS; MODEL CHECKING PROBLEM; RUNTIME MONITORING;

MODEL CHECKING;

EID: 84888211644     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46002-0_20     Document Type: Conference Paper

References (24)

1. H. R. Andersen. Model checking and boolean graphs. Th. Co. Sci., 126:3-30, 1994.
2. J. C. Bradfield and C. Stirling. Modal Logics and Mu-Calculi: an Introduction. In Handbook of Process Algebra, pp. 293-330, Elsevier, 2001.
3. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 2000.
4. R. Cleaveland, M. Klein, and B. Steffen. Faster Model Checking for the Modal Mu-Calculus. In CAV'92, LNCS Vol. 663, pp. 410-422.
5. R. Cleaveland and B. Steffen. A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus. FM in Syst. Design, 2:121-147, 1993.
6. F. Dietrich, X. Logean, S. Koppenhoefer, and J-P. Hubaux. Testing Temporal Logic Properties in Distributed Systems. In IWTCS'98, pp. 247-262, Kluwer, 1998.
7. X. Du, S. A. Smolka, and R. Cleaveland. Local Model Checking and Protocol Analysis. Springer STTT Journal, 2(3):219-241, 1999.
8. M. Ducassé. OPIUM: An Extendable Trace Analyzer for Prolog. Journal of Logic Programming, 39(1-3):177-224, 1999.
9. E. A. Emerson and C-L. Lei. Efficient Model Checking in Fragments of the Propo-sitional Mu-Calculus. In LICS'86, pp. 267-278, IEEE, 1986.
10. J-C. Fernandez, H. Garavel, A. Kerbrat, R. Mateescu, L. Mounier, and M. Sighireanu. CADP (CÆSAR/ALDEBARAN Development Package): A Protocol Validation and Verification Toolbox. In CAV'96, LNCS Vol. 1102, pp. 437-440.
11. M. J. Fischer and R. E. Ladner. Propositional DynamicLogicof Regular Programs. Journal of Computer and System Sciences, (18):194-211, 1979.
12. H. Garavel. OPEN/CÆSAR: An Open Software Architecture for Verification, Simulation, and Testing. In TACAS'98, LNCS Vol. 1384, pp. 68-84. Full version available as INRIA Research Report RR-3352.
13. K. Ilgun, R. A. Kemmerer, and P. A. Porras. State Transition Analysis: A Rule-Based Intrusion Detection Approach. IEEE Tr. on Soft. Eng., 21(3):181-199, 1995.
14. A. Ingolfsdottir and B. Steffen. Characteristic Formulae for Processes with Divergence. Information and Computation, 110(1):149-163, June 1994.
15. D. Kozen. Results on the Propositional μ-calculus. Th. Co. Sci., 27:333-354, 1983.
16. K. G. Larsen. Efficient Local Correctness Checking. In CAV'92, LNCS Vol. 663, pp. 30-43.
17. X. Liu, C. R. Ramakrishnan, and S. A. Smolka. Fully Local and Efficient Evaluation of Alternating Fixed Points. In TACAS'98, LNCS Vol. 1384, pp. 5-19.
18. A. Mader. Verification of Modal Properties Using Boolean Equation Systems. VER-SAL 8, Bertz Verlag, Berlin, 1997.
19. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems, volume I (Specification). Springer Verlag, 1992.
20. R. Mateescu and M. Sighireanu. Efficient On-the-Fly Model-Checking for Regular Alternation-Free Mu-Calculus. To appear in Science of Comp. Programming, 2002.
21. P. Stevens and C. Stirling. Practical Model-Checking Using Games. In TACAS'98, LNCS Vol. 1384, pp. 85-101.
22. C. Stirling. Modal and Temporal Properties of Processes. Springer Verlag, 2001.
23. I. Walukiewicz. A Complete Deductive System for the μ-calculus. In LICS'93, pp. 136-147. Full version available as Brics Research Report RS-95-6, 1995.
24. B. Vergauwen and J. Lewi. Efficient Local Correctness Checking for Single and Alternating Boolean Equation Systems. In ICALP'94, LNCS Vol. 820, pp. 304-315.