FSTTCS 2006 - PDF Preprint Papers

FSTTCS 2006 Foundations of Software Technology and Theoretical Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FSTTCS-2006 Paper

click to vote

FSTTCS
2006
Springer

149views Software Engineering» more FSTTCS 2006»

Testing Probabilistic Equivalence Through Reinforcement Learning

14 years 3 months ago

Download www2.ift.ulaval.ca

We propose a new approach to verification of probabilistic processes for which the model may not be available. We use a technique from Reinforcement Learning to approximate how far...

Josee Desharnais, François Laviolette, Sami...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Related Conferences

Id	Views	Title	Status

1	149	Testing Probabilistic Equivalence Through Reinforcement Learning	claim
2	149	Approximation Algorithms for 2-Stage Stochastic Optimization Problems	claim
3	143	Multi-stack Boundary Labeling Problems	claim
4	131	Game Semantics for Higher-Order Concurrency	claim
5	126	Almost Optimal Strategies in One Clock Priced Timed Games	claim
6	126	Context-Sensitive Dependency Pairs	claim
7	121	Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems	claim
8	117	On Decidability of LTL Model Checking for Process Rewrite Systems	claim
9	117	Computing a Center-Transversal Line	claim
10	115	Monitoring of Real-Time Properties	claim
11	108	On Reduction Criteria for Probabilistic Reward Models	claim
12	106	Some Results on Average-Case Hardness Within the Polynomial Hierarchy	claim
13	105	Branching Pushdown Tree Automata	claim
14	101	The Anatomy of Innocence Revisited	claim
15	96	On Continuous Timed Automata with Input-Determined Guards	claim
16	92	Rational Behaviour and Strategy Construction in Infinite Multiplayer Games	claim
17	91	Tree Automata Make Ordinal Theory Easy	claim
18	89	Normal and Feature Approximations from Noisy Point Clouds	claim
19	88	Computationally Sound Symbolic Secrecy in the Presence of Hash Functions	claim
20	88	Validity Checking for Finite Automata over Linear Arithmetic Constraints	claim
21	85	Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance	claim
22	81	Coresets for Discrete Integration and Clustering	claim
23	79	Distributed Synthesis for Well-Connected Architectures	claim
24	79	The Meaning of Ordered SOS	claim
25	70	Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time	claim
26	70	Unbiased Rounding of Rational Matrices	claim
27	61	One-Input-Face MPCVP Is Hard for L, But in LogDCFL	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers