Modular Analysis of Concurrency in Jumping Petri Nets

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Cristian Vidraşcu

Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05)

Timisoara, Romania

September 25-September 29

ISBN: 0-7695-2453-2

	ASCII Text	x
	Cristian Vidraşcu, "Modular Analysis of Concurrency in Jumping Petri Nets," Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on, pp. 374-381, Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05), 2005.

	BibTex	x
	@article{ 10.1109/SYNASC.2005.46, author = {Cristian Vidraşcu}, title = {Modular Analysis of Concurrency in Jumping Petri Nets}, journal ={Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on}, volume = {0}, year = {2005}, isbn = {0-7695-2453-2}, pages = {374-381}, doi = {http://doi.ieeecomputersociety.org/10.1109/SYNASC.2005.46}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on TI - Modular Analysis of Concurrency in Jumping Petri Nets SN - 0-7695-2453-2 SP374 EP381 A1 - Cristian Vidraşcu, PY - 2005 KW - null VL - 0 JA - Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on ER -

Cristian Vidraşcu, University "Al. I. Cuza" of Iaşi

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SYNASC.2005.46

The goal of this paper is to study the relationships between the concurrency-degrees of a jumping Petri net and those of its subnets.

Citation:

Cristian Vidraşcu, "Modular Analysis of Concurrency in Jumping Petri Nets," synasc, pp.374-381, Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05), 2005

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.