402 search results - page 30 / 81 » Model Checking Quantified Computation Tree Logic |
CONCUR
1999
Springer
14 years 3 months ago
1999
Springer
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...
TIME
2003
IEEE
14 years 4 months ago
2003
IEEE
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
SPIN
2007
Springer
14 years 5 months ago
2007
Springer
d Abstract) Luboˇs Brim and Jiˇr´ı Barnat Faculty of Informatics, Masaryk University, Brno, Czech Republic With the increase in the complexity of computer systems, it becomes e...
ACL
1993
14 years 8 days ago
1993
Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called fea...
WOLLIC
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. In this paper, we present a three-valued property driven model checking algorithm for the logic CTL on hybrid automata. The technique of multivalued model checking for hy...