Sciweavers

2293 search results - page 281 / 459
» Temporal Logic in Information Systems
Sort
View
QEST
2008
IEEE
16 years 29 days ago
Hintikka Games for PCTL on Labeled Markov Chains
We present Hintikka games for formulae of the probabilistic temporal logic PCTL and countable labeled Markov chains as models, giving an operational account of the denotational se...
Harald Fecher, Michael Huth, Nir Piterman, Daniel ...
MIDDLEWARE
2007
Springer
16 years 22 days ago
Rule-based reasoning about qualitative spatiotemporal relations
This paper is about a novel rule-based approach for reasoning about qualitative spatiotemporal relations among technology-rich autonomous objects, to which we refer to as artifact...
Clemens Holzmann
TACAS
2007
Springer
92views Algorithms» more  TACAS 2007»
16 years 21 days ago
Model Checking Liveness Properties of Genetic Regulatory Networks
Abstract. Recent studies have demonstrated the possibility to build genetic regulatory networks that confer a desired behavior to a living organism. However, the design of these ne...
Grégory Batt, Calin Belta, Ron Weiss
CIMCA
2006
IEEE
16 years 19 days ago
Timed-MPSG: A Formal Model for Real-Time Shop Floor Controller
The MPSG (Message-based Part State Graph) model has been developed for the execution portion of shop-floor controllers that operate in a distributed and hierarchical control envir...
Devinder Thapa, Jaeil Park, Gi-Nam Wang, Dongmin S...
CAV
2005
Springer
127views Hardware» more  CAV 2005»
16 years 3 days ago
Incremental and Complete Bounded Model Checking for Full PLTL
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...
Keijo Heljanko, Tommi A. Junttila, Timo Latvala