391 search results - page 9 / 79 » Compositionality for Probabilistic Automata |
FORMATS
2006
Springer
14 years 7 days ago
2006
Springer
Timed and weak timed simulation relations are often used to show that operations on hybrid systems result in equivalent behavior or in conservative overapproximations. Given that s...
CONCUR
2009
Springer
14 years 3 months ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
QEST
2008
IEEE
14 years 3 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...
FORTE
2007
13 years 10 months ago
2007
Abstract. The publish-subscribe architectural style has recently emerged as a promising approach to tackle the dynamism of modern distributed applications. The correctness of these...
APLAS
2007
ACM
14 years 18 days ago
2007
ACM
Abstract. We propose an extension of the Applied Pi