2014/09/24 by Julia Padberg, Padberg, Julia
Computer Science · #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #cs.DM #cs.LO
paper · pdf · doi:10.48550/arxiv.1409.6856
arxiv created 2014/09/24 · arxiv updated 2014/09/25
In this paper we deal with additional control structures for decorated PT Nets. The main contribution are inhibitor arcs and priorities. The first ensure that a marking can inhibit the firing of a transition. Inhibitor arcs force that the transition may only fire when the place is empty. an order of transitions restrict the firing, so that an transition may fire only if it has the highest priority of all enabled transitions. This concept is shown to be compatible with reconfigurable Petri nets.