Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2010

2010

We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators… Expand

Is this relevant?

2009

2009

In modal logics, graded (world) modalities have been deeply investigated as a useful framework for generalizing standard… Expand

Is this relevant?

2009

2009

In modal logics, graded (world) modalities have been deeply investigated as a useful framework for generalizing standard… Expand

Is this relevant?

2009

2009

It is known that paraconsistent logical systems are more appropriate for inconsistency-tolerant and uncertainty reasoning than… Expand

Is this relevant?

2009

2009

We study the equivalence relation on states of labelled transition systems of satisfying the same formulas in Computation Tree… Expand

Is this relevant?

2007

2007

Abstract We define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to… Expand

Is this relevant?

2006

2006

Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over… Expand

Is this relevant?

2002

2002

Computation Tree Logic (CTL) is one of the most syntactically elegant and computationally attractive temporal logics for… Expand

Is this relevant?

Highly Cited

2001

Highly Cited

2001

We give a sound and complete axiomatization for the full computation tree logic, CTL*, of R-generable models. This solves a long… Expand

Is this relevant?

1996

1996

We present a sound and complete axiomatisation for extended computation tree logic. This language extends the standard… Expand

Is this relevant?