In: Appl. Categ. Structures 10 (2002), No. 2. 2002.
Abstract: Automata with concurrency relations are labelled transition systems with a collection of state-dependent binary independence relations for the actions. It is shown how to associate with each Petri net (place/transition net) such an automaton having the same dynamic behaviour. Automata, arising in this way, are characterized. With suitable notions of morphisms for Petri nets and for automata with concurrency relations this correspondence is we extended to a coreflection between the associated categories. As a consequence, these categories have products and conditional coproducts.
Back to the Petri Nets Bibliography