10
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Open Petri nets

      ,
      Mathematical Structures in Computer Science
      Cambridge University Press (CUP)

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          The reachability semantics for Petri nets can be studied using open Petri nets. For us, an “open” Petri net is one with certain places designated as inputs and outputs via a cospan of sets. We can compose open Petri nets by gluing the outputs of one to the inputs of another. Open Petri nets can be treated as morphisms of a category Open(Petri), which becomes symmetric monoidal under disjoint union. However, since the composite of open Petri nets is defined only up to isomorphism, it is better to treat them as morphisms of a symmetric monoidal double category ${\mathbb O}\( pen(Petri). We describe two forms of semantics for open Petri nets using symmetric monoidal double functors out of \){\mathbb O}$ pen(Petri). The first, an operational semantics, gives for each open Petri net a category whose morphisms are the processes that this net can carry out. This is done in a compositional way, so that these categories can be computed on smaller subnets and then glued together. The second, a reachability semantics, simply says which markings of the outputs can be reached from a given marking of the inputs.

          Related collections

          Most cited references34

          • Record: found
          • Abstract: not found
          • Article: not found

          An Algorithm for the General Petri Net Reachability Problem

            Bookmark
            • Record: found
            • Abstract: not found
            • Book: not found

            Coloured Petri Nets

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Monoidal Bicategories and Hopf Algebroids

                Bookmark

                Author and article information

                Contributors
                Journal
                Mathematical Structures in Computer Science
                Math. Struct. Comp. Sci.
                Cambridge University Press (CUP)
                0960-1295
                1469-8072
                March 2020
                April 07 2020
                March 2020
                : 30
                : 3
                : 314-341
                Article
                10.1017/S0960129520000043
                c556a094-30ef-4663-adcb-251b8c5827ee
                © 2020

                http://creativecommons.org/licenses/by-nc-sa/4.0/

                History

                Comments

                Comment on this article