|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2010 18th Annual IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
A Symbolic Reachability Graph and Associated Markov Process for a Class of Dynamic Petri Nets
Miami, Florida
August 17-August 19
ISBN: 978-0-7695-4197-6
| ASCII Text | x | ||
| Lorenzo Capra, "A Symbolic Reachability Graph and Associated Markov Process for a Class of Dynamic Petri Nets," 2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pp. 458-461, 2010 18th Annual IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2010. | |||
| BibTex | x | ||
| @article{ 10.1109/MASCOTS.2010.65, author = {Lorenzo Capra}, title = {A Symbolic Reachability Graph and Associated Markov Process for a Class of Dynamic Petri Nets}, journal ={2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems}, volume = {0}, year = {2010}, issn = {1526-7539}, pages = {458-461}, doi = {http://doi.ieeecomputersociety.org/10.1109/MASCOTS.2010.65}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems TI - A Symbolic Reachability Graph and Associated Markov Process for a Class of Dynamic Petri Nets SN - 1526-7539 SP458 EP461 A1 - Lorenzo Capra, PY - 2010 VL - 0 JA - 2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems ER - | |||
The design of evolving discrete-event systems needs for adequate modeling techniques. A Petri net-based reflective layout has been recently proposed to support dynamic discrete event system’s design. Keeping functional aspects separated from evolutionary ones, deploying changes to the (current) system configuration when necessary, results in a clean formal model preserving the ability of verifying properties typical of Petri nets. Reflective Petri nets are provided with a pseudo-symbolic state transition graph, and an associated lumped Markov process.
Citation:
Lorenzo Capra, "A Symbolic Reachability Graph and Associated Markov Process for a Class of Dynamic Petri Nets," mascots, pp.458-461, 2010 18th Annual IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2010
Usage of this product signifies your acceptance of the Terms of Use.