Abstract
In this paper, a general blackboard based system is studied using Stochastic Petri Nets (SPN). We show how the dynamic behavior of the blackboard can be modeled, and analyze the marking graph of the resulting stochastic Petri net. The net is simulated with respect to the number of available processors, the event interarrival time and the average unification time, and performance results are presented.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
