Branching time temporal logic and amorphous tree automata

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

Volumn 715 LNCS, Issue , 1993, Pages 262-277

  Bernholtz, Orna ^a   Grumberg, Orna ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORESTRY; MODEL CHECKING;

ACCEPTANCE CONDITIONS; BRANCHING DEGREE; BRANCHING TIME; DECISION PROCEDURE; MEMBERSHIP PROBLEM; MODEL CHECKING ALGORITHM; POLYNOMIAL MODELING; SATISFIABILITY;

TEMPORAL LOGIC;

EID: 84958762116     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57208-2_19     Document Type: Conference Paper

References (13)

1. Clarke, E.M. and Emerson, E.A., Design and synthesis of synchronization skeletons using branching time temporal logic. Proc. Workshop on Logic of Programs, LNCS 131 (1981) 52-71
2. Emerson, E.A., Temporal and modal logic. Handbook of theoretical computer science. (1990) 997-1072 North-Holland.
3. Emerson, E.A. and Sistla, A.P., Deciding full Branching Time Logics. Inform. and Control 61(3) (1984) 175-201.
4. Harel, D., Effective Transformations on Infinite Trees, with Applications to High Undecidability, Dominoes and Fairness. J. Assoc. Comput. Mach. 33 (1986) 224-248.
5. Pnueli A., The temporal logic of programs. Proc. 18th Symp. on Foundation of Computer Science. (1977) 46-57.
6. Rabin, M.O., Decidability of second order theories and automata on infinite trees. Trans. AMS, 141 (1969) 1-35.
7. Thomas W., Automata on Infinite Objects. Handbook of theoretical computer science. (1990) 165-191, North-Holland.
8. Vardi M.Y., Automata theory for database theoreticians. Proc. 8th ACM Symp. on Principles of Data Systems. (1989) 83-92.
9. Vardi, M.Y., Verification of concurrent programs: the automatatheoretic framework. Annals of Pure and Applied Logic 51 (1991) 79-98.
10. Vardi, M.Y. and Wolper, P., Automata theoretic techniques for modal logics of programs. Journal of computer and system science 32. (1986) 183-221
11. Vardi M.Y. and Wolper P., An Automata theoretic approach to automatic program verification. Proc. Symp. on Logic in Computer Science, (1986) 322-331
12. Wolper, P., On the relations of programs and computations to models of temporal logic, Temporal Logic in Specification, LNCS 398, (1989) 75-123
13. Wolper P., Vardi M.Y., and Sistla P., Reasoning about infinite computation paths, Proc. 24th Symp. on Foundations of Computer Science, (1983) 185-194.