Bibliography
On the Expressiveness of Communication Channels for Object Nets
Michael Köhler-Bußmeier and Frank Heitmann.
On the expressiveness of communication channels for object nets.
In G. Lindemann, H.-D. Burkhard, L. Czaja, W. Penczek, A. Salwicki,
H. Schlingloff, A. Skowron, and Z. Suraj, editors, Proceedings of the
International Workshop on Concurrency, Specification, and Programming CS&P
2008 (Volume 2), pages 253-264. Humboldt-Universität zu Berlin,
Informatik-Berichte 225, 2008.
[link]
In this work we present object net systems, i.e. Petri nets with nets as token objects, which are equipped with channels that allow to transfer net-tokens in the vertical dimension of the nested marking. These channels are a modelling element powerful enough to describe a direct simulation of counter programs which shows that typical net problems like boundedness, coverability, and reachability are undecidable.[link]
BibTeX
@InProceedings{Koehler+08d,
author = {K{\"o}hler-Bu{\ss}meier, Michael and Heitmann, Frank},
title = {On the Expressiveness of Communication Channels for Object Nets},
editor = {Lindemann, G. and Burkhard, H.-D. and Czaja, L. and Penczek, W. and
Salwicki, A. and Schlingloff, H. and Skowron, A. and Suraj, Z.},
booktitle = {Proceedings of the International Workshop on
Concurrency, Specification, and Programming
CS\&P 2008 (Volume 2)},
publisher = {Humboldt-Universit{\"a}t zu Berlin, Informatik-Berichte 225},
year = 2008,
pages = {253--264},
abstract = {In this work we present object net systems, i.e. Petri nets with
nets as token objects, which are equipped with channels that allow
to transfer net-tokens in the vertical dimension of the nested
marking.
These channels are a modelling element powerful enough to describe a
direct simulation of counter programs which shows that typical net
problems like boundedness, coverability, and reachability are
undecidable.},
url = {http://www2.informatik.hu-berlin.de/ki/CSP2008/proc.html}
}
