Sciweavers

1032 search results - page 8 / 207
» Extended Computation Tree Logic
Sort
View
ICALP
2000
Springer
15 years 1 months ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen
ATVA
2008
Springer
131views Hardware» more  ATVA 2008»
14 years 11 months ago
Computation Tree Regular Logic for Genetic Regulatory Networks
Model checking has proven to be a useful analysis technique not only for concurrent systems, but also for the genetic regulatory networks (Grns) that govern the functioning of livi...
Radu Mateescu, Pedro T. Monteiro, Estelle Dumas, H...
ISMIR
2005
Springer
152views Music» more  ISMIR 2005»
15 years 3 months ago
ATTA: Automatic Time-Span Tree Analyzer Based on Extended GTTM
This paper describes a music analyzing system called the automatic time-span tree analyzer (ATTA), which we have developed. The ATTA derives a time-span tree that assigns a hierar...
Masatoshi Hamanaka, Keiji Hirata, Satoshi Tojo
LPAR
2007
Springer
15 years 3 months ago
One-Pass Tableaux for Computation Tree Logic
Pietro Abate, Rajeev Goré, Florian Widmann
ACL
2001
14 years 11 months ago
Extending Lambek Grammars: a Logical Account of Minimalist Grammars
We provide a logical definition of Minimalist grammars, that are Stabler's formalization of Chomsky's minimalist program. Our logical definition leads to a neat relation...
Alain Lecomte, Christian Retoré