Efficient lumpability check in partially symmetric systems

Third International Conference on the Quantitative Evaluation of Systems, QEST 2006

Volumn , Issue , 2006, Pages 211-220

  Beccuti, M ^a   Franceschinis, G ^a   Baarir, S ^b   Ilie J M ^b  

^a UNIVERSITY OF EASTERN PIEDMONT   (Italy)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONTINUOUS TIME SYSTEMS; GRAPH THEORY; MARKOV PROCESSES; MODEL CHECKING; SYSTEMS ANALYSIS;

PARTIALLY SYMMETRIC SYSTEMS; PERFORMANCE ANALYSIS; STATE SPACE EXPLOSION; STOCHASTIC WELL-FORMED NET (SWN) FORMALISM;

STOCHASTIC MODELS;

EID: 41149158111     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QEST.2006.17     Document Type: Conference Paper

References (13)

1. G. Chiola, C. Dutheillet, G. Franceschinis, S. Haddad: Stochastic Well-formed Coloured nets for symmetric modelling applications. IEEE Transactions on Computers 42 (1993) (11): 1343-1360
2. G. Chiola, C. Dutheillet, G. Franceschinis, S. Haddad: A Symbolic Reachability Graph for Coloured Petri Nets. Theor. Comput. Sci. B (Logic, semantics and theory of programming) 176 (1997) (1,2): 39-65
3. S.Haddad,J.M Ilié, M. Taghelit, B. Zouari: Symbolic Reachability Graph and Partial Symmetries. Sixteenth International Conference on Application and Theory of Petri Nets. Turin, Italy. June 1995. Lecture Note in Computer Science 935 (1995) 238-251
4. L. Capra, C. Dutheillet, G. Franceschinis, J-M. Ilié: Exploiting Partial Symmetries for Markov Chain Aggregation. Electronic Notes In Theoretical Computer Science 39 (3) (2000)
5. S. Derisavi, H. Hermanns, W. H. Sanders: Optimal State-Space Lumping in Markov Chains. Information Processing Letters 87 n.6 (2003) 309-315
6. P Buchholz: Exact and ordinary lumpability in finite Markov Chains. Journal of Appl. Prob. 31 (1994) 59-75
7. R. Paige, R. E. Tarjan: Three partition refinement algorithms. SIAM J. Comput. 16 (6) (1987) 973-989
8. P Buchholz: Efficient computation of equivalent and reduced representations for stochastic automata. Internat. J. Comput. Systems Sci. Eng. 15(2) (2000) 93-103
9. M. Bernardo, R. Gorrieri: A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities and time. Theor. Comput. Sci. 202 (1998) 1-54
10. H. Hermanns, M. Siegle: Bisimulation algorithms for stochastic process algebras and their BDD-based implementation. In: ARTS '99: Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems, London, UK, Springer-Verlag (1999) 244-264
11. L. Capra: Exploiting partial symmetries in SWN model. PhD thesis, Universita degli Studi di Torino, Torino, Italia (2001) Ph.D. Thesis.
12. Baarir S., Dutheillet C., Haddad S., Ilié J-M.: On the use of exact lumpability in partially symmetrical wellformed nets. In: proc of the 2nd international Conference on the Quantitative Evaluation of Systems, Torino - Italy, IEEE CS. press (2005) 23-32
13. Baarir S., Haddad S., J-M. Ilié: Exploiting partial symmetries in well-formed nets for the reachability and the linear time model checking problems. In: proceedings of the 7th Workshop on Discrete Event Systems (WODES'04), Reims, France (2004) 223-228