Sciweavers

321 search results - page 30 / 65
» Symbolic Model Checking for Probabilistic Timed Automata
Sort
View
SIGPRO
2008
136views more  SIGPRO 2008»
13 years 8 months ago
Estimation of slowly varying parameters in nonlinear systems via symbolic dynamic filtering
This paper introduces a novel method for real-time estimation of slowly varying parameters in nonlinear dynamical systems. The core concept is built upon the principles of symboli...
Venkatesh Rajagopalan, Subhadeep Chakraborty, Asok...
QEST
2006
IEEE
14 years 2 months ago
LiQuor: A tool for Qualitative and Quantitative Linear Time analysis of Reactive Systems
LiQuor is a tool for verifying probabilistic reactive systems modelled Probmela programs, which are terms of a probabilistic guarded command language with an operational semantics...
Frank Ciesinski, Christel Baier
TACAS
2007
Springer
110views Algorithms» more  TACAS 2007»
14 years 2 months ago
Counterexamples in Probabilistic Model Checking
This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...
Tingting Han, Joost-Pieter Katoen
COLT
1995
Springer
14 years 8 days ago
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
Dana Ron, Yoram Singer, Naftali Tishby
ENTCS
2002
91views more  ENTCS 2002»
13 years 8 months ago
Interval Duration Logic: Expressiveness and Decidability
We investigate a variant of dense-time Duration Calculus which permits model checking using timed/hybrid automata. We define a variant of the Duration Calculus, called Interval Du...
Paritosh K. Pandya