321 search results - page 46 / 65 » Symbolic Model Checking for Probabilistic Timed Automata |
ISI
2006
Springer
13 years 7 months ago
2006
Springer
Security of civil aviation has become a major concern in recent years, leading to a variety of protective measures related to airport and aircraft security to be established by re...
BIRTHDAY
2008
Springer
13 years 9 months ago
2008
Springer
We use History Dependent Automata (HD-automata) as a syntax-indepentend formalism to check compatibility of services at binding time in Service-Oriented Computing. Informally speak...
ICFEM
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
ISOLA
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. Regular expressions and their extensions have become a major component of industry-standard specification languages such as PSL/Sugar ([2]). The model checking procedure...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
In probabilistic grammatical inference, a usual goal is to infer a good approximation of an unknown distribution P called a stochastic language. The estimate of P stands in some cl...