3387 search results - page 540 / 678 » Model-Checking for Real-Time Systems |
QEST
2008
IEEE
14 years 4 months ago
2008
IEEE
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...
LCPC
2007
Springer
14 years 4 months ago
2007
Springer
Binary Decision Diagrams (BDDs) have recently become widely accepted as a space-efficient method of representing relations in points-to analyses. When BDDs are used to represent re...
SPIN
2007
Springer
14 years 4 months ago
2007
Springer
One of the most exciting and promising approaches to ensure the correctness of critical systems is software model checking, which considers real code, written with standard program...
QEST
2006
IEEE
14 years 4 months ago
2006
IEEE
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...
PASTE
2005
ACM
14 years 3 months ago
2005
ACM
Today, many formal analysis tools are not only used to provide certainty but are also used to debug software systems – a role that has traditional been reserved for testing tool...