Switched probabilistic i/o automata

Authors:
Ling Cheung;Nancy Lynch;Roberto Segala;Frits Vaandrager
Affiliations:
Nijmegen Institute for Computing and Information Sciences, University of Nijmegen, Nijmegen, The Netherlands;MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA;Dipartimento di Informatica, Università di Verona, Verona, Italy;Nijmegen Institute for Computing and Information Sciences, University of Nijmegen, Nijmegen, The Netherlands
Venue:
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Year:
2004

Citing 9
Cited 7

Proving time bounds for randomized distributed algorithms

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Modeling and verification of randomized distributed real-time systems

Modeling and verification of randomized distributed real-time systems
A probabilistic poly-time framework for protocol analysis

CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Compositional Methods for Probabilistic Systems

CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Root Contention in IEEE 1394

ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Composition and Behaviors of Probabilistic I/O Automata

CONCUR '94 Proceedings of the Concurrency Theory
Universally Composable Security: A New Paradigm for Cryptographic Protocols

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Time Optimal Self-Stabilizing Spanning Tree Algorithms

Time Optimal Self-Stabilizing Spanning Tree Algorithms
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study

Distributed Computing

Switched PIOA: parallel composition via distributed scheduling

Theoretical Computer Science - Components and objects
Time-bounded reachability in distributed input/output interactive probabilistic chains

SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Automated learning of probabilistic assumptions for compositional reasoning

FASE'11/ETAPS'11 Proceedings of the 14th international conference on Fundamental approaches to software engineering: part of the joint European conferences on theory and practice of software
Probability and nondeterminism in operational models of concurrency

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Assume-Guarantee verification for probabilistic systems

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
From software verification to `everyware' verification

Computer Science - Research and Development
Compositional probabilistic verification through multi-objective model checking

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A switched probabilistic I/O automaton is a special kind of probabilistic I/O automaton (PIOA), enriched with an explicit mechanism to exchange control with its environment. Every closed system of switched automata satisfies the key property that, in any reachable state, at most one component automaton is active. We define a trace-based semantics for switched PIOAs and prove it is compositional. We also propose switch extensions of an arbitrary PIOA and use these extensions to define a new trace-based semantics for PIOAs.