Maria: The Modular Reachability Analyzer is a
reachability
In graph theory, reachability refers to the ability to get from one vertex to another within a graph. A vertex s can reach a vertex t (and t is reachable from s) if there exists a sequence of adjacent vertices (i.e. a walk) which starts with s an ...
analyzer for concurrent systems that uses
Algebraic System Nets (a high-level variant of
Petri net
A Petri net, also known as a place/transition (PT) net, is one of several mathematical modeling languages for the description of distributed systems. It is a class of discrete event dynamic system. A Petri net is a directed bipartite graph that ...
s) as its modelling formalism.
External links
*
Petri nets
{{comp-sci-stub