Sciweavers

402 search results - page 20 / 81
» Model Checking Quantified Computation Tree Logic
Sort
View
LPNMR
2001
Springer
14 years 2 months ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä
DIMACS
1996
13 years 11 months ago
Model Checking and the Mu-calculus
There is a growing recognition of the need to apply formal mathematical methods in the design of \high con dence" computing systems. Such systems operate in safety critical co...
E. Allen Emerson
ENTCS
2006
138views more  ENTCS 2006»
13 years 9 months ago
Model Checking Russian Cards
We implement a specific protocol for bit exchange among card-playing agents in three different state-of-the-art epistemic model checkers and compare the results. Key words: Crypto...
Hans P. van Ditmarsch, Wiebe van der Hoek, Ron van...
IJIS
2011
83views more  IJIS 2011»
13 years 1 months ago
Conceptual modeling in full computation-tree logic with sequence modal operator
In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS∗ , is introdu...
Ken Kaneiwa, Norihiro Kamide
ICCV
2005
IEEE
14 years 11 months ago
Beyond Trees: Common-Factor Models for 2D Human Pose Recovery
Tree structured models have been widely used for determining the pose of a human body, from either 2D or 3D data. While such models can effectively represent the kinematic constra...
Xiangyang Lan, Daniel P. Huttenlocher