Quantified Computation Tree Logic

Patthak, Anindya C.; Bhattacharya, Indrajit; Dasgupta, Anirban; Dasgupta, Pallab; Chakrabarti, P. P.

doi:10.1016/s0020-0190(01)00260-5

Cited by 15 publications

(10 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Over and above the initial result presented in [7], Theorem 4.1 shows that even though Generalized Quantified µ Calculus is significantly richer than Quantified CTL, the model checking complexity remains PSPACE-complete in the general case.…”

Section: Generalized Quantified µ-Calculusmentioning

confidence: 82%

“…It has been shown in [7] that the model checking problem for Quantified CTL in its general form is PSPACE-complete. Since Generalized Quantified µ Calculus subsumes Quantified CTL it follows that Generalized Quantified µ Calculus model checking is PSPACE-hard.…”

Section: Generalized Quantified µ-Calculusmentioning

confidence: 99%

“…The research is motivated by our initial results on this subject [7], which show that a well constrained use of first-order quantification over states in CTL vastly enriches its expressive power without any significant blow-up in model checking complexity. This result opens up interesting possibilities, since other forms of first-order quantification in temporal logics (such as [6,9]) exhibit a blow-up in model checking complexity.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

The power of first-order quantification over states in branching and linear time temporal logics

Chatterjee¹,

Dasgupta²,

Chakrabarti³

2004

Information Processing Letters

Self Cite

View full text Add to dashboard Cite

Section: Generalized Quantified µ-Calculusmentioning

confidence: 82%

Section: Generalized Quantified µ-Calculusmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

The power of first-order quantification over states in branching and linear time temporal logics

Chatterjee¹,

Dasgupta²,

Chakrabarti³

2004

Information Processing Letters

Self Cite

View full text Add to dashboard Cite

“…There is no obvious link (in terms of expressiveness) between all these semantics. Finally, model checking for a slightly different (and less expressive) version of QCTL in the structure semantics is studied in [20].…”

Section: Eqctl Qctl Eqctl * Qctl * Non-elementarymentioning

confidence: 99%

Quantified CTL: Expressiveness and Model Checking

Costa

Laroussinie

Markey

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract-While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke structure or to its unwinding tree), we study its expressiveness (showing in particular that QCTL coincides with Monadic Second-Order Logic for both semantics) and characterize the complexity of its model-checking problem, depending on the number of nested propositional quantifiers (showing that the structure semantics populates the polynomial hierarchy while the tree semantics populates the exponential hierarchy). We also show how these results apply to model checking ATL-like temporal logics for games.

show abstract

“…Computation Tree Logic(CTL) is one of the most syntactically elegant and computationally attractive temporal logics for branching time model checking [10]. And it is also the most wide temporal logic in practice.…”

Section: Introductionmentioning

confidence: 99%

Approach to Formalizing UML Sequence Diagrams

Ruan

2011

2011 3rd International Workshop on Intelligent Systems and Applications

View full text Add to dashboard Cite

UML sequence diagrams are widely used as a behavioral modeling language for interactive systems for their concise and intuitive expression, especially a few high security systems. However, UML sequence diagrams lack precise formal description of semantics when they are used in modeling of the interactions between objects. To solve the problem, this paper proposes a solution by translating the UML sequence diagrams into a formalization system ALCQI-CTL which combines the features of the description logics and computation tree logic, and then formalizing the static semantics and dynamic semantics of UML sequence diagrams. Finally, the example shows that the formalization method is feasible.

show abstract

Quantified Computation Tree Logic

Cited by 15 publications

References 6 publications

The power of first-order quantification over states in branching and linear time temporal logics

The power of first-order quantification over states in branching and linear time temporal logics

Quantified CTL: Expressiveness and Model Checking

Approach to Formalizing UML Sequence Diagrams

Contact Info

Product

Resources

About