Expressiveness of Dynamic Networks of Timed Petri Nets
We study dynamic networks of infinite-state timed processes, where each process is a Petri net carrying a single real valued clock. We compare their expressiveness with other models within the class of Well-Structured Transition Systems, using coverability languages. We prove that unbounded places are a strict resource, meaning that extra unbounded places provides (strictly) with extra expressiveness. Also, we prove that if no unbounded places are allowed, then the obtained model is equivalent to Timed Petri nets. We conclude that dynamic networks of Timed Petri Nets are strictly more expressive than Timed Petri Nets.
KeywordsTransition System Dynamic Network Label Transition System Coverability Language Counting Abstraction
Unable to display preview. Download preview PDF.
- 5.Bonnet, R., Finkel, A., Haddad, S., Rosa-Velardo, F.: Ordinal theory for expressiveness of well structured transition systems. Inf. Comput. (2012)Google Scholar
- 10.Haddad, S., Schmitz, S., Schnoebelen, P.: The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets. IEEE LICS, 355–364 (2012)Google Scholar
- 11.de Jongh, D.H.J., Parikh, R.: Well partial orderings and hierarchies. Indagationes Mathematicae, 195–207 (1977)Google Scholar
- 12.Martos-Salgado, M., Rosa-Velardo, F.: Dynamic networks of infinite-state timed processes. Technical Report 9/13, UCM (2013), http://antares.sip.ucm.es/~frosa/
- 14.Schmidt, D.: Well-partial orderings and their maximal order types. Habilitationsscrift (1979)Google Scholar