Modeling and verification of randomized distributed real-time systems

R Segala - 1996 - dspace.mit.edu
Modeling and Veri cation of Randomized Distributed Real-Time Systems Page 1 Modeling and
Veri cation of Randomized Distributed Real-Time Systems by Roberto Segala SM, Electrical …

[图书][B] Formal verification of probabilistic systems

L De Alfaro - 1998 - search.proquest.com
Methods for the formal verification and specification of systems are a critical tool for the
development of correct systems, and they have been applied to the design of hardware …

Probabilistic simulations for probabilistic processes

R Segala, N Lynch - Nordic Journal of Computing, 1995 - dl.acm.org
Several probabilistic simulation relations for probabili stic systems are defined and
evaluated according to two criteria: compositionality and preservation of" interesting" …

A compositional trace-based semantics for probabilistic automata

R Segala - International Conference on Concurrency Theory, 1995 - Springer
We extend the trace semantics for labeled transition systems to a randomized model of
concurrent computation. The main objective is to obtain a compositional semantics. The role …

Computing minimum and maximum reachability times in probabilistic systems

L De Alfaro - International Conference on Concurrency Theory, 1999 - Springer
A Markov decision process is a generalization of a Markov chain in which both probabilistic
and nondeterministic choice coexist. Given a Markov decision process with costs associated …

An overview of probabilistic process algebras and their equivalences

N López, M Núnez - Validation of Stochastic Systems: A Guide to Current …, 2004 - Springer
In order to describe probabilistic processes by means of a formal model, some
considerations have to be taken into account. In this paper we present some of the ideas …

Markovian models for performance and dependability evaluation

BR Haverkort - School organized by the European Educational Forum, 2000 - Springer
Markovian models have been used for about a century now for the evaluation of the
performance and dependability of computer and communication systems. In this paper, we …

[图书][B] Self-stabilizing vertex coloring of arbitrary graphs

M Gradinariu, S Tixeuil - 2000 - Citeseer
A self-stabilizing algorithm, regardless of the initial system state, converges in nite time to a
set of states that satisfy a legitimacy predicate without the need for explicit exception handler …

PoWerStore: Proofs of writing for efficient and robust storage

D Dobre, G Karame, W Li, M Majuntke, N Suri… - Proceedings of the …, 2013 - dl.acm.org
Existing Byzantine fault tolerant (BFT) storage solutions that achieve strong consistency and
high availability, are costly compared to solutions that tolerate simple crashes. This cost is …

Switched PIOA: Parallel composition via distributed scheduling

L Cheung, N Lynch, R Segala, F Vaandrager - Theoretical Computer …, 2006 - Elsevier
This paper presents the framework of switched probabilistic input/output automata (or
switched PIOA), augmenting the original PIOA framework with an explicit control exchange …