49 search results - page 8 / 10 » Symbolic Model Checking of Finite Precision Timed Automata |
FORMATS
2004
Springer
15 years 5 months ago
2004
Springer
We propose an effective and complete method for verifying safety and properties of timed systems, which is based on predicate abstraction for g finite abstractions of timed autom...
131
Voted
TACAS
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We propose a symbolic algorithm to accurately predict atomicity violations by analyzing a concrete execution trace of a concurrent program. We use both the execution trac...
124
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
103
click to vote
FSTTCS
2006
Springer
15 years 3 months ago
2006
Springer
This paper presents a construction for runtime monitors that check real-time properties expressed in timed LTL (TLTL). Due to D'Souza's results, TLTL can be considered a ...
82
Voted
FAC
2008
14 years 11 months ago
2008
We extend the approach of model checking parameterized networks of processes by means of network invariants to the setting of real-time systems. We introduce timed transition stru...