Sciweavers

493 search results - page 52 / 99
» Bounded LTL Model Checking with Stable Models
Sort
View
FSTTCS
2010
Springer
13 years 5 months ago
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
Matthew Hague, Anthony Widjaja To
ACSD
2008
IEEE
106views Hardware» more  ACSD 2008»
13 years 9 months ago
Time-bounded model checking of infinite-state continuous-time Markov chains
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...
Lijun Zhang, Holger Hermanns, Ernst Moritz Hahn, B...
CONCUR
1999
Springer
14 years 12 hour ago
Partial Order Reduction for Model Checking of Timed Automata
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
Marius Minea
MOR
2006
86views more  MOR 2006»
13 years 7 months ago
Evolutionary Stability for Large Populations and Backward Induction
It has been shown (Hart [2002]) that the backward induction (or subgame-perfect) equilibrium of a perfect information game is the unique stable outcome for dynamic models consisti...
Ziv Gorodeisky
VLSID
2004
IEEE
117views VLSI» more  VLSID 2004»
14 years 8 months ago
Evaluating the Reliability of Defect-Tolerant Architectures for Nanotechnology with Probabilistic Model Checking
As we move from deep submicron technology to nanotechnology for device manufacture, the need for defect-tolerant architectures is gaining importance. This is because, at the nanos...
Gethin Norman, David Parker, Marta Z. Kwiatkowska,...