384 search results - page 13 / 77 » On the Semantics of Markov Automata |
115
Voted
RTSS
1999
IEEE
15 years 6 months ago
1999
IEEE
This paper presents a process algebra for specifying soft real-time constraints in a compositional way. For these soft constraints we take a stochastic point of view and allow arb...
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...
111
click to vote
CONCUR
2009
Springer
15 years 8 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). ...
104
click to vote
FORMATS
2007
Springer
15 years 8 months ago
2007
Springer
Timed automata were introduced by Alur and Dill in the early 1990s and have since become the most prominent modelling formalism for real-time systems. A fundamental limit to the al...
101
click to vote
POPL
2010
ACM
15 years 11 months ago
2010
ACM
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...