On the complexity of branching modular model checking

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

Volumn 962, Issue , 1995, Pages 408-422

  Kupferman, Oma ^a   Vardi, Moshe Y ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SPECIFICATIONS;

ALTERNATING AUTOMATA; GUARANTEED BEHAVIOR; MODULAR MODELING; MODULAR VERIFICATION; PATH QUANTIFIERS; PSPACE-COMPLETE; SPACE EFFICIENT ALGORITHMS; TEMPORAL FORMULAE;

MODEL CHECKING;

EID: 84947733929     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60218-6_31     Document Type: Conference Paper

References (37)

1. M. Abadi and L. Lamport. Composing specifications. ACM Transactions on Programming Languages and Systems. 15(1):73-132, 1993.
2. J.R. Butch, E.M. Clarke, K.L. McMillan. D.L. Dill. and L.J. Hwang. Symbolic model checking: 102o states and beyond. In Proc. 5th LICS, pp. 428-439, 1990.
3. O. Bernholtz, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. In Proc. 6th CAV, LNCS 818, pp. 142-155, 1994. Full version available from anthors.
4. E.M. Clarke and LA. Draghicescu. ExpressibKity results for linear-time and branching-time logics. In Proc. Workshop on Linear Time, Branching Time, and Partial Order in Logics and Models for Concurrency., pp. 428-437. LNCS, Springer-Verlag, 1988.
5. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, 1986.
6. E.M. Clarke and O. Grumberg. Research on automatic verification of finite-state concurrent systems. In Annual Review of Computer Science, vol. 2, pp. 269-290. 1987.
7. E.M. Clarke, O. Gnmlberg, and D. Long. Verification tools for finite-state concurrent systems. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, eds., Decade of Concurrency-Reflections and Perspectives (Proc. of REX School), LNCS, pp. 124-175. Sptinger-Verlag, 1993.
8. E.M. Clarke, D.E. Long, and K.L. McMillan. Compositional model checking. In Proc. 4th L/CS, pp. 353-362, 1989.
9. W. Datum, G. Döhmea. V. Gersmer, and B. Josko. Modular verification of Petri nets: the temporal logic approach. In Proc. REX Workshop, LNCS 430. pp. 180-207, 1989.
10. D. Dams, O. Grumberg, and R. Gerth. Generation of reduced models for checking fragments of CTL. In Proc. 5th CAV, LNCS 697, pp. 479-490, 1993.
11. E.A. Emerson and C. Jutla. The complexity of tree automata and logics of programs. In Proc. of the 29th FOCS, 1988.
12. E.A. Emerson and C.-L. Lel. Temporal model checking under generalized fairness constraints. In Prec. 18th Hawaii Internatzonal Conference on System Sciences, 1985.
13. E.A. Fanerson and C.-L. Lei. Modalities for model chengmg: Branching tmae logic strikes back. Science of Computer Programming, 8:275-306, 1987.
14. E.A. Emerson. Ternpocal and modal logic. Handbook of theoretical computer science, pp. 997-1072, 1990.
15. O. Grumberg and D.E. Long. Model checking and modular vetifieatico. ACM Trans. on Programming Languages and Systems, 16(3):843-871. 1994.
16. C.B. lonea. Specification and design of (parallel) programs, ha R.E.A. Mason, ed., Information Processing 83: Prec. 1FIP 9th World Congress, pp. 321-332. North-Holland, 1983.
17. B. Josko. MCTL-an extension of CTL for modular verification of concurrent systems. In Temporal Logic in Specification. LNCS 398, pp. 165-187, 1987.
18. B. Iosko. Model checking of CTL formulae under liveneas assumptions. In Prec. 14th ICALP, I., NCS 26, pp. 280-289, 1987.
19. B. Josko. Verifying the correemeas of AADL modules using model ehekeing. In Prec. REX workshop, LNCS 430, pp. 386--400, 1989.
20. L. Lamport. Sometimes is sometimes "not never"-on the temporal logic of programs. In Prec. 7th POPL, pp. 174-185. 1980.
21. L. Lamport. Specifying concurrent program modules. ACM Trans. on Programming Languages and Systems, 5:190-222. 1983.
22. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Prec. 20th POPL, pp. 97-107, 1985.
23. N. Lynch. Log space recognition and translation of parenthesis languages. J. ACM, 24:583-590. 1977.
24. D.E. Muller and P.E. Sehupp. Alternating automata on infinite trees. Theoretical Computer Science, 54:267-276, 1987.
25. D.E. Muller, A. Saoudi, and P.E. Sehupp. Alternating automata, the weak monadie theory of the tree and its complexity. In Proc. 13th ICALP, 1986.
26. A. Pnueli. The tempocal logic of programs. In Prec. 18th FOCS, pp. 46-57, 1977.
27. A. Pnueli. In transition from global to modular tempocal reasoning about programs. In Logics and Models o/Concurrent Systems, vol. F-13 of NATO Advanced Summer Institutes, pp. 123-144, 1985.
28. I.P. Queille and J. Sifakis. Spceitieation and verification of concurrent systems in Cesar. In Prec. 5th Syrup. on Programming, LNCS 137, pp. 337-351, 1981.
29. M.O. Rabin. Decidability of second order theories and automata on infinite trees. Transaction of the AMS, 141:1-35, 1969.
30. S. Safra. Complexity of automata on infinite objects. PhD thesis, Welzmama Institute of Seienca, Rehovot, Israel, 1989.
31. WJ. Saviteh. Relationship between nondetea'ministie and deterrninistie tape complexities. J. on Computer and System Sciences, 4:177-192, 1970.
32. A.P. Sistla and E.M. Clarke. The complexity of propositional linear temporal logic. J. ACM, 32:733-749, 1985.
33. W. Thomas. Automata on infinite objects. Handbook of theoretical computer science, pp. 165-191, 1990.
34. M.Y. Vardl. On the complexity of modular model checking. In Prec. 10th LICS, 1995.
35. M.Y. Vardi and L. Stoclaneyer. Improved upper and lower bounds for modal logics of programs. In Proc 17th STOC, pp. 240-251, 1985.
36. M.Y. Vardi and P. Wolper. Reasoning about infinite computations, lnformation and Computation, 115(1):1-37, 1994.
37. P. Wolper. On the relation of programs and computations to models of temporal logic. In Prec. Temporal Logic in Specification, LNCS 398, pp. 75-123, 1989.