Understanding Z: a specification language and its formal semantics
Understanding Z: a specification language and its formal semantics
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Probabilistic predicate transformers
ACM Transactions on Programming Languages and Systems (TOPLAS)
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Competitive Markov decision processes
Competitive Markov decision processes
It Usually Works: The Temporal Logic of Stochastic Systems
Proceedings of the 7th International Conference on Computer Aided Verification
Model checking for probability and time: from theory to practice
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Cost Analysis of Games, Using Program Logic
APSEC '01 Proceedings of the Eighth Asia-Pacific on Software Engineering Conference
Probabilistic symbolic model checking with PRISM: a hybrid approach
International Journal on Software Tools for Technology Transfer (STTT) - Special section on tools and algorithms for the construction and analysis of systems
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Results on the quantitative μ-calculus qMμ
ACM Transactions on Computational Logic (TOCL)
Quantitative µ-calculus analysis of power management in wireless networks
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |
In Formal Methods we use mathematical structures to model real systems we want to build, or to reason about; in this paper we are concerned principally with game-based models. In an earlier work [Morgan, C. and A. McIver, Cost analysis of games using program logic, in: Proc. of the 8th Asia-Pacific Software Engineering Conference (APSEC 2001), 2001, abstract only: full text available at [13, key MDP01].] we presented an approach to stochastic minimising games based on our logic for probabilistic programs [Morgan, C., A. McIver and K. Seidel, Probabilistic predicate transformers, ACM Transactions on Programming Languages and Systems 18 (1996) 325-53, doi.acm.org/10.1145/229542.229547, McIver, A. and C. Morgan, Abstraction, Refinement and Proof for Probabilistic Systems, Technical Monographs in Computer Science, Springer Verlag, New York, 2004]. The contribution here is to extend our logical approach to maximising games. That maximising and minimising are not (simply) duals is due to the use of least fixed-points in both cases, as is normal for iterating programs. (For duality, we would have to use greatest fixed-points in the maximising case.) The significance of that extension is that it makes a further link between the program-logical approach and the more general methods for finding control strategies that ''solve'' games of this kind, in the sense of giving the player a ''recipe'' which, if followed, will deliver the theoretically optimal result.