321 search results - page 37 / 65 » Symbolic Model Checking for Probabilistic Timed Automata |
133
click to vote
COLT
1994
Springer
15 years 8 months ago
1994
Springer
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...
138
click to vote
ATVA
2006
Springer
15 years 7 months ago
2006
Springer
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques (e.g. model checking and theorem proving) have been proposed to model a real-ti...
162
click to vote
CAV
2012
Springer
13 years 6 months ago
2012
Springer
Real-life systems are usually hard to control, due to their complicated structures, quantitative time factors and even stochastic behaviors. In this work, we present a model checke...
143
click to vote
WEA
2005
Springer
15 years 9 months ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
141
click to vote
ICFEM
2009
Springer
15 years 10 months ago
2009
Springer
Internet protocols encapsulate a significant amount of state, making implementing the host software complex. In this paper, we define the Statecall Policy Language (SPL) which pr...