Abstraction, Refinement and Proof for Probabilistic Systems

By Annabelle McIver, Carroll Morgan. Monographs in Computer Science, 2004

477 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/8479baefc00075e9d29a14006438b0b3ba77c63f

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Joost-Pieter Katoen
2. Sebastian Junges
3. Christian Dehnert
4. Matthias Volk

In Computer Networks and Communications

1. Joost-Pieter Katoen
2. Sebastian Junges
3. Christian Dehnert
4. Matthias Volk

Citations in the corpus

• A Program Logic for Union Bounds (2016, unknown): “Morgan et al. [34] (see McIver and Morgan [31] for an extended account) propose a verification method based on computing greatest pre-expectations , a probabilistic analogue of Dijkstra’s weakest pre-conditions.”
• A Storm is Coming: A Modern Probabilistic Model Checker (2017, methodology): “Storm supports various symbolic and an explicit input format to specify the aforementioned model types: (i) Most prominently, the Prism input language [15]; (ii) the recently defined JANI format [16], a universal probabilistic modeling language; (iii) as the first tool every(1) generalized stochasti”