COMPOSITIONAL ANALYSIS FOR REGULARITY, LIVENESS AND BOUNDEDNESS

Li Jiao

2005

Abstract

By the linear algebraic representation of Petri nets, Desel introduced regularity property (Desel, 1992). Regularity implies a sufficient condition for a Petri net to be live and bounded. All the conditions checking the regularity of a Petri net are decidable in polynomial time in the size of a net (Desel and Esparza, 1995). This paper proves that regularity, liveness and boundedness can be preserved after applying many compositional operations to Petri nets. This means that, by applying these compositional operations, a designer can construct complex nets satisfying regularity, liveness and boundedness properties from simpler ones without forward analysis.

Paper Citation

in Harvard Style

Jiao L. (2005). COMPOSITIONAL ANALYSIS FOR REGULARITY, LIVENESS AND BOUNDEDNESS . In Proceedings of the Second International Conference on Informatics in Control, Automation and Robotics - Volume 4: ICINCO, ISBN 972-8865-30-9, pages 169-174. DOI: 10.5220/0001178901690174

in Bibtex Style

@conference{icinco05,
author={Li Jiao},
title={COMPOSITIONAL ANALYSIS FOR REGULARITY, LIVENESS AND BOUNDEDNESS},
booktitle={Proceedings of the Second International Conference on Informatics in Control, Automation and Robotics - Volume 4: ICINCO,},
year={2005},
pages={169-174},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001178901690174},
isbn={972-8865-30-9},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Second International Conference on Informatics in Control, Automation and Robotics - Volume 4: ICINCO,
TI - COMPOSITIONAL ANALYSIS FOR REGULARITY, LIVENESS AND BOUNDEDNESS
SN - 972-8865-30-9
AU - Jiao L.
PY - 2005
SP - 169
EP - 174
DO - 10.5220/0001178901690174