CS 780 Reading Assignments and Literature list

**Multiple paradigms – common labeled transition system underneath**

[1] D. D. Deavours, G. Clark, T. Courtney, D. Daly, S. Derisavi, J. M. Doyle, W. H. Sanders, and P. G. Webster. The Möbius Framework and Its Implementation. IEEE Transactions on Software Engineering vol. 28, no. 10, October 2002, pp. 956-969.

**State space exploration**

[2] Gerard J. Holzmann. An improved protocol reachability analysis technique. Software - Practice and Experience, 18(2):137-161, February 1988.

[3] W.J. Knottenbelt, P.G. Harrison, M.A. Mestern and P.S. Kritzinger. A Probabilistic Dynamic Technique for the Distributed Generation of Very Large State Spaces. Performance Evaluation Journal, Volume 39, Issue 1-4, February 2000, pp. 127-148.

[4] P. Kemper. Reachability analysis based on structured representations

In Proc. 17th International Conference Application and Theory of Petri Nets, Osaka (JP), June 1996, Springer, LNCS 1091, pp. 269 - 288, 1996.

[5] P. Buchholz and P. Kemper.

Efficient Computation and Representation of Large Reachability Sets for Composed Automata. Journal on Discrete Event Dynamic Systems: Theory and Applications, 12 (3), pp. 265-286, Kluwer, 2002.

[6] G. Ciardo. Reachability set generation for Petri nets: can brute force be smart? (Invited Talk). In Proc. 25th Int. Conf. on Applications and Theory of Petri Nets. , Bologna, Italy, pages 17-34, June 2004.

[7] A. Miner and G. Ciardo. Efficient reachability set generation and storage using decision diagrams. In H. Kleijn and S. Donatelli, editors, Application and Theory of Petri Nets 1999, Lecture Notes in Computer Science 1639, Springer-Verlag.

[8] A. Miner and D. Parker.

Symbolic Representations and Analysis of Large Probabilistic Systems. In Validation of Stochastic Systems: A Guide to Current Research, volume 2925 of Lecture Notes in Computer Science.

August 2004.

**Weighted Automata**

[9] P. Buchholz. Bisimulation Relations for Weighted Automata. To appear in Theoretical Computer Science (accessible via sciencedirect).

[10] P. Buchholz, P. Kemper. Weak Bisimulation for (max/+)-Automata and Related Models. Journal of Automata, Languages and Combinatorics (2003) 8 (2), 187-218.

[11] P. Buchholz, P. Kemper. Quantifying the Dynamic Behavior of Process Algebras. In: L. de Alfaro, S. Gilmore (eds.). Process Algebras and Probabilistic Methods. Springer LNCS 2165 (2001) 184-199.

[12] P. Buchholz, P. Kemper. Model Checking for Automata with Transition Costs. (submitted for publication).

[13] S. Derisavi, P. Kemper, W. H. Sanders, and T. Courtney. The Möbius State-level Abstract Functional Interface.

Performance Evaluation, vol. 54, no. 2, October 2003, pp. 105-128.

[14] François Baccelli, Guy Cohen, Geert Jan Olsder, Jean-Pierre Quadrat, Synchronization and Linearity (online version), Wiley, 1992, ISBN 0 471 93609 X.

**Bisimulation**

[15] R. Milner, Communication and Concurrency, Prentice Hall, 1989.

[16] R. Paige and R.E. Tarjan. Three Partition Refinement Algorithms. SIAM J. Comput. 16(6):973-989, 1987.

[17] S. Derisavi. Solution of Large Markov Models Using Lumping Techniques and Symbolic Data Structures. Doctoral Dissertation, University of Illinois, 2005.

[18] S. Derisavi, H. Hermanns, W.H.Sanders. Optimal State-Space Lumping in Markov Chains. Information Processing Letters, vol. 87, no. 6, September 30, 2003, pp. 309-315.

[19] S. Derisavi. A symbolic algorithm for optimal Markov chain lumping.

Proceedings of the 13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS ‘07), Portugal, March 24-April 1, 2007, pp. 139-154

[20] S. Derisavi, P. Kemper, and W. H. Sanders. Lumping Matrix Diagram Representations of Markovian Models.

Proceedings of the International Conference on Dependable Systems and Networks (DSN), Yokohama, Japan, June 28 - July 1,2005, pp. 742-751.

[21] S. Derisavi. A signature-based algorithm for optimal Markov chain lumping

Proceedings of the 4th International Conference on the Quantitative Evaluation of Systems (QEST) 2007, Edinburgh, Scotland, Sept. 16-19.

**Model Checking**

[22] E. Clarke, O. Grumberg, D. Peled. Model Checking, MIT Press, 1999.

[23] P. Buchholz, J.-P. Katoen, P. Kemper, and C. Tepper. Model-checking large structured Markov chains.

Journal of Logic and Algebraic Programming, special issue on Probabilistic Techniques for the Design and Analysis of Systems, 56, (1/2), 69-97, 2003