Bibliographie

Frank Heitmann

2013

Frank Heitmann and Michael Köhler-Bußmeier.
Structural and dynamic restrictions of elementary object systems.
In Marcin Szczuka, Ludwik Czaja, and Magdalena Kacprzak, editors, Proceedings of the 22nd International Workshop on Concurrency, Specification and Programming (CS&P), number 1032 in CEUR Workshop Proceedings, pages 181-192, Aachen, 2013.  [link]

Frank Heitmann.
Algorithms and Hardness Results for Object Nets.
PhD thesis, Universität Hamburg, Fachbereich Informatik, Vogt-Kölln Str. 30, D-22527 Hamburg, August 2013.  [link]

Michael Köhler-Bußmeier and Frank Heitmann.
Complexity results for elementary Hornets.
In Colom and Desel (éd.), Application and Theory of Petri Nets and Concurrency - 34th International Conference, PETRI NETS 2013, Milan, Italy, June 24-28, 2013. Proceedings, pages 150-169.  [link]

2012

Frank Heitmann and Michael Köhler-Bußmeier.
P- and t-systems in the nets-within-nets formalism.
In S. Haddad and L. Pomello, editors, PETRI NETS 2012, volume 7347 of Lecture Notes in Computer Science, pages 368-387. Springer-Verlag, 2012.

Frank Heitmann and Michael Köhler-Bußmeier.
A mobility logic for object net systems.
In B. Farwer, editor, Proceedings of the International Workshop on Logic, Agents, and Mobilitty (LAM'12), volume 853, pages 19-34. CEUR Workshop Proceedings, 2012.
urn:nbn:de:0074-853-4.

Michael Köhler-Bußmeier and Frank Heitmann.
Conservative elementary object systems.
Fundamenta Informaticae, 120(3-4):325-339, 2012.

2011

Frank Heitmann and Michael Köhler-Bußmeier.
On defining conflict-freedom for object nets.
In B. Muller and M. Köhler-Bußmeier, editors, Proceedings of the International Workshop on Logic, Agents, and Mobility (LAM 2011), 2011.

Michael Köhler-Bußmeier and Frank Heitmann.
Liveness of safe object nets.
Fundamenta Informaticae, 112(1):73-87, 2011.

Michael Köhler-Bußmeier and Frank Heitmann.
Liveness and reachability for elementary object systems.
In Marcin Szczuka, Ludwik Czaja, Andrzej Skowron, and Magdalena Kacprzak, editors, Proceedings of the Internationa Workshop on Concurrency, Specification, and Programming (CS&P 2011). Biaystok University of Technology, 2011.

Michael Köhler-Bußmeier and Frank Heitmann.
Restricting generalised state machines.
In Marcin Szczuka, Ludwik Czaja, Andrzej Skowron, and Magdalena Kacprzak, editors, Proceedings of the International Workshop on Concurrency, Specification, and Programming (CS&P 2011). Biaystok University of Technology, 2011.

2010

Michael Köhler-Bußmeier and Frank Heitmann.
Complexity of LTL model-checking for safe object nets.
In B. Farwer, editor, Proceedings of the International Workshop on Logic, Agents, and Mobilitty (LAM 2010), 2010.

Michael Köhler-Bußmeier and Frank Heitmann.
Safeness for object nets.
Fundamenta Informaticae, 101(1-2):29-43, 2010.  [link]

Michael Köhler-Bußmeier and Frank Heitmann.
Liveness of safe object nets.
In Louchka Popova-Zeugmann, H.-D. Burkhard, Ludwik Czaja, W. Penczek, G. Lindemann, A. Skowron, and Z. Suraj, editors, Proceedings of the International Workshop on Concurrency, Specification, and Programming, CS&P'2010, Helenenau, September 27-29 (Volume 1), volume 237 of Informatik-Bericht, pages 198-209. Humboldt-Universität zu Berlin, sep 2010.  [link]

2009

Michael Köhler-Bußmeier and Frank Heitmann.
On the expressiveness of communication channels for object nets.
Fundamenta Informaticae, 93(1-3):205-219, 2009.

Michael Köhler-Bußmeier and Frank Heitmann.
On defining safeness for object nets.
In L. Czaja and M. Szczuka, editors, Proceedings of the International Workshop on Concurrency, Specification, and Programming, CS&P'2009 (Volume 1), pages 265-276. Warsaw University, 2009.  [link]

2008

Frank A. Heitmann.
Steinerbäume im Erreichbarkeitsgraphen von Petrinetzen.
Baccalaureats-arbeit, Universität Hamburg, Department Informatik, Vogt-Kölln Str. 30, D-22527 Hamburg, March 2008.

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]

2007

Frank A. Heitmann.
Der Satz von Kadin. Über die Boolesche und die polynomielle Hierarchie.
Diplomarbeit, Universität Hamburg, Department Informatik, Vogt-Kölln Str. 30, D-22527 Hamburg, October 2007.