Synthesis of PTL-nets with Partially Localised Conflicts (2009)

Author(s): Koutny M, Pietkiewicz-Koutny M

    Abstract: We discuss the problem of constructing PT-nets with localities (PTL-nets) from transition systems with arcs labelled by multisets of transitions (steps). We first outline how this can be done within the existing general solution based on the regions of step transition systems and fixed co-location relations. We then drop the latter assumption and show that this does not really matter when one aims at synthesising PTL-nets where all conflicts involve conflicts between co-located transitions.

      • Date: 22-23 June 2009
      • Conference Name: Proceedings of the International Workshop on Petri Nets and Software Engineering, PNSE'09
      • Pages: 247-254
      • Publisher: University of Hamburg, Department of Informatics
      • Publication type: Conference Proceedings (inc. abstract)
      • Bibliographic status: Published

        Keywords: Petri nets, localities, regions of transition systems, conflict

        Staff

        Professor Maciej Koutny
        Professor of Computing Science

        Dr Marta Pietkiewicz-Koutny
        Lecturer