Abstract
AbstractIt is shown that the behaviour of generalized free-choice Petri nets with exponentially distributed firing times can be represented by probabilistic state graphs. For bounded Petri nets the corresponding state graphs are finite, stationary descriptions can thus be obtained by standard techniques used fbr analysis of continuous-time finite-state Markov chains. An immediate application of such a model is performance analysis of concurrent systems, and in particular queueing systems with exponentially distributed interarrival and service times. Places of Petri nets correspond to systems queues, transitions to servers, and bulk arrivals or services are conveniently modelled by generalized (multiple) arcs. Simple models of interactive computer systems are used as an illustration of performance evaluation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: INFOR: Information Systems and Operational Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
