Switched PIOA: parallel composition via distributed scheduling

DOI10.1016/j.tcs.2006.07.033zbMath1118.68038OpenAlexW2099863033MaRDI QIDQ854167

Nancy A. Lynch, Ling Cheung, Roberto Segala, Frits W. Vaandrager

Publication date: 7 December 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2066/35322

zbMATH Keywords

compositionalitydistributed schedulingparallel compositionswitched probabilistic input/output automatatrace-style semantics

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (10)

Compositional strategy synthesis for stochastic games with multiple objectives ⋮ Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers ⋮ Abstract probabilistic automata ⋮ Using schedulers to test probabilistic distributed systems ⋮ Probabilistic may/must testing: retaining probabilities by restricted schedulers ⋮ Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms ⋮ Task-structured probabilistic I/O automata ⋮ Specification Theories for Probabilistic and Real-Time Systems ⋮ Abstract Probabilistic Automata ⋮ Distributed Synthesis in Continuous Time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bisimulation through probabilistic testing
• Reactive, generative, and stratified models of probabilistic processes
• Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler
• Bisimulation for labelled Markov processes
• Polylog randomized wait-free consensus
• Wait-free synchronization in multiprogrammed systems
• A testing scenario for probabilistic processes
• Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
• Randomized protocols for asynchronous consensus
• Fast deterministic consensus in a noisy environment
• Validation of Stochastic Systems
• Proving time bounds for randomized distributed algorithms
• Theoretical Aspects of Computing - ICTAC 2004
• CONCUR 2003 - Concurrency Theory
• Theory of Cryptography

This page was built for publication: Switched PIOA: parallel composition via distributed scheduling