A quotient graph for asymmetric distributed systems

Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS

Volumn , Issue , 2004, Pages 560-568

  Bellettini, Carlo ^a   Capra, Lorenzo ^a  

^a Dip di Informatica e Comunicazione   (Italy)

Author keywords

Asymmetric systems; Colored Petri Nets; Quotient state spaces

Indexed keywords

ASYMMETRIC SYSTEMS; COLORED PETRI NETS; DISCRETE-EVENT SYSTEMS; QUOTIENT STATE-SPACES;

FUNCTIONS; GRAPH THEORY; MARKOV PROCESSES; MATHEMATICAL MODELS; PETRI NETS; PROBLEM SOLVING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 16244391798     PISSN: 15267539     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MASCOT.2004.1348313     Document Type: Conference Paper

References (12)

1. E.A. Emerson, R.J.Trefler, "From Asymmetry to Full Symmetry: New Techniques For Symmetry Reduction in Model Checking", In LNCS Proc of CHARME'99, Springer Verlag, Bad Herrenalb, Germany, sep 1999.
2. L. Capra, "Exploiting partial symmetries in SWN models", PhD Thesis, Turin University, Italy, 2001.
3. L. Capra, C. Dutheillet, G. Franceschinis and J.M. Ilie, "Towards Performance Analysis with Partially Symmetrical SWN", In Proc. 7th International Symposium on Modeling, Analysis and Simulation, College Park, MD, USA, October 1999 (also in Performance Evaluation Review, special issue on MAMA 2000).
4. L. Capra, C. Dutheillet, G. Franceschinis and J.M. Ilie, "Towards Performance Analysis with Partially Symmetrical SWN", In Proc. 7th International Symposium on Modeling, Analysis and Simulation, College Park, MD, USA, October 1999 (also in Performance Evaluation Review, special issue on MAMA 2000).
5. L. Capra, C. Dutheillet, G. Franceschinis and J.M. Ilie, "Exploiting Partial Symmetries for Lumping Markov Chains", In Proc. 1th Workshop on Models for Time Critical Systems - Satellite workshop of CONCUR2000, Pennsylvania State University, Pennsylvania, USA, August 2000 Electronic Notes in Theoretical Computer Science, Vol.39, N.3 (2000) http://www.elsevier.nl/locate/entcs/volume39.html
6. E. Chang, R. Roberts. "An Improved Algorithm for Decentralized Extrema-Finding in Circular Configurations of Processes", Communications of the ACM, 22(5): 281-283, may 1979.
7. G.Chiola, C.Dutheillet, G.Franceschinis, and S.Haddad, "On Well-Formed Coloured Nets and their Symbolic Reachability Graph", ICATPN 90, Paris, France, June 1990, Reprinted in High-Level Petri Nets. Theory and Application, K. Jensen and G. Rozenberg (editors), Springer Verlag, 1991.
8. G.Chiola, C.Dutheillet, G.Franceschinis, and S.Haddad, "On Well-Formed Coloured Nets and their Symbolic Reachability Graph", ICATPN 90, Paris, France, June 1990, Reprinted in High-Level Petri Nets. Theory and Application, K. Jensen and G. Rozenberg (editors), Springer Verlag, 1991.
9. G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad. "Stochastic well-formed coloured nets for sym metric modelling applications", IEEE Transactions on Computers, 42(11), pp. 1343-1360, November 1993.
10. G.Chiola, C.Dutheillet, G.Franceschinis, and S.Haddad, "A Symbolic Reachability Graph for Coloured Petri Nets", Theoretical Computer Science B (Logic, semantics and theory of programming), Vol. 176, n. 1&2, April 1997, pp. 39-65.
11. S. Haddad, JM. Ilie, M. Taghelit, B. Zouari "Symbolic Reachability Graph And Partial Symmetries", ICATPN 95, Turin, Italy, June 1995.
12. K. Jensen, G. Rozenberg editors, "High-Level Petri nets: Theory and Applications", Springer Verlag, 1991.