MIN-Fakultät
Fachbereich Informatik
Theoretische Grundlagen der Informatik
UHH > MIN > Informatik > TGI > Publikationen > F. Heitmann Deutsche Version. This page is also available in English. Cette page n'existe pas en Français. Ésta página no existe en Español. [Intern] Web-Mail Suche Seitenende

Bibliographie - Frank Heitmann

2016

Michael Köhler-Bußmeier and Frank Heitmann.
An Upper Bound for the Reachability Problem of Safe, Elementary Hornets
Fundamenta Informaticae, 143(1-2): 89-100 (2016)

2015

Michael Köhler-Bußmeier and Frank Heitmann.
Complexity Studies for Safe and Fan-Bounded Elementary Hornets
In Zbigniew Suraj, Ludwik Czaja, editors, CS&P 2015, volume 1492 of CEUR Workshop Proceedings, pages 76-87. CEUR-WS.org, 2015.
URL: http://ceur-ws.org/Vol-1492/Paper_08.pdf

2014

Frank Heitmann and Michael Köhler-Bußmeier.
Structural and Dynamic Restrictions of Elementary Object Systems.
Fundamenta Informaticae, 135(4): 387-401 (2014)

Michael Köhler-Bußmeier and Frank Heitmann.
An Upper Bound for the Reachability Problem of Safe, Elementary Hornets.
In Louchka Popova-Zeugmann, editor, CS&P 2014, volume 1269 of CEUR Workshop Proceedings, pages 101-112. CEUR-WS.org, 2014.
URL: http://ceur-ws.org/Vol-1269/paper-101.pdf

2013

Frank Heitmann.
Algorithms and Hardness Results for Object Nets.
Dissertation (PhD Thesis), Universität Hamburg, 2013.
URL Summary: http://ediss.sub.uni-hamburg.de/volltexte/2013/6364
URL PDF: http://ediss.sub.uni-hamburg.de/volltexte/2013/6364/pdf/Dissertation.pdf

Frank Heitmann and Michael Köhler-Bußmeier.
Structural and Dynamic Restrictions of Elementary Object Systems.
In Marcin S. Szczuka, Ludwik Czaja, and Magdalena Kacprzak, editors, CS&P 2013, volume 1032 of CEUR Workshop Proceedings, pages 181-192. CEUR-WS.org, 2013.
URL: http://ceur-ws.org/Vol-1032/paper-16.pdf

Michael Köhler-Bußmeier and Frank Heitmann.
Complexity Results for Elementary Hornets.
In Jose Manuel Colom and Jörg Desel, editors, PETRI NETS 2013, volume 7927 of Lecture Notes in Computer Science, pages 150-169. Springer-Verlag, 2013.
URL: http://dx.doi.org/10.1007/978-3-642-38697-8_9

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 Mobilitty (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.
Baccalaureatsarbeit, 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.