What a structural world

Proceedings - 9th International Workshop on Petri Nets and Performance Models, PNPM 2001

Volumn , Issue , 2001, Pages 3-16

  Ciardo, Gianfranco ^a  

^a The College of William and Mary   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS; INDUSTRIAL RESEARCH; LINEAR ALGEBRA; MODEL CHECKING; NUMERICAL METHODS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

DISCRETE-STATE SYSTEMS; EXPLICIT METHOD; EXPLOSION PROBLEMS; IMPLICIT METHODS; KRONECKER; NUMBER OF STATE; STATE-SPACE; STATE-SPACE EXPLOSION; STATE-TO-STATE TRANSITION; STOCHASTIC PETRI NETS;

PETRI NETS;

EID: 12444315013     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PNPM.2001.953351     Document Type: Conference Paper

References (37)

1. M. Ajmone Marsan, G. Balbo, G. Ciardo, and G. Conte. A software tool for the automatic analysis of generalized stochastic Petri net models. In D. Potier, editor, Modelling Techniquesand Tools for Perfonnance Analysis, pages 155-170. INRIA, Elsevier Science Publishers B.V. (North-Holland), 1985.
2. M. Ajmone Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Franceschinis. Modelling with Generalized Stochastic Petri Nets. John Wiley & Sons, New York, 1995.
3. M. Bozga and O. Maler. On the representation of probabilities over structured domains. In N. Halbwachs and D. Peled, editors, Computer Aided Verification (CAV’99), volume 1633 of LNCS, pages 261-273, Trento, Italy, July 1999. Springer-Verlag.
4. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. Comp., 35(8):677-691, Aug. 1986.
5. R. E. Bryant. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Comp. Sum., 24(3):393-318, 1992.
6. P. Buchholz, G. Ciardo, S. Donatelli, and P. Kemper. Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models. INFORMS J. Comp., 12(3):203-222, Summer 2000.
7. P. Buchholz and P. Kemper. Numerical analysis of stochastic marked graphs. In Proc. 6th Int. Workshop on Petri Nets and Performance Models (PNPM’95), pages 32-41, Durham, NC, Oct. 1995. IEEE Comp. Soc. Press.
8. G. Chiola. GreatSPN Users’ Manual. Technical report, Dipartimento di Informatica, Universith degli Studi di Torino, Torino, Italy, 1987.
9. G. Chiola. Compiling techniques for the analysis of stochastic Petri nets. In Proc. 4th Int. Con$ on Modelling Techniques and Tools for Peformance Evaluation, pages 13-27, 1989.
10. G. Ciardo. Petri nets with marking-dependent arc multiplicity: properties and analysis. In R. Valette, editor, Application and Theory of Petri Nets 1994 (Proc. 15th Int. Con$ on Applications and Theory of Petri Nets, Zaragoza, Spain), Lecture Notes in Computer Science 815, pages 179-198. Springer-Verlag, June 1994.
11. G. Ciardo, A. Blakemore, P. E J. Chimento, J. K. Muppala, and K. S. Trivedi. Automated generation and analysis of Markov reward models using Stochastic Reward Nets. In C. Meyer and R. J. Plemmons, editors, Linear Algebra, Markov Chains, and Queueing Models, IMA Volumes in Mathematics and its Applications 48, pages 145-191. Springer-Verlag. 1993.
12. G. Ciardo et al. Symbolic model checking without bounds. In preparation.
13. G. Ciardo, G. Luettgen, and R. Siminiceanu. Efficient symbolic state-space construction for asynchronous systems. In M. Nielsen and D. Simpson, editors, Application and Theory of Petri Nets 2000 (Proc. 21th Int. Con$ on Applications and Theory of Petri Nets, Aarhus, Denmark), Lecture Notes in Computer Science 1825,pages 103-122. Springer-Verlag, June 2000.
14. G. Ciardo, G. Luettgen, and R. Siminiceanu. Saturation: an efficient iteration strategy for symbolic state space generation. In T. Margaria and W. Yi, editors, Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Lecture Notes in Computer Science 2031, pages 328-342, Genova, Italy, Apr. 2001. Springer-Verlag.
15. G. Ciardo and A. S. Miner. SMART Simulation and Markovian Analyzer for Reliability and Timing. In Proc. IEEE International Computer Performance and Dependability Symposium (IPDS’96),page 60, Urbana-Champaign, IL, USA, Sept. 1996. IEEE Comp. Soc. Press.
16. G. Ciardo and A. S. Miner. Storage alternatives for large structured state spaces. In R. Marie, B. Plateau, M. Calzarossa, and G. Rubino, editors, Proc. 9th Int. Con$ on Modelling Techniques and Tools for Computer Performance Evaluation, Lecture Notes in Computer Science 1245, pages 44-57, St. Malo, France, June 1997. Springer-Vedag.
17. G. Ciardo and A. S. Miner. A data structure for the efficient Kronecker solution of GSPNs. In P. Buchholz, editor, Proc. 8th Int. Workshop on Petri Nets and Performance Models (PNPM’99), pages 22-31, Zaragoza, Spain, Sept. 1999. IEEE Comp. Soc. Press.
18. G. Ciardo and M. Tilgner. On the use of Kronecker operators for the solution of generalized stochastic Petri nets. ICASE Report 96-35, Institute for Computer Applications in Science and Engineering, Hampton, VA, May 1996.
19. G. Ciardo and K. S. Trivedi. Solution of large GSPN models. In W. J. Stewart, editor, Numerical Solution of Markov Chains, pages 565-595. Marcel Dekker, Inc., New York, NY, 1991.
20. A. Cumani. ESP - A package for the evaluation of stochastic Petri nets with phase-type distributed transitions times. In Proc. Int. Workshop on Timed Petri Nets, Torino, Italy, July 1985.
21. S. Donatelli. Superposed Stochastic Automata: a class of stochastic Petri nets with parallel solution and distributed state space. Per$ Eval., 18:21-26, 1993.
22. P. Fernandes, B. Plateau, and W. J. Stewart. Efficient descriptor-vector multiplication in stochastic automata networks. Journal of the ACM, 45(3):381-414, 1998.
23. J.R. Burch, E.M. Clarke, and D.E. Long. Symbolic model checking with partitioned transition relations. In A. Halaas and P.B. Denyer, editors, International Conference on Very Large Scale Integration, pages 49-58, Edinburgh, Scotland, Aug. 1991. IFIP Transactions, North-Holland.
24. T. Kam, T. Villa, R. Brayton, and A. Sangiovanni-Vincentelli. Multi-valued decision diagrams: theory and applications. Multiple-Valued Logic, 4(1-2):9-62, 1998.
25. P. Kemper. Numerical analysis of superposed GSPNs. IEEE Trans. Softw. Eng., 22(4):615-628, Sept. 1996.
26. J. F. Meyer, A. Movaghar, and W. H. Sanders. Stochastic activity networks: structure, behavior, and application. In Proc. Int. Workshop on Timed Petri Nets, Torino, Italy, July 1985.
27. A. S. Miner. Data structures for the analysis of large structured Markov models. PhD thesis, College of William and Mary, Williamsburg, VA, 2000.
28. A. S. 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 (Proc. 20th Int. Con5 on Applications and Theory of Petri Nets, Williamsburg, VA, USA),Lecture Notes in Computer Science 1639, pages 6-25. Springer-Verlag, June 1999.
29. A. S. Miner, G. Ciardo, and S. Donatelli. Using the exact state space of a Markov model to compute approximate stationary measures. In J. Kurose and P. Nain, editors, Proc. 2000 ACM SIGMETRICS Con$ on Measurement and Modeling of Computer Systems, pages 207-216, Santa Clara, CA, June 2000. ACM Press.
30. M. K. Molloy. On the integration of delay and throughput measures in distributed processing models. PhD thesis, UCLA, Los Angeles, CA, 1981.
31. S. Natkin. Reseaux de Petri stochastiques. These de docteur ingeneur, CNAM-Paris, Paris, France, June 1980.
32. E. Pastor, O . Roig, J. Cortadella, and R. Badia. Petri net analysis using boolean manipulation. In R. Valette, editor, Application and Theory of Petri Nets 1994, (Proc. 15th Int. Con$ on Applications and Theory of Petri Nets, Zaragoza, Spain), Lecture Notes in Computer Science 815, pages 416-435. Springer-Verlag, June 1994.
33. C. Petri. Kommunikation mit Automaten. PhD thesis, University of Bonn, Bonn, West Germany, 1962.
34. B. Plateau. On the stochastic structure of parallelism and synchronisation models for distributed algorithms. In Proc. 1985 ACM SIGMETRICS Conj on Measurement and Modeling of Computer Systems, pages 147-153, Austin, TX, USA, May 1985.
35. W. J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton University Press, 1994.
36. R. Valk. On the computational power of extended Petri nets. In 7th Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 64, pages 527-535. Springer-Verlag, 1978.
37. R. Valk. Generalizations of Petri nets. In Mathematical foundations of computer science, Lecture Notes in Computer Science 118, pages 140-155. Springer-Verlag, 1981.