Fast algorithms for finding randomized strategies in game trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Verifying Abstractions of Timed Systems
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Assume-Guarantee Reasoning for Hierarchical Hybrid Systems
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Proofs of Networks of Processes
IEEE Transactions on Software Engineering
Reachability in Stochastic Timed Games
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Compositional Abstraction for Stochastic Systems
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Three-valued abstraction for continuous-time Markov chains
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Numerical analysis of continuous time Markov decision processes over finite horizons
Computers and Operations Research
The complexity of partial-observation parity games
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
The ins and outs of the probabilistic model checker MRMC
Performance Evaluation
The how and why of interactive Markov chains
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Towards Supervisory Control of Interactive Markov Chains: Controllability
ACSD '11 Proceedings of the 2011 Eleventh International Conference on Application of Concurrency to System Design
Game-based Abstraction and Controller Synthesis for Probabilistic Hybrid Systems
QEST '11 Proceedings of the 2011 Eighth International Conference on Quantitative Evaluation of SysTems
Discrete-Time Verification and Control for Probabilistic Rectangular Hybrid Automata
QEST '11 Proceedings of the 2011 Eighth International Conference on Quantitative Evaluation of SysTems
Model checking interactive markov chains
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Quantitative timed analysis of interactive markov chains
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Formal correctness, safety, dependability, and performance analysis of a satellite
Proceedings of the 34th International Conference on Software Engineering
| Hi-index | 0.00 |
Interactive Markov chains (IMC) are compositional behavioural models extending labelled transition systems and continuous-time Markov chains. We provide a framework and algorithms for compositional verification and optimization of IMC with respect to time-bounded properties. Firstly, we give a specification formalism for IMC. Secondly, given a time-bounded property, an IMC component and the assumption that its unknown environment satisfies a given specification, we synthesize a scheduler for the component optimizing the probability that the property is satisfied in any such environment.