A polynomial complexity algorithm to decide the liveness for a class of Petri nets
Z. Li, and D. Liu. 2005 International Conference on Control and Automation, 2, page 1175--1180 Vol. 2. IEEE, (June 2005)
DOI: 10.1109/icca.2005.1528299
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 LiLiu05
%A Li, Zhi W.
%A Liu, Ding
%B 2005 International Conference on Control and Automation
%D 2005
%I IEEE
%K algorithm, citas, citeulike liveness, polynomial, referencias
%P 1175--1180 Vol. 2
%R 10.1109/icca.2005.1528299
%T A polynomial complexity algorithm to decide the liveness for a class of Petri nets
%U http://dx.doi.org/10.1109/icca.2005.1528299
%V 2
%@ 0-7803-9137-3
@inproceedings{LiLiu05,
added-at = {2017-09-08T10:52:59.000+0200},
author = {Li, Zhi W. and Liu, Ding},
biburl = {https://www.bibsonomy.org/bibtex/221f5922f799c5527c2cd3910b109ac7c/fernand0},
booktitle = {2005 International Conference on Control and Automation},
citeulike-article-id = {14026969},
citeulike-linkout-0 = {http://dx.doi.org/10.1109/icca.2005.1528299},
citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1528299},
doi = {10.1109/icca.2005.1528299},
institution = {Sch. of Electro-Mech. Eng., Xidian Univ., Xi'an, China},
interhash = {1629855499da1a84d4a38e10e01eee1d},
intrahash = {21f5922f799c5527c2cd3910b109ac7c},
isbn = {0-7803-9137-3},
issn = {1948-3449},
keywords = {algorithm, citas, citeulike liveness, polynomial, referencias},
month = jun,
pages = {1175--1180 Vol. 2},
posted-at = {2016-05-03 17:34:52},
priority = {2},
publisher = {IEEE},
timestamp = {2017-09-08T10:53:23.000+0200},
title = {{A polynomial complexity algorithm to decide the liveness for a class of Petri nets}},
url = {http://dx.doi.org/10.1109/icca.2005.1528299},
volume = 2,
year = 2005
}