Paper in journals and books

2009

• Unfolding Semantics of Petri Nets Based on Token Flows
  Robin Bergenthum, Sebastian Mauser, Robert Lorenz, Gabriel Juhas
  Fundamenta Informaticae 94, 3-4 (2009), pages 331 - 360
• Construction of Process Models from Example Runs
  Robin Bergenthum, Jörg Desel, Sebastian Mauser, Robert Lorenz
  Transactions on Petri Nets and Other Models of Concurrency 2, LNCS 5460 (2009), pages 243-259
• Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages
  Robert Lorenz, Robin Bergenthum, Jörg Desel, Sebastian Mauser
  Fundamenta Informaticae 95, 1 (2009), pages 187-217.
• Executability of Scenarios in Petri Nets
  R. Bergenthum, J. Desel, G. Juhas, R. Lorenz, S. Mauser
  Theoretical Computer Science, 410 (12-13), pages 1190 - 1216

2008

• Synthesis of Petri Nets from finite Partial Languages
  R. Lorenz, R. Bergenthum, J. Desel, S. Mauser
  Fundamenta Informaticae 88(4), pages 437 - 468
• Complete Process Semantics of Petri Nets
  Gabriel Juhas, Robert Lorenz, Sebastian Mauser
  Fundamenta Informaticae 87(3-4), pages 331 - 365
  

  In the first part of this paper we extend the semantical framework proposed by Kleijn and Koutny 2004 for process and causality semantics of Petri nets by an additional aim, firstly mentioned in the habilitation thesis of Gabriel Juhas. The aim states that causality semantics deduced from process nets should be complete w.r.t. step semantics of a Petri net in the sense that each causality structure which is enabled w.r.t. step semantics corresponds to some process net.

  In the second part of this paper we examine several process semantics of different Petri net classes w.r.t. this aim. While it is well known that it is satisfied by the process semantics of place/transition Petri nets (p/t-nets), we show in particular that the process semantics of p/t-nets with weighted inhibitor arcs (PTI-nets) proposed by Kleijn/Koutny does not satisfy the aim. We develop a modified process semantics of PTI-nets fulfilling the aim of completeness and also all remaining axioms of the semantical framework. Finally, we sketch results in literature concerning the aim of completeness for process definitions of various further Petri net classes.

  The paper is a revised and extended version of a conference paper published at ATPN 2007.

• Decision Support with Logical and Fuzzy Petri Nets
  Fedor Lehocki, Gabriel Juhás, Robert Lorenz,Helena Szczerbicka, Martin Drozda
  Cybernetics and Systems 39, 6(2008), pages 617-640.
• Causal Semantics of Algebraic Petri Nets distinguishing Concurrency and Synchronicity
  G. Juhas, R. Lorenz, S. Mauser
  Fundamenta Informaticae 86(3), pages 255 - 298

2004

• A Guide to Modelling and Control with Modules of Signal Nets
  J. Desel, H.-M. Hanisch, G. Juhas, R. Lorenz, C. Neumair
  LNCS 3147, pages 270-300
• Modelling and Control with Modules of Signal Nets
  Gabriel Juhás, Robert Lorenz, Christian Neumair
  Lectures on Concurrency and Petri Nets from the 4th Advanced Course on Petri Nets (ACPN), LNCS 3098, pages 585-625.

2003

• Relating Axiomatic and Operational Semantics of Place/Transition Nets
  Jörg Desel, Gabriel Juhás, Robert Lorenz
  From Process Terms to Partial Orders. ENTCS 82, 7 (2003).

2002

• Modelling with Petri Modules
  Gabriel Juhás, Robert Lorenz
  In: Synthesis and Control of Discrete Event Systems (2002). Kluwer Academic Press, pages 125-138.

2001

• Unifying Petri Nets with restricted Occurrence Rule using Partial Algebra
  Jörg Desel, Gabriel Juhás, Robert Lorenz
  ENTCS 44(4), 25 pages (2001).
• Petri Nets over Partial Algebra
  Jörg Desel, Gabriel Juhás, Robert Lorenz
  In: Unifying petri Nets (2001). LNCS 2128, pages 126-172.