Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,058,991 papers from all fields of science
Search
Sign In
Create Free Account
CTL*
Known as:
CTL Star
CTL* is a superset of computational tree logic (CTL) and linear temporal logic (LTL). It freely combines path quantifiers and temporal operators…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Atomic formula
Computation tree logic
Computational complexity theory
Context-free grammar
Expand
Broader (2)
Logic in computer science
Temporal logic
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
QBF Encoding of Temporal Properties and QBF-Based Verification
Wenhui Zhang
International Joint Conference on Automated…
2014
Corpus ID: 17330748
SAT and QBF solving techniques have applications in various areas. One area of the applications of SAT-solving is formal…
Expand
2012
2012
Achieving Completeness in Bounded Model Checking of Action Theories in ASP
Laura Giordano
,
A. Martelli
,
D. T. Dupré
International Conference on Principles of…
2012
Corpus ID: 4615566
Temporal logics can be used in reasoning about actions for specifying constraints on domain descriptions and temporal properties…
Expand
2011
2011
Model Checking Epistemic and Probabilistic Properties of Multi-agent Systems
W. Wan
,
J. Bentahar
,
A. Hamza
International Conference on Industrial…
2011
Corpus ID: 17871107
Model checking, a formal automatic verification method, has been widely used in multi-agent systems to verify specifications that…
Expand
2010
2010
A Decidable Class of Nested Iterated Schemata
Vincent Aravantinos
,
R. Caferra
,
N. Peltier
International Joint Conference on Automated…
2010
Corpus ID: 36952049
Many problems can be specified by patterns of propositional formulae depending on a parameter, e.g. the specification of a…
Expand
2010
2010
Developer-friendly verification of process-based systems
E. Pulvermüller
,
Sven Feja
,
A. Speck
Knowledge-Based Systems
2010
Corpus ID: 6680641
2008
2008
Improving state class constructions for CTL* model checking of time Petri nets
Rachid Hadjidj
,
H. Boucheneb
International Journal on Software Tools for…
2008
Corpus ID: 25800468
The state space explosion is still one of the most challenging problems in formal verification using enumerative techniques. The…
Expand
2004
2004
A Logical Approach to Security in the Context of Ambient Calculus
R. Mardare
,
C. Priami
MEFISTO
2004
Corpus ID: 821132
2001
2001
Forest fuel reduction through energy wood production using a small chipper/CTL harvesting system
M. Bolding
,
B. Lanford
2001
Corpus ID: 18703819
In the summer of 2000, fire destroyed millions of acres of forest across the United States. This study investigates the…
Expand
1993
1993
Ockhamist Computational Logic: Past-Sensitive Necessitation in CTL
A. Zanardo
,
J. Carmo
Journal of Logic and Computation
1993
Corpus ID: 28719111
The framework underlying CTL* is extended in order to include past operators Recent developments in areas related to concurrent…
Expand
1987
1987
NEC v. Intel: Will Hardware Be Drawn into the Black Hole of Copyright Editors'
R. Hinckley
1987
Corpus ID: 55679385
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE