How Long to Read Invariant Analysis for Multi-Agent Graph Transformation Systems using k-Induction

How Long Does it Take to Read Invariant Analysis for Multi-Agent Graph Transformation Systems using k-Induction?

It takes the average reader and 44 minutes to read Invariant Analysis for Multi-Agent Graph Transformation Systems using k-Induction by Sven Schneider

Assuming a reading speed of 250 words per minute. Learn more

Description

The analysis of behavioral models such as Graph Transformation Systems (GTSs) is of central importance in model-driven engineering. However, GTSs often result in intractably large or even infinite state spaces and may be equipped with multiple or even infinitely many start graphs. To mitigate these problems, static analysis techniques based on finite symbolic representations of sets of states or paths thereof have been devised. We focus on the technique of k-induction for establishing invariants specified using graph conditions. To this end, k-induction generates symbolic paths backwards from a symbolic state representing a violation of a candidate invariant to gather information on how that violation could have been reached possibly obtaining contradictions to assumed invariants. However, GTSs where multiple agents regularly perform actions independently from each other cannot be analyzed using this technique as of now as the independence among backward steps may prevent the gathering of relevant knowledge altogether. In this paper, we extend k-induction to GTSs with multiple agents thereby supporting a wide range of additional GTSs. As a running example, we consider an unbounded number of shuttles driving on a large-scale track topology, which adjust their velocity to speed limits to avoid derailing. As central contribution, we develop pruning techniques based on causality and independence among backward steps and verify that k-induction remains sound under this adaptation as well as terminates in cases where it did not terminate before.

How long is Invariant Analysis for Multi-Agent Graph Transformation Systems using k-Induction?

Invariant Analysis for Multi-Agent Graph Transformation Systems using k-Induction by Sven Schneider is 44 pages long, and a total of 11,176 words.

This makes it 15% the length of the average book. It also has 14% more words than the average book.

How Long Does it Take to Read Invariant Analysis for Multi-Agent Graph Transformation Systems using k-Induction Aloud?

The average oral reading speed is 183 words per minute. This means it takes 1 hour and 1 minute to read Invariant Analysis for Multi-Agent Graph Transformation Systems using k-Induction aloud.

What Reading Level is Invariant Analysis for Multi-Agent Graph Transformation Systems using k-Induction?

Invariant Analysis for Multi-Agent Graph Transformation Systems using k-Induction is suitable for students ages 8 and up.

Note that there may be other factors that effect this rating besides length that are not factored in on this page. This may include things like complex language or sensitive topics not suitable for students of certain ages.

When deciding what to show young students always use your best judgement and consult a professional.

Where Can I Buy Invariant Analysis for Multi-Agent Graph Transformation Systems using k-Induction?

Invariant Analysis for Multi-Agent Graph Transformation Systems using k-Induction by Sven Schneider is sold by several retailers and bookshops. However, Read Time works with Amazon to provide an easier way to purchase books.

To buy Invariant Analysis for Multi-Agent Graph Transformation Systems using k-Induction by Sven Schneider on Amazon click the button below.