论文信息 - Interpretation of the Full Computation Tree Logic CTL* on Sets of Infinite Sequences

Interpretation of the Full Computation Tree Logic CTL* on Sets of Infinite Sequences

Formulae of the full computation tree logic CTL* are usually interpreted on infinite trees. In this paper, we propose how to interpret them on Ω-languages, i.e. on sets of infinite sequences, even if the Ω-language does not have a one-to-one corresponding tree representation.

Ulrich Nitsche

[1] Jan van Leeuwen,et al. Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics , 1994 .

[2] Ulrich Nitsche,et al. Verification and behavior abstraction towards a tractable verification technique for large distributed systems , 1996 .

[3] Ulrich Nitsche. Propositional Linear Temporal Logic and Language Homomorphisms , 1994, FOCS 1994.

[4] Edmund M. Clarke,et al. Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[5] Wolfgang Thomas,et al. Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[6] Ulrich Nitsche. A verification method based on homomorphic model abstractions (abstract) , 1994, PODC 1994.

[7] E. Allen Emerson,et al. Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[8] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[9] Orna Kupferman,et al. Module Checking , 1996, Inf. Comput..

[10] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .

[11] Jean Berstel,et al. Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.