Sciweavers

357 search results - page 15 / 72
» Computing Reachable States for Nonlinear Biological Models
Sort
View
HYBRID
2007
Springer
14 years 3 months ago
Symbolic Analysis for GSMP Models with One Stateful Clock
We consider the problem of verifying reachability properties of stochastic real-time systems modeled as generalized semi-Markov processes (GSMPs). The standard simulation-based tec...
Mikhail Bernadsky, Rajeev Alur
ICCAD
1999
IEEE
78views Hardware» more  ICCAD 1999»
14 years 2 months ago
Probabilistic state space search
This paper describes a probabilistic approach to state space search. The presented method applies a ranking of the design states according to their probability of reaching a given...
Andreas Kuehlmann, Kenneth L. McMillan, Robert K. ...
IFIPTCS
2000
14 years 1 months ago
Hierarchical State Machines
Hierarchical state machines are finite state machines whose states themselves can be other machines. In spite of their popularity in many modeling tools for software design, very l...
Mihalis Yannakakis
FGCS
2006
83views more  FGCS 2006»
13 years 9 months ago
Memory-efficient Kronecker algorithms with applications to the modelling of parallel systems
We present a new algorithm for computing the solution of large Markov chain models whose generators can be represented in the form of a generalized tensor algebra, such as network...
Anne Benoit, Brigitte Plateau, William J. Stewart
TIME
2007
IEEE
14 years 4 months ago
A Symbolic Decision Procedure for Robust Safety of Timed Systems
We present a symbolic algorithm for deciding safety (reachability) of timed systems modelled as Timed Automata (TA), under the notion of robustness w.r.t. infinitesimal clock-drif...
Mani Swaminathan, Martin Fränzle