254 search results - page 14 / 51 » Model Checking Branching Time Logics |
TAPSOFT
1997
Springer
15 years 3 months ago
1997
Springer
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
119
click to vote
VMCAI
2010
Springer
15 years 9 months ago
2010
Springer
In the recent years, there have been a large amount of investigations on safety verification of uncertain continuous systems. In engineering and applied mathematics, this verificat...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t...
98
Voted
AC
2005
Springer
14 years 11 months ago
2005
Springer
The aim of this chapter is to give an overview of the theoretical foundation and the practical application of logic model checking techniques for the verification of multi-threade...
RISE
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...