Sciweavers

9 search results - page 1 / 2
» On the numerical verification of probabilistic rewriting sys...
Sort
View
DATE
2006
IEEE
101views Hardware» more  DATE 2006»
13 years 11 months ago
On the numerical verification of probabilistic rewriting systems
Jounaïdi Ben Hassen, Sofiène Tahar
RTA
2005
Springer
13 years 10 months ago
Proving Positive Almost-Sure Termination
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...
Olivier Bournez, Florent Garnier
PAMI
2002
157views more  PAMI 2002»
13 years 4 months ago
Automatic Recognition of Handwritten Numerical Strings: A Recognition and Verification Strategy
A modular system to recognize handwritten numerical strings is proposed. It uses a segmentation-based recognition approach and a Recognition and Verification strategy. The approach...
Luiz E. Soares de Oliveira, Robert Sabourin, Fl&aa...
IANDC
2006
117views more  IANDC 2006»
13 years 4 months ago
Statistical probabilistic model checking with a focus on time-bounded properties
Probabilistic verification of continuous-time stochastic processes has received increasing attention in the model-checking community in the past five years, with a clear focus on ...
Håkan L. S. Younes, Reid G. Simmons
ICFEM
2007
Springer
13 years 8 months ago
Automating Refinement Checking in Probabilistic System Design
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...
Carlos Gonzalia, Annabelle McIver