Monographs in Computer Science - Abstraction, Refinement and Proof for Probabilistic Systems
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer-Verlag

0387401156

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Probabilistic data refinement: The steam boiler

Monographs in Computer Science - Abstraction, Refinement and Proof for Probabilistic Systems ◽

10.1007/0-387-27006-x_4 ◽

2005 ◽

pp. 107-125

Keyword(s):

Steam Boiler ◽

Data Refinement ◽

Probabilistic Data

Download Full-text

Case studies in termination: Choice coordination, the dining philosophers, and the random walk

Monographs in Computer Science - Abstraction, Refinement and Proof for Probabilistic Systems ◽

10.1007/0-387-27006-x_3 ◽

2005 ◽

pp. 79-106

Keyword(s):

Random Walk ◽

Case Studies ◽

Dining Philosophers

Download Full-text

Infinite state spaces, angelic choice and the transformer hierarchy

Monographs in Computer Science - Abstraction, Refinement and Proof for Probabilistic Systems ◽

10.1007/0-387-27006-x_8 ◽

2005 ◽

pp. 217-242

Keyword(s):

State Spaces ◽

Infinite State

Download Full-text

The geometry of probabilistic programs

Monographs in Computer Science - Abstraction, Refinement and Proof for Probabilistic Systems ◽

10.1007/0-387-27006-x_6 ◽

2005 ◽

pp. 165-180

Keyword(s):

Probabilistic Programs

Download Full-text

Theory for the demonic model

Monographs in Computer Science - Abstraction, Refinement and Proof for Probabilistic Systems ◽

10.1007/0-387-27006-x_5 ◽

2005 ◽

pp. 129-164

Keyword(s):

The Demonic

Download Full-text

Probabilistic loops: Invariants and variants

Monographs in Computer Science - Abstraction, Refinement and Proof for Probabilistic Systems ◽

10.1007/0-387-27006-x_2 ◽

2005 ◽

pp. 37-78

Download Full-text

Introduction to pGCL: Its logic and its model

Monographs in Computer Science - Abstraction, Refinement and Proof for Probabilistic Systems ◽

10.1007/0-387-27006-x_1 ◽

2005 ◽

pp. 3-36

Download Full-text

Proved rules for probabilistic loops

Monographs in Computer Science - Abstraction, Refinement and Proof for Probabilistic Systems ◽

10.1007/0-387-27006-x_7 ◽

2005 ◽

pp. 181-216

Download Full-text

Quantitative temporal logic: An introduction

Monographs in Computer Science - Abstraction, Refinement and Proof for Probabilistic Systems ◽

10.1007/0-387-27006-x_9 ◽

2005 ◽

pp. 245-263

Keyword(s):

Temporal Logic

Download Full-text

The quantitative algebra of qTL

Monographs in Computer Science - Abstraction, Refinement and Proof for Probabilistic Systems ◽

10.1007/0-387-27006-x_10 ◽

2005 ◽

pp. 265-291

Download Full-text

Monographs in Computer Science - Abstraction, Refinement and Proof for Probabilistic SystemsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer-Verlag

Probabilistic data refinement: The steam boiler

Case studies in termination: Choice coordination, the dining philosophers, and the random walk

Infinite state spaces, angelic choice and the transformer hierarchy

The geometry of probabilistic programs

Theory for the demonic model

Probabilistic loops: Invariants and variants

Introduction to pGCL: Its logic and its model

Proved rules for probabilistic loops

Quantitative temporal logic: An introduction

The quantitative algebra of qTL

Monographs in Computer Science - Abstraction, Refinement and Proof for Probabilistic Systems
Latest Publications