Marking and Covering Graphs

  • Wolfgang ReisigEmail author


The marking graph G of a system net N has already been introduced in Section 2.8. Its nodes are the reachable states, its edges the reachable steps of N. We will specify a series of properties of N that are mirrored in G.

However, G is generally infinitely large. We therefore construct the finite covering graph H, which approximates G. A series of necessary or sufficient conditions for some properties of N can be specified by means of H.


Reachable State Covering Graph Marking Graph Temporal Logic Formula Reachable Marking 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.Department of Computer ScienceHumboldt-Universität zu BerlinBerlinGermany

Personalised recommendations