-
Model-Checking of CTL on Infinite Kripke Structures Defined by Simple Graph G...
We present an algorithm for checking whether an infinite transition system, defined by a graph grammar of a restricted kind, is a model of a formula of the temporal... -
Counting CTL
The original publication is available at www.springerlink.com. -
Learning Transition Rules from Temporal Logic Properties
Most of the work on temporal representation issues in Machine Learning deals with the problem of learning/mining temporal patterns from a large set of temporal data.... -
Immunological properties of recombinant classical swine fever virus NS3 prote...
International audience -
A BSP algorithm for on-the-fly checking CTL* formulas on security protocols
International audience
