Christel Baier
Joost Pieter Katoen
2008
Principles of Model Checking
The MIT Press
Andrea Bianco
Luca de Alfaro
1995
Model Checking of Probabilistic and Nondeterministic Systems
Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science
1026
Springer-Verlag
499–513
10.1007/3-540-60692-0_70
Lenore Blum
Mike Shub
Steve Smale
1989
On a Theory of Computation and Complexity over the Real Numbers: NP-completeness, Recursive Functions and Universal Machines
Bulletin of the AMS
21
1
10.1109/SFCS.1988.21955
Rance Cleaveland
S. Purushothaman Iyer
Muralidhar Narasimha
1999
Probabilistic Temporal Logics via the Modal mu-Calculus
Foundations of Software Science and Computation Structures
10.1007/3-540-49019-1_20
Luca de Alfaro
Rupak Majumdar
2004
Quantitative Solution of omega-Regular Games
Journal of Computer and System Sciences, Volume 68, Issue 2
374 – 397
10.1016/j.jcss.2003.07.009
Benoit Delahaye
Joost Pieter Katoen
Kim Larsen
Axel Legay
Mikkel Pedersen
Falak Sher
Andrzej Wasowski
2011
Abstract Probabilistic Automata
Proc. of 12th VMCAI
10.1007/978-3-642-18275-4_23
Yuxin Deng
Rob van Glabbeek
2010
Characterising Probabilistic Processes Logically
Logic for programming, artificial intelligence and reasoning
Lecture Notes in Computer Science
6397
10.1007/978-3-642-16242-8_20
Jeanne Ferrante
Charles Rackoff
1975
A Decision Procedure for the First Order Theory of Real Addition with Order
SIAM Journal of Computing
4
1
69–76
10.1137/0204006
Vojtěch Forejt
Marta Kwiatkowska
Gethin Norman
David Parker
Hongyang Qu
2011
Quantitative multi-Objective Verification for Probabilistic Systems
Proc. of 14th TACAS
10.1007/978-3-642-19835-9_11
Thomas Martin Galwitza
Helmut Seidl
2011
Solving Systems of Rational Equations through Strategy Iteration
ACM Trabnsactions on Programming Languages and Systems
33
3
10.1145/1961204.1961207
Petr Hájek
2001
Metamathematics of Fuzzy Logic
Springer
Michael Huth
Marta Kwiatkowska
1997
Quantitative Analysis and Model Checking
Proceeding of the 12th Annual IEEE Symposium on Logic in Computer Science
Michael Huth
Nir Piterman
Daniel Wagner
2012
p-Automata: New Foundations for discrete-time Probabilistic Verification
Perform. Eval.
69
7-8
10.1016/j.peva.2012.05.005
David Janin
Igor Walukiewicz
1996
On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic
Lecture Notes in Computer Science
1119
263–277
10.1007/3-540-61604-7_60
D. Kozen
1983
Results on the Propositional mu-Calculus
Theoretical Computer Science
333–354
10.1016/0304-3975(82)90125-6
Marta Kwiatkowska
Gethin Norman
David Parker
Hongyang Qu
2010
Assume-Guarantee Verification for Probabilistic Systems
Proceedings of 16th TACAS
10.1007/978-3-642-12002-2_3
Angelika Mader
1995
Modal μ-Calculus, Model Checking and GaußElimination
Tools and Algorithms for the Construction and Analysis of Systems (TACAS)
LNCS
1019
72–88
10.1007/3-540-60630-0_4
Annabelle McIver
Carroll Morgan
2007
Results on the Quantitative μ-Calculus qMμ
ACM Transactions on Computational Logic
8
1
10.1145/1182613.1182616
Matteo Mio
2012
Game Semantics for Probabilistic μ-Calculi
School of Informatics, University of Edinburgh
Permanent URL: http://hdl.handle.net/1842/6223
Matteo Mio
2012
On The Equivalence of Denotational and Game Semantics for the Probabilistic μ-Calculus
Logical Methods in Computer Science
8
2
10.2168/LMCS-8(2:7)2012
Matteo Mio
2012
Probabilistic Modal μ-Calculus with Independent Product
Logical Methods in Computer Science
8
4
10.2168/LMCS-8(4:18)2012
Carroll Morgan
Annabelle McIver
1997
A Probabilistic Temporal Calculus Based on Expectations
In Lindsay Groves and Steve Reeves, editors, Proc. Formal Methods
Springer Verlag
Roberto Segala
1995
Modeling and Verification of Randomized Distributed Real-Time Systems
Laboratory for Computer Science, M.I.T.
Colin Stirling
2001
Modal and Temporal Logics for Processes
Springer
10.1007/3-540-60915-6_5