| BOBBIO Andrea, FRANCESCHINIS Giuliana Annamaria, GAETA R. and PORTINALE Luigi (1999), "Exploiting Petri Nets to support Fault Tree based dependability analysis", In Proceedings 8th International Conference on Petri Nets and Performance Models - PNPM99., 8-10 Settembre 1999, 1999. , pp. 146-155. IEEE Press. |
| Abstract: This paper explores the possibility of converting Fault
Trees (FT) into the Generalized Stochastic Petri Net (GSPN) formalism. Starting from a slightly modified version of a conversion algorithm already appeared in the literature, the aim of the paper is to exploit the modeling and decision power of GSPN for both the qualitative and the quantitative analysis of the modeled system. The qualitative analysis resorts to structural properties and is based on a T-invariant analysis. In order to alleviate the state space explosion problem deriving from the quantitative analysis, the paper proposes a new formalism for FT, that is referred to as High Level FT (HLFT), in which replicated redundant units are folded and indexed. Starting from the HLFT formalism, a new conversion algorithm is provided that translates a HLFT into a Stochastic Well-formed Net (SWN). The computational saving of using SWN with respect to GSPN is carefully examined considering an example of a fault-tolerantmultiprocessor system. |
BibTeX:
@inproceedings{BOBBIOAndrea1999,
author = {BOBBIO Andrea, and FRANCESCHINIS Giuliana Annamaria, and GAETA R., and PORTINALE Luigi,},
title = {Exploiting Petri Nets to support Fault Tree based dependability analysis},
booktitle = {Proceedings 8th International Conference on Petri Nets and Performance Models - PNPM99},
publisher = {IEEE Press},
year = {1999},
pages = {146-155},
note = {Contributo in Atti di convegno}
}
|
| L. CAPRA, C. DUTHEILLET, FRANCESCHINIS Giuliana Annamaria and J. M. ILIE' (1999), "Towards Performance Analysis with Partially Symmetrical SWN", In Proceedings. of the 7th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems., Ottobre 1999, 1999. , pp. 148-155. IEEE. |
| Abstract: Stochastic well formed colored nets (SWN) make it possible to apply performance evaluation techniques on a compact representation of the reachability graph (RG), called the Symbolic RG (SRG). The Extended SRG (ESRG) has been proposed to achieve a higher degree of reduction when applied to partially symmetric SWN models. The price to pay for the more effective state space reduction, is a loss of information on the paths of the graph. Despite this loss, it has been shown that several qualitative properties can be studied on the ESRG. We consider the possibility of using the ESRG for performance evaluation purposes and more specifically, we explore how the ergodicity of the system can be decided on this graph |
BibTeX:
@inproceedings{CAPRA1999,
author = {L. CAPRA, and C. DUTHEILLET, and FRANCESCHINIS Giuliana Annamaria, and J. M. ILIE',},
title = {Towards Performance Analysis with Partially Symmetrical SWN},
booktitle = {Proceedings. of the 7th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems},
publisher = {IEEE},
year = {1999},
pages = {148-155},
note = {Contributo in Atti di convegno},
doi = {10.1109/MASCOT.1999.805050}
}
|
| FRANCESCHINIS G, A. FUMAGALLI and A. SILINGUELLI (1999), "Stochastic Colored Petri Net Models for Rainbow Optical Networks", In Application of Petri Nets to Communication Networks - Advances in Petri Nets. Vol. 1605, pp. 273-303. Springer. |
| Abstract: In this paper, Stochastic Well-formed Nets (SWN) are used to model an optical multi-receiver system and study its performance. A novel approach to resolving packet contention (loss), occurring in optical multi-receiver nodes when the number of packets concurrently reaching the node exceeds the number of available receivers, is presented: it is based on the combined use of fiber delay lines and photonic switches, to temporarily store (delay) optical packets prior to reception. In order to effectively delay the contending packets and improve the multi-receiver throughput three novel control strategies are presented and their performance analyzed using SWN models. Techniques specific to this formalism are applied to cope with the state space explosion problem. A further optimization is achieved by altering the models in such a way that exact performance results can be obtained with reduced computational complexity. |
BibTeX:
@inbook{FRANCESCHINISG1999,
author = {FRANCESCHINIS G, and A. FUMAGALLI, and A. SILINGUELLI,},
editor = {Jonathan Billington, Michel Diaz, Grzegorz Rozenberg,},
title = {Stochastic Colored Petri Net Models for Rainbow Optical Networks},
booktitle = {Application of Petri Nets to Communication Networks - Advances in Petri Nets},
publisher = {Springer},
year = {1999},
volume = {1605},
pages = {273-303},
note = {Contributo in volume (Capitolo o Saggio)},
doi = {10.1007/BFb0097780}
}
|
| E. TERUEL, FRANCESCHINIS Giuliana Annamaria and M. DE PIERRO (1999), "Clarifying the Priority Specification of GSPN: Detached Priorities", In Proceedings of the 8th International Workshop on Petri Nets and Performance Models - PNPM'99., 8-10 Settembre, 1999. , pp. 114-123. IEEE. |
| Abstract: The global multilevel priority definition in GSPN, while being most convenient with many respects, poses some modelling problems related with confusion and indirect conflicts, which may lead to undesired effects in the definition of the underlying stochastic process. While some of these problems have been recognized and dealt with in previous works on the definition of GSPN, through the introduction of extended conflict sets, some others, that will be illustrated in this paper, were not covered. To overcome all these problems, in this paper a syntactical subclass of GSPN, called detached priorities GSPN (dpGSPN), is proposed. In dpGSPN no confusion or indirect conflicts are possible, and according to our experience, modelling power is not substantially sacrificed. To facilitate the modelling, a possible method to derive a suitable global priority definition from local information is outlined. |
BibTeX:
@inproceedings{TERUEL1999,
author = {E. TERUEL, and FRANCESCHINIS Giuliana Annamaria, and M. DE PIERRO,},
title = {Clarifying the Priority Specification of GSPN: Detached Priorities},
booktitle = {Proceedings of the 8th International Workshop on Petri Nets and Performance Models - PNPM'99},
publisher = {IEEE},
year = {1999},
pages = {114-123},
note = {Contributo in Atti di convegno},
doi = {10.1109/PNPM.1999.796558}
}
|
| FRANCESCHINIS G and M. RIBAUDO (1998), "Efficient Performance Analysis Techniques for Stochastic Well-Formed Nets and Stochastic Process Algebras", In Lectures on Petri Nets II: Applications (Advances in Petri Nets). Berlin Heidelberg - Vol. 1492, pp. 386-437. Springer. |
| Abstract: Stochastic Well Formed Nets and Stochastic Process Algebras are high level description languages for the specification and the performance evaluation of concurrent systems. In both formalisms the performance analysis of the modelled system can be performed by generating a continuous time Markov chain of the size of the model state space: this often leads to the so called state space explosion problem which can prevent the possibility of completing the desired analysis. In this chapter we will present two state space aggregation techniques, each working on one of the two formalisms, allowing efficient performance analysis. The advantages and disadvantages of the two techniques will be discussed and compared. |
BibTeX:
@inbook{FRANCESCHINISG1998,
author = {FRANCESCHINIS G, and M. RIBAUDO,},
editor = {Reisig W., Rozenberg G.,},
title = {Efficient Performance Analysis Techniques for Stochastic Well-Formed Nets and Stochastic Process Algebras},
booktitle = {Lectures on Petri Nets II: Applications (Advances in Petri Nets)},
publisher = {Springer},
year = {1998},
volume = {1492},
pages = {386-437},
note = {Contributo in volume (Capitolo o Saggio)},
doi = {10.1007/3-540-65307-4_53}
}
|
| S.DONATELLI and FRANCESCHINIS G (1998), "Modelling and Analysis of Distributed Software using GSPNs", In Lectures on Petri Nets II: Applications (Advances in Petri Nets). Berlin Heidelberg - Vol. 1492 LNCS, pp. 438-477. Springer. |
| Abstract: This chapter discusses the role that Generalized Stochastic Petri Nets (GSPN) can play in the static analysis of distributed software. The material is organized along two main lines: the need and the advantages of studying both qualitative and quantitative aspects of a program, and the need for doing it in an automatic manner. The role of performance evaluation in the analysis of distributed software is illustrated through a small example, classical in the qualitative approach (the dining philosophers). Although small this example allows to point out the need and the requirements of automatic translation and to discuss the main hypothesis behind program performance evaluation through GSPN models. A procedure for the automatic generation of GSPN models starting from a distributed program written in a CSP-like language, and for the definition of program performance indices in terms of GSPN ones is then given and illustrated by means of a realistic example. |
BibTeX:
@inbook{S.DONATELLI1998,
author = {S.DONATELLI, and FRANCESCHINIS G,},
editor = {W. Reisig, G. Rozenberg,},
title = {Modelling and Analysis of Distributed Software using GSPNs},
booktitle = {Lectures on Petri Nets II: Applications (Advances in Petri Nets)},
publisher = {Springer},
year = {1998},
volume = {1492 LNCS},
pages = {438-477},
note = {Contributo in volume (Capitolo o Saggio)},
doi = {10.1007/3-540-65307-4_54}
}
|
| ANGLANO C., O. BOTTI, S. DONATELLI and G. FRANCESCHINIS (1997), "Performance Prediction of a Reconfigurable High Voltage Substation Simulator: A Case Study Using SWN", In Proceedings of the 7th International Workshop on Petri Nets and Performance Models. LOS ALAMITOS - USA, June 03-06, 1997, 1997. , pp. 163-172. IEEE Computer Society. |
| Abstract: This paper presents the modeling and performance evaluation of a high voltage substation simulator with real time constraints, running on a multiprocessor architecture.
The Stochastic Well-formed Net models of the simulator and of the target multiprocessor have been designed with the goal of providing guidelines as well as automatic tools for the generalization to several software and hardware configurations as well as mappings. Quantitative results have been obtained using the simulation facilities (both ordinary and symbolic) offered by the GreatSPN2.0 tool. |
BibTeX:
@inproceedings{ANGLANO1997,
author = {ANGLANO C., and O. BOTTI, and S. DONATELLI, and G. FRANCESCHINIS,},
title = {Performance Prediction of a Reconfigurable High Voltage Substation Simulator: A Case Study Using SWN},
booktitle = {Proceedings of the 7th International Workshop on Petri Nets and Performance Models},
publisher = {IEEE Computer Society},
year = {1997},
pages = {163-172},
note = {Contributo in Atti di convegno},
doi = {10.1109/PNPM.1997.595547}
}
|
| G. CHIOLA, C. DUTHEILLET, FRANCESCHINIS Giuliana Annamaria and S. HADDAD (1997), "A Symbolic Reachability Graph for Coloured Petri Nets", THEORETICAL COMPUTER SCIENCE. Vol. 176, pp. 39-65. |
BibTeX:
@article{CHIOLA1997,
author = {G. CHIOLA, and C. DUTHEILLET, and FRANCESCHINIS Giuliana Annamaria, and S. HADDAD,},
title = {A Symbolic Reachability Graph for Coloured Petri Nets},
journal = {THEORETICAL COMPUTER SCIENCE},
year = {1997},
volume = {176},
pages = {39-65},
note = {Articolo in rivista},
doi = {10.1016/S0304-3975(96)00010-2}
}
|
| S. DONATELLI and FRANCESCHINIS Giuliana Annamaria (1996), "The PSR methodology: integrating hardware and software models", In Proceedings of the 17th International Conference on Application and Theory of Petri Nets., june 24-28, 1996. Vol. LNCS 1091, pp. 133-152. |
| Abstract: This paper proposes a new methodology for the construction of integrated hardware-software GSPN models. The PSR methodology is an extension of the Process/Resource Box methodology defined in [5]: it consists of defining three submodels, the P level (processes), the S level (services) and the R, level (resources), and the composition rules to combine them into a complete integrated GSPN model of the whole system.
This work has been motivated by the need of a systematic approach to the construction of (parallel) hardware-software models. The adequacy of the methodology is discussed through a running example of a relatively complex system. |
BibTeX:
@inproceedings{DONATELLI1996,
author = {S. DONATELLI, and FRANCESCHINIS Giuliana Annamaria,},
title = {The PSR methodology: integrating hardware and software models},
booktitle = {Proceedings of the 17th International Conference on Application and Theory of Petri Nets},
year = {1996},
volume = {LNCS 1091},
pages = {133-152},
note = {Contributo in Atti di convegno},
doi = {10.1007/3-540-61363-3_8}
}
|
| Ajmone Marsan M, Balbo G, Conte G, Donatelli S and Franceschinis GA (1995), "Modelling with Generalized Stochastic Petri Nets" John Wiley & Sons Ltd.
[BibTeX] |
BibTeX:
@book{AjmoneMarsan1995,
author = {Ajmone Marsan, Marco and Balbo, Gianfranco and Conte, Gianni and Donatelli, Susanna and Franceschinis, Giuliana Annamaria},
title = {Modelling with Generalized Stochastic Petri Nets},
publisher = {John Wiley & Sons Ltd},
year = {1995}
}
|
| G. CHIOLA, FRANCESCHINIS Giuliana Annamaria, R. GAETA and M. RIBAUDO (1995), "GreatSPN 1.7: Graphical Editor and Analyzer for Timed and Stochastic Petri Nets", PERFORMANCE EVALUATION. Vol. 24, pp. 47-68. |
| Abstract: This paper describes the GreatSPN 1.7 package for the modeling, validation, and performance evaluation of distributed systems using Generalized Stochastic Petri Nets and their colored extension. The tool provides a friendly framework to experiment with timed Petri net based modeling techniques. It implements efficient analysis algorithms to allow its use on “real” applications, not only toy examples. Developed in a university for non-profit purposes, it is distributed free of charge to other universities for educational and research purposes. An overview of the complete architecture of the package is given together with examples of its application. Then the various analysis and simulation modules are described. |
BibTeX:
@article{CHIOLA1995,
author = {G. CHIOLA, and FRANCESCHINIS Giuliana Annamaria, and R. GAETA, and M. RIBAUDO,},
title = {GreatSPN 1.7: Graphical Editor and Analyzer for Timed and Stochastic Petri Nets},
journal = {PERFORMANCE EVALUATION},
year = {1995},
volume = {24},
pages = {47-68},
note = {Articolo in rivista},
doi = {10.1016/0166-5316(95)00008-L}
}
|
| G. BALBO, S. DONATELLI, FRANCESCHINIS Giuliana Annamaria, A. MAZZEO, N. MAZZOCCA and M. RIBAUDO (1994), "On the Computation of Performance Characteristics of Concurrent Programs using GSPNs", PERFORMANCE EVALUATION. Vol. 19, pp. 195-222. |
| Abstract: Petri net based models are proposed in this paper as the vehicles for the characterization of the processing and communication parameters of concurrent programs. A technique for the construction of a GSPN model as a direct translation of a concurrent program is used and a method is presented that allows to build, from a GSPN model, graph representations that are useful for preliminary assessment of the performance of the programs and for solving the problem of allocating the processes of a concurrent program to the processors of a given architecture. The concept of phase in the execution of a concurrent program is introduced and used to construct communication graphs that are simpler than those obtained considering the execution of a program as a whole. An example of the application of the technique is presented together with experimental results obtained from direct measurements of a real program. The agreement between the performance indices computed with the models and the results of direct measurements shows the practical relevance of this technique. |
BibTeX:
@article{BALBO1994,
author = {G. BALBO, and S. DONATELLI, and FRANCESCHINIS Giuliana Annamaria, and A. MAZZEO, and N. MAZZOCCA, and M. RIBAUDO,},
title = {On the Computation of Performance Characteristics of Concurrent Programs using GSPNs},
journal = {PERFORMANCE EVALUATION},
year = {1994},
volume = {19},
pages = {195-222},
note = {Articolo in rivista},
doi = {10.1016/0166-5316(94)90039-6}
}
|
| FRANCESCHINIS Giuliana Annamaria and R. R. MUNTZ (1994), "Computing bounds for the performance indices of quasi-lumpable Stochastic Well-Formed Nets", IEEE TRANSACTIONS ON SOFTWARE ENGINEERING. Vol. 20, pp. 516-525. |
| Abstract: Structural symmetries in stochastic well-formed colored Petri nets (SWN's) lead to behavioral symmetries that can be exploited by using the symbolic reachability graph (SRG) construction algorithm. The SRC allows one to compute an aggregated reachability graph (RG) and a “lumped” continuous time Markov chain (CTMC) that contain all the information needed to study the qualitative properties and the performance of the modeled system, respectively. Some models exhibit qualitative behavioral symmetries that are not completely reflected at the CTMC level. We call them quasi-lumpable SWN models. In these cases, exact performance indices can be obtained by avoiding the aggregation of those markings that are qualitatively, but not quantitatively, equivalent. An alternative approach consists of aggregating all the qualitatively equivalent states and computing approximated performance indices. In this paper, a technique is proposed to compute bounds on the performance of SWN models of this kind, using the results we have presented elsewhere. The technique is based on the Courtois and Semal bounded aggregation method |
BibTeX:
@article{FGA1994,
author = {FRANCESCHINIS Giuliana Annamaria, and R. R. MUNTZ,},
title = {Computing bounds for the performance indices of quasi-lumpable Stochastic Well-Formed Nets},
journal = {IEEE TRANSACTIONS ON SOFTWARE ENGINEERING},
year = {1994},
volume = {20},
pages = {516-525},
note = {Articolo in rivista},
doi = {10.1109/32.297940}
}
|
| G. CHIOLA, C. DUTHEILLET, FRANCESCHINIS Giuliana Annamaria and S. HADDAD (1993), "Stochastic Well-Formed Coloured Nets for Symmetric Modelling Applications", IEEE TRANSACTIONS ON COMPUTERS. Vol. 42, pp. 1343-1360. |
| Abstract: The class of stochastic well-formed colored nets (SWN's) was defined as a syntactic restriction of stochastic high-level nets. The interest of the introduction of restrictions in the model definition is the possibility of exploiting the symbolic reachability graph (SRG) to reduce the complexity of Markovian performance evaluation with respect to classical Petri net techniques. It turns out that SWN's allow the representation of any color function in a structured form, so that any unconstrained high-level net can be transformed into a well-formed net. Moreover, most constructs useful for the modeling of distributed computer systems and architectures directly match the “well-formed” restriction, without any need of transformation. A nontrivial example of the usefulness of the technique in the performance modeling and evaluation of multiprocessor architectures is included |
BibTeX:
@article{CHIOLA1993,
author = {G. CHIOLA, and C. DUTHEILLET, and FRANCESCHINIS Giuliana Annamaria, and S. HADDAD,},
title = {Stochastic Well-Formed Coloured Nets for Symmetric Modelling Applications},
journal = {IEEE TRANSACTIONS ON COMPUTERS},
year = {1993},
volume = {42},
pages = {1343-1360},
note = {Articolo in rivista},
doi = {10.1109/12.247838}
}
|
| G. BALBO, S. DONATELLI and FRANCESCHINIS Giuliana Annamaria (1992), "Understanding Parallel Programs Behaviour through Petri Net Models", JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING. Vol. 15, pp. 171-187. |
| Abstract: Generalized stochastic Petri nets (GSPN) are proposed in this paper as a way to represent and analyze programs written with process-oriented parallel languages. Following an approach that has already been proposed in the literature, parallel programs are translated into GSPN models that are used to perform a static analysis yielding information on possible deadlocks, mutual exclusion, and resource utilization. These models offer help in understanding the overall behavior of a parallel program, increase confidence in its correctness, and permit assessment of the efficiency of its implementation. The feasibility of automatic generation of Petri nets from program code is discussed and the problem of correctly modeling communications and flow control variables is addressed. |
BibTeX:
@article{BALBO1992,
author = {G. BALBO, and S. DONATELLI, and FRANCESCHINIS Giuliana Annamaria,},
title = {Understanding Parallel Programs Behaviour through Petri Net Models},
journal = {JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING},
year = {1992},
volume = {15},
pages = {171-187},
note = {Articolo in rivista},
doi = {10.1016/0743-7315(92)90002-5}
}
|
| Ajmone Marsan M, Balbo G, Chiola G, Conte G, Donatelli S and Franceschinis G (1991), "An introduction to generalized stochastic Petri nets", MICROELECTRONICS RELIABILITY. Vol. 31, pp. 699-725. |
| Abstract: The paper decribes the GSPN approach to the performance evaluation of distributed systems. The structural properties and temporal specifications of GSPN are summarized, and application examples are then illustrated, trying to emphasize the methodology to be followed in the model development and validation, rather than the numerical results that can be obtained from the specific models developed in the paper. © 1991. |
BibTeX:
@article{AjmoneMarsan1991,
author = {Ajmone Marsan, M. and Balbo, G. and Chiola, G. and Conte, G. and Donatelli, S. and Franceschinis, G.},
title = {An introduction to generalized stochastic Petri nets},
journal = {MICROELECTRONICS RELIABILITY},
year = {1991},
volume = {31},
pages = {699--725},
doi = {10.1016/0026-2714(91)90010-5}
}
|
| G.CHIOLA, C. DUTHEILLET, FRANCESCHINIS G and S. HADDAD (1991), "Stochastic Well-Formed coloured nets and multiprocessor modelling applications", In High-level Petri Nets. Berlin Heidelberg - , pp. 504-530. Springer. |
| Abstract: The new class of Stochastic Well-formed coloured Nets (SWN) is defined as a syntactic restriction of Stochastic High-Level Nets. The interest of the introduction of restrictions in the model definition is the possibility of exploiting the Symbolic Reachability Graph (SRG) to reduce the complexity of Markovian performance evaluation with respect to classical Petri net techniques. It turns out that SWNs allow the representation of any colour function in a structured form, so that any unconstraint high-level net can be transformed into a well formed net. Moreover, most constructs useful for the modelling of distributed computer systems and architectures directly match the “well form” restriction, without any need of transformation. A non trivial example of the usefulness of the technique in the performance modelling and evaluation of multiprocessor architectures is included. |
BibTeX:
@inbook{G.CHIOLA1991,
author = {G.CHIOLA, and C. DUTHEILLET, and FRANCESCHINIS G, and S. HADDAD,},
editor = {Jensen K. and Rozenberg G.,},
title = {Stochastic Well-Formed coloured nets and multiprocessor modelling applications},
booktitle = {High-level Petri Nets},
publisher = {Springer},
year = {1991},
pages = {504-530},
note = {Contributo in volume (Capitolo o Saggio)},
doi = {10.1007/978-3-642-84524-6_19}
}
|
| Chiola G and Franceschinis G (1990), "Colored GSPN models and automatic symmetry detection", In Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89. , pp. 50-60. |
| Abstract: Colored Petri nets (CPN) are useful for the development of very compact and easy to understand models of systems with interacting concurrent components. A CPN model can be used for a qualitative analysis of the modeled system; when timing is also added, a quantitative analysis can be done. Unfortunately, the analysis can be prevented by excessive size of the reachability graph (RG) of the net, which can grow exponentially as a function of the number of places and the cardinality of color domains. A method that automatically exploits the symmetries intrinsic in the model reducing the RG size is presented: it can be applied to a subclass of CPNs called regular nets (RN). Some nontrivial examples are presented to demonstrate that the automatically achieved reductions are comparable to those devised for these systems by thoroughly studying their behavior |
BibTeX:
@inproceedings{Chiola1990,
author = {Chiola, G. and Franceschinis, G.},
title = {Colored GSPN models and automatic symmetry detection},
booktitle = {Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89},
year = {1990},
pages = {50--60},
doi = {10.1109/PNPM.1989.68539}
}
|
| Balbo G, Chiola G, Franceschinis GA and Molinar Roet G (1987), "On the Efficient Construction of the Tangible Reachability Graph of Generalized Stochastic Petri Nets", In Proceedings of the Second International Workshop on Petri Nets and Performance Models, PNPM 1987. , pp. 136-145. IEEE Computer Society.
[BibTeX] |
BibTeX:
@inproceedings{Balbo1987,
author = {Balbo, Gianfranco and Chiola, Giovanni and Franceschinis, Giuliana Annamaria and Molinar Roet, Guido},
title = {On the Efficient Construction of the Tangible Reachability Graph of Generalized Stochastic Petri Nets},
booktitle = {Proceedings of the Second International Workshop on Petri Nets and Performance Models, PNPM 1987},
publisher = {IEEE Computer Society},
year = {1987},
pages = {136--145}
}
|
| Balbo G, Chiola G, Franceschinis G and Roet G (1987), "Generalized stochastic Petri nets for the performance evaluation of FMS", In Proceedings. 1987 IEEE International Conference on Robotics and Automation. Vol. 4, pp. 1013-1018. IEEE Computer Society. |
| Abstract: A class of Petri nets in which transitions can fire either immediately or after an exponentially distributed random time since their enabling (GSPN), is used to define performance models for Flexible Manufacturing Systems. An example is discussed in which the analysis of the GSPN model yields results that are more reliable than those obtained with a currently used method based on queueing networks. Detailed GSPN models are shown that allow accurate analyses of the effects that different scheduling policies and pallet mixes have on system performance. |
BibTeX:
@inproceedings{Balbo1987a,
author = {Balbo, G. and Chiola, G. and Franceschinis, G. and Roet, G.},
title = {Generalized stochastic Petri nets for the performance evaluation of FMS},
booktitle = {Proceedings. 1987 IEEE International Conference on Robotics and Automation},
publisher = {IEEE Computer Society},
year = {1987},
volume = {4},
pages = {1013--1018},
doi = {10.1109/ROBOT.1987.1087864}
}
|