921 search results - page 37 / 185 » On Interleaving in Timed Automata |
143
click to vote
SDL
2001
15 years 3 months ago
2001
Abstract. We describe an approach for the verification of quantitative temporal properties of SDL specifications, which adapts techniques developed for timed automata [2]. With res...
119
click to vote
IFM
2007
Springer
15 years 8 months ago
2007
Springer
The Behavior Tree notation has been developed as a method for systematically and traceably capturing user requirements. In this paper we extend the notation with probabilistic beha...
115
click to vote
FORMATS
2003
Springer
15 years 7 months ago
2003
Springer
This text is dedicated to modelling of real-time applications running under multitasking operating system. Theoretical background is based on timed automata by Alur and Dill. As th...
116
click to vote
FORMATS
2009
Springer
15 years 5 months ago
2009
Springer
Abstract In this paper we focus on property-preserving preorders between timed game automata and their application to control of partially observable systems. We define timed weak ...
150
Voted
TACAS
2010
Springer
15 years 9 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...