What is reachability in Petri nets?
The reachability graph of N is the transition relation restricted to its reachable markings. . It is the state space of the net. A firing sequence for a Petri net with graph G and initial marking is a sequence of transitions such that . The set of firing sequences is denoted as .
What is marking of Petri net?
A marking is a vector M : P → N that assigns to each place of a Petri net a non-negative integer number of tokens, represented by black dots and can also be represented as an m-component vector. We denote by M(p) the marking of place p.
What is timed Petri net?
In timed Petri nets, the transitions fire in “real-time”, i.e., there is a (deterministic or random) firing time associated with each transition, the tokens are removed from input places at the beginning of firing, and are deposited into output places when the firing terminates (they may be considered as remaining “in” …
What is reachable graph?
The reachability graph of a Petri net is a directed graph, G = (V, E), where each node, v ∈ V, represents a reachable marking and each edge, e ∈ E, represents a transition between two reachable markings. The set of reachable markings can be infinite, even for a finite Petri net.
What is reachability in graphs?
In graph theory, reachability refers to the ability to get from one vertex to another within a graph. A vertex can reach a vertex (and is reachable from ) if there exists a sequence of adjacent vertices (i.e. a walk) which starts with and ends with .
What is DFS in graph?
Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking.
Is a node reachable from itself?
Two nodes X and Y are said to be reachable if we can start at X and end at Y using any number of edges. Note : A Node is reachable to itself.