Distributed Synthesis in Continuous Time

DOI10.1007/978-3-662-49630-5_21zbMath1475.68207arXiv1601.01587OpenAlexW2964105520MaRDI QIDQ2811352

Holger Hermanns, Jan Krčál, Steen Vester

Publication date: 10 June 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.01587

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Distributed Synthesis in Continuous Time

Uses Software

• MRMC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Information tracking in games on graphs
• Interactive Markov chains. And the quest for quantified quality
• Switched PIOA: parallel composition via distributed scheduling
• Analyzing security protocols using time-bounded task-PIOAs
• Calculi for synchrony and asynchrony
• Composition and behaviors of probabilistic I/O automata
• Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms
• A theory of stochastic systems. I: Stochastic automata
• Distributed Synthesis in Continuous Time
• Compositional Verification and Optimization of Interactive Markov Chains
• The How and Why of Interactive Markov Chains
• Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
• Compositional Abstraction for Stochastic Systems
• A Theory of Communicating Sequential Processes
• Distributed Markov Chains
• Asynchronous Games over Tree Architectures
• Probabilistic ω-automata
• The Complexity of Decentralized Control of Markov Decision Processes

This page was built for publication: Distributed Synthesis in Continuous Time