Sciweavers

3218 search results - page 64 / 644
» Timed Extensions for SDL
Sort
View
JLP
2010
105views more  JLP 2010»
13 years 4 months ago
Quantitative analysis of weighted transition systems
We present a general framework for the analysis of quantitative and qualitative properties of reactive systems, based on a notion of weighted transition systems. We introduce and ...
Claus R. Thrane, Uli Fahrenberg, Kim G. Larsen
JMLR
2012
12 years 13 days ago
SpeedBoost: Anytime Prediction with Uniform Near-Optimality
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...
Alexander Grubb, Drew Bagnell
IANDC
2007
127views more  IANDC 2007»
13 years 10 months ago
Temporal logics with incommensurable distances are undecidable
Temporal logic based on the two modalities “Since” and “Until” (TL) is the most popular logic for the specification of reactive systems. It is often called the linear tim...
Alexander Rabinovich
SOFSEM
2009
Springer
14 years 6 months ago
Symbolic Reachability Analysis of Integer Timed Petri Nets
Petri nets are an effective formalism to model discrete event systems, and several variants have been defined to explicitly include real time in the model. We consider two fundam...
Min Wan, Gianfranco Ciardo
CONCUR
2009
Springer
14 years 4 months ago
Concavely-Priced Probabilistic Timed Automata
Abstract. Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, ...
Marcin Jurdzinski, Marta Z. Kwiatkowska, Gethin No...