321 search results - page 35 / 65 » Symbolic Model Checking for Probabilistic Timed Automata |
FOSSACS
2007
Springer
14 years 1 months ago
2007
Springer
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
ENTCS
2006
13 years 7 months ago
2006
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
FMSD
2010
13 years 6 months ago
2010
In this paper, we consider verifying properties of mixed-signal circuits, i.e., circuits for which there is an interaction between analog (continuous) and digital (discrete) values...
SACMAT
2009
ACM
14 years 2 months ago
2009
ACM
An access control system is often viewed as a state transition system. Given a set of access control policies, a general safety requirement in such a system is to determine whethe...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
— Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness ...