Partial Order Reduction for Probabilistic Branching Time

Christel Baier Pedro R. D'Argenio Marcus Grober 2006 Partial Order Reduction for Probabilistic Branching Time Electr. Notes Theor. Comput. Sci. 153 2 97–116 10.1016/j.entcs.2005.10.034 Christel Baier Boudewijn R. Haverkort Holger Hermanns Joost-Pieter Katoen 2003 Model-Checking Algorithms for Continuous-Time Markov Chains IEEE Transactions on Software Engineering. IEEE CS 29 6 524–541 10.1109/TSE.2003.1205180 Girish Bhat Rance Cleaveland Orna Grumberg 1995 Efficient On-the-Fly Model Checking for CTL* LICS IEEE Computer Society 388–397 10.1109/LICS.1995.523273 Edmund M. Clarke E. A. Emerson A. P. Sistla 1986 Automatic verification of finite-state concurrent systems using temporal logic specifications ACM Trans. Program. Lang. Syst. 8 2 244–263 10.1145/5397.5399 Costas Courcoubetis Moshe Y. Vardi Pierre Wolper Mihalis Yannakakis 1992 Memory-efficient algorithms for the verification of temporal properties Form. Methods Syst. Des. 1 2-3 275–288 10.1007/BF00121128 Alvaro Fernandez-Diaz Christel Baier Clara Benac-Earle Lars-Ake Fredlund 2012 Static Partial Order Reduction for Probabilistic Concurrent Systems QEST 2012 0 104–113 10.1109/QEST.2012.22 Stefania Gnesi Franco Mazzanti 2011 An Abstract, on the Fly Framework for the Verification of Service-Oriented Systems Martin Wirsing Matthias M. Hölzl Results of the SENSORIA Project LNCS 6582 Springer 390–407 10.1007/978-3-642-20401-2_18 Ernst Moritz Hahn Holger Hermanns Björn Wachter Lijun Zhang 2009 Time-Bounded Model Checking of Infinite-State Continuous-Time Markov Chains Fundam. Inform. 95 1 129–155 10.3233/FI-2009-145 Hans Hansson Bengt Jonsson 1994 A Logic for Reasoning about Time and Reliability Formal Aspects of Computing 6 512–535 10.1007/BF01211866 Ted Herman 1990 Probabilistic Self-Stabilization Inf. Process. Lett. 35 2 63–67 10.1016/0020-0190(90)90107-9 Gerard J. Holzmann 2004 The SPIN Model Checker - primer and reference manual Addison-Wesley J. G. Kemeny J. L. Snell A. W. Knapp 1976 Denumerable Markov Chains Springer-Verlag

New York, USA

10.1007/978-1-4684-9455-6 Marta Z. Kwiatkowska Gethin Norman David Parker 2004 Probabilistic symbolic model checking with PRISM: a hybrid approach STTT 6 2 128–142 10.1007/s10009-004-0140-2 Diego Latella Michele Loreti Mieke Massink 2013 On-the-fly Fast Mean-Field Model-Checking Martín Abadi Alberto Lluch-Lafuente Trustworthy Global Computing - 8th International Symposium, TGC 2013, Buenos Aires, Argentina, August 30-31, 2013, Revised Selected Papers Lecture Notes in Computer Science 8358 Springer 297–314 10.1007/978-3-319-05119-2_17 Diego Latella Michele Loreti Mieke Massink 2013 On-the-fly PCTL Fast Mean-Field Model-Checking for Self-organising Coordination - Preliminary Version Technical Report TR-QC-01-2013 Quanticol Technical Report Available on-line at http://www.quanticol.eu Jean-Yves Le Boudec David McDonald Jochen Mundinger 2007 A Generic Mean Field Convergence Result for Systems of Interacting Objects QEST07 IEEE Computer Society Press 3–18 10.1109/QEST.2007.3 ISBN 978-0-7695-2883-0 Giuseppe Della Penna Benedetto Intrigila Igor Melatti Enrico Tronci Marisa Venturini Zilli 2006 Finite horizon analysis of Markov Chains with the Murphi verifier STTT 8 4-5 397–409 10.1007/s10009-005-0216-7 Amir Pnueli 1977 The temporal logic of programs SFCS '77: Proceedings of the 18th Annual Symposium on Foundations of Computer Science (SFCS 1977) IEEE Computer Society

Washington, DC, USA

46–57 10.1109/SFCS.1977.32 Kristin Y. Rozier Moshe Y. Vardi 2010 LTL satisfiability checking STTT 12 2 123–137 10.1007/s10009-010-0140-3 Håkan L. S. Younes Marta Z. Kwiatkowska Gethin Norman David Parker 2004 Numerical vs. Statistical Probabilistic Model Checking: An Empirical Study K. Jensen A. Podelski Proc. 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'04) LNCS 2988 Springer 46–60 10.1007/978-3-540-24730-2_4