10 search results - page 1 / 2 » Probabilistic and Topological Semantics for Timed Automata |
FSTTCS
2007
Springer
13 years 11 months ago
2007
Springer
QEST
2008
IEEE
13 years 11 months ago
2008
IEEE
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
FORMATS
2003
Springer
13 years 10 months ago
2003
Springer
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
IFM
2007
Springer
13 years 11 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...
ICALP
2011
Springer
12 years 8 months ago
2011
Springer
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...