Paul Jonathan Hannibal, M.Sc.

Contact

  • E-Mail:

Paul Jonathan Hannibal, M.Sc.

Department of Computing Science  (» Postal address)

A03 2-213 (» Adress and map )

nach Vereinbarung

Non-term consultation: Nach Vereinbarung

+49 441 798-3124  (F&P

Research Interests

  • Synthesis of distributed, reactive systems
  • Petri Games

Publications

  • [inproceedings] bibtex | Go to document Go to document
    P. Hannibal and E. -R. Olderog, "The Synthesis Problem for Repeatedly Communicating Petri Games" in Proc. Application and Theory of Petri Nets and Concurrency - 43rd International Conference, PETRI NETS 2022, Bergen, Norway, June 19-24, 2022, Proceedings, 2022.
    doi: 10.1007/978-3-031-06653-5_13
    @inproceedings{DBLP:conf/apn/HannibalO22,
      author = {Paul Hannibal and E.-R. Olderog},
      editor = {Luca Bernardinello and Laure Petrucci},
      title = {The Synthesis Problem for Repeatedly Communicating Petri Games},
      booktitle = {Application and Theory of Petri Nets and Concurrency - 43rd International Conference, {PETRI} {NETS} 2022, Bergen, Norway, June 19-24, 2022, Proceedings},
      series = {Lecture Notes in Computer Science},
      volume = {13288},
      pages = {236--257},
      publisher = {Springer},
      year = {2022},
      url = {https://doi.org/10.1007/978-3-031-06653-5\_13},
      doi = {10.1007/978-3-031-06653-5\_13},
      timestamp = {Mon, 20 Jun 2022 16:55:49 +0200},
      biburl = {https://dblp.org/rec/conf/apn/HannibalO22.bib},
      bibsource = {dblp computer science bibliography, https://dblp.org}

Thesis

  • [mastersthesis] bibtex
    P. Hannibal, "Entscheidbarkeit von Petri-Spielen mit 2 Umgebungs- und 2 System-Spielern" Master's Dissertation , Oldenburg, 2019.
    @mastersthesis{Ha19,
      author = {Paul Hannibal},
      title = {Entscheidbarkeit von Petri-Spielen mit 2 Umgebungs- und 2 System-Spielern},
      school = {University of Oldenburg},
      year = 2019, address = {Oldenburg},
      month = 9
(Changed: 19 Jan 2024)  | 
Zum Seitananfang scrollen Scroll to the top of the page