From partially to fully lumped markov chains in stochastic well formed petri nets

VALUETOOLS 2009 - 4th International Conference on Performance Evaluation Methodologies and Tools

Volumn , Issue , 2009, Pages

  Baarir, S ^a   Beccuti, M ^b   Dutheillet, C ^a   Franceschinis, G ^c  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^b UNIVERSITY OF TURIN   (Italy)

^c UNIVERSITY OF EASTERN PIEDMONT   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

MARKOV PROCESSES; PETRI NETS; STOCHASTIC SYSTEMS; TOOLS;

GENERIC FRAMEWORKS; NEW APPROACHES; ON DYNAMICS; STOCHASTIC WELL-FORMED NETS;

STOCHASTIC MODELS;

EID: 84897090160     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4108/ICST.VALUETOOLS2009.7733     Document Type: Conference Paper

References (15)

1. S. Baarir, M. Beccuti, D. Cerotti, M. De Pierro, S. Donatelli, and G. Franceschinis. The greatspn tool: recent enhancements. SIGMETRICS Perform. Eval. Rev., 36(4):4-9, 2009.
2. S. Baarir, M. Beccuti, C. Dutheillet, G. Franceschinis, and S. Haddad. Performance analysis of partially symmetric SWNs: efficiency characterization through some case studies. Technical Report TR-INF-2009-07-06-UNIPMN, Dip. di Informatica, Univ. del Piemonte Orientale, 2009. http://www.di.unipmn.it/index. php/technicalreport.php.
3. S. Baarir, C. Dutheillet, S. Haddad, and J.-M. Ilié. On the use of exact lumpability in partially symmetrical Well-formed Nets. In Proc. of the 2nd Int. Conference on the Quantitative Evaluation of Systems, pages 23-32, Torino - Italy, September 2005.
4. M. Beccuti, S. Baarir, G. Franceschinis, and J.-M. Ilié. Efficient lumpability check in partially symmetric systems. In Int. Conf. on Quantitative Evaluation of Systems, Riverside, CA, USA, Sept. 2006.
5. G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad. Stochastic well-formed coloured nets for symmetric modelling applications. IEEE Transactions on Computers, 42(11):1343-1360, November 1993.
6. E. A. Emerson and A. P. Sistla. Symmetry and Model Checking. Formal Methods and System Design, 9:307-309, 1996.
7. E. A. Emerson and R. J. Trefler. From asymmetry to full symmetry: New techniques for symmetry reduction in model checking. In CHARME, pages 142-156, 1999.
8. P. Huber, A. M. Jensen, L. O. Jepsen, and K. Jensen. Towards reachability trees for high-level Petri nets. In LNCS 188, pages 215-233. Springer-Verlag, 1985.
9. C. N. Ip and D. L. Dill. Better verification through symmetry. FMSD, 9(1/2):41-75, 1996.
10. J.G. Kemeny and J.L. Snell. Finite Markov Chains. VanNostrand, 1960.
11. R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM J. Comput., 16(6):973-989, 1987.
12. S.Haddad, J.M Ilié, M. Taghelit, and B. Zouari. Symbolic Reachability Graph and Partial Symmetries. 16th Int. Conference on Application and Theory of Petri Nets. Turin, Italy., 935:238-251, June 1995.
13. W.D. Obal II and W.H. Sanders. Measure-adaptive state-space construction. Performance Evaluation, 44(1-4):237-258, 2001.
14. W.H. Sanders and J.F. Meyer. Reduced base model construction methods for stochastic activity networks. IEEE Journal on Selected Areas in Communications, 9(1):25-36, 1991.
15. GreatSPN tool's web page. http://www.di.unito.it/-greatspn.