Bisimulation through probabilistic testing
Information and Computation
Proving time bounds for randomized distributed algorithms
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Polylog randomized wait-free consensus
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Fast deterministic consensus in a noisy environment
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Verification of a Leader Election Protocol: Formal Methods Applied to IEEE 1394
Formal Methods in System Design
Performance of Computer Communication Systems: A Model-Based Approach
Performance of Computer Communication Systems: A Model-Based Approach
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Testing Probabilistic and Nondeterministic Processes
Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII
Computer-Assisted Simulation Proofs
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Composition and Behaviors of Probabilistic I/O Automata
CONCUR '94 Proceedings of the Concurrency Theory
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
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
Randomized protocols for asynchronous consensus
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
Distributed Computing
A testing scenario for probabilistic automata
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Switched probabilistic i/o automata
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Compositionality for Markov reward chains with fast and silent transitions
Performance Evaluation
Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
On the Expressive Power of Schedulers in Distributed Probabilistic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Quantitative model checking revisited: neither decidable nor approximable
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Composing systems while preserving probabilities
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
On model checking techniques for randomized distributed systems
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Abstract probabilistic automata
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Journal of the ACM (JACM)
Retaining the probabilities in probabilistic testing theory
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Probabilistic CSP: preserving the laws via restricted schedulers
MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Probabilistic automata and probabilistic logic
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Verification of partial-information probabilistic systems using counterexample-guided refinements
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Taming confusion for modeling and implementing probabilistic concurrent systems
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Abstract Probabilistic Automata
Information and Computation
| Hi-index | 0.00 |
This paper presents the framework of switched probabilistic input/output automata (or switched PIOA), augmenting the original PIOA framework with an explicit control exchange mechanism. Using this mechanism, we model a network of processes passing a single token among them, so that the location of this token determines which process is scheduled to make the next move. This token structure therefore implements a distributed scheduling scheme: scheduling decisions are always made by the (unique) active component.Distributed scheduling allows us to draw a clear line between local and global nondeterministic choices. We then require that local nondeterministic choices are resolved using strictly local information. This eliminates unrealistic schedules that arise under the more common centralized scheduling scheme. As a result, we are able to prove that our trace-style semantics is compositional.