Skip to search formSkip to main contentSkip to account menu

Computation tree logic

Known as: CTL, Computational tree logic 
Computation tree logic (CTL) is a branching-time logic, meaning that its model of time is a tree-like structure in which the future is not determined… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Modern model checking techniques concentrate on global properties of verified systems, because the methods base on global state… 
2015
2015
Online health communities (OHCs) constitute a useful source of information and social support for patients. American Cancer… 
2014
2014
This research introduces a general methodology in order to create a Coloured Petri Net (CPN) model of a security protocol. Then… 
2011
2011
We present a certain extension of temporal-epistemic logic CTLK, allowing for specification of parametric group knowledge… 
2011
2011
Firstly,the definition of possibilistic Kripke structure is presented,and the possibility measure space based on it is… 
2011
2011
Computation Tree Logic is widely used for modelling the behaviour of simple systems over time, but its expressive power is… 
2006
2006
This paper introduces the notion of game coloured Petri nets. This allows the modeler to explicitly model what parts of the model… 
2006
2006
• Sovelletuimpia modaalilogiikkoja • Aikatulkinta: mahdolliset maailmat mahdollisia ajanhetkiä • Laskennallinen tulkinta… 
2003
2003
This paper is about action computation tree logic (ACTL), a propositional branching-time temporal logic very suitable for… 
1999
1999
The recent advances in computer graphics and multimedia technology provide new means for the visualization of abstract…