"ttrivial" - 1 õppematerjal

Värvitud Petri võrgud CPN eksami konspekt

 The nodes in the SCC graph are subgraphs and are obtained by disjoint division of nodes in state space.  The label of an arc in an SCC graph is the label of the corresponding arc in the state space. Since an SCC graph groups nodes that are mutually reachable, it follows that an SCC graph is an acyclic graph.  Terminal SCC – SCC without outgoing arcs  Ttrivial SCC – single state space node and no state space arcs 16.Behavioural properties  The reachability properties are concerned with determining whether a markingM’ is reachable from another markingM.  Boundedness spesify amount of tokens of a place may hold(-best upper integer bound( maximum tokens in a place at any reachable marking)– best lower integer bound( minimal tokens in a place at any