In our experiments we used the model checking contest (MCC) as a benchmark. The new method is in almost all cases at least one order of magnitude faster.
A new, generally much faster method to compute DI(N), implemented in the award wining model checker LoLA 2 and compared to the previous approach, ...
Apr 25, 2024 · Torsten Liebke, Christian Rosenke: Faster Enabledness-Updates for the Reachability Graph Computation ...
Titel, Faster enabledness-updates for the reachability graph computation. Erscheinungsjahr, 2020. Seiten (von – bis), 108 – 117.
People also ask
What is a reachability graph?
Jul 23, 2023 · [7] T. Liebke and C. Rosenke, “Faster enabledness-updates for the reacha- bility graph computation.” in PNSE@ Petri Nets, 2020, pp. 108–117.
Aug 11, 2020 · Faster Enabledness-Updates for the Reachability Graph Computation 108-117. Torsten Liebke, Christian Rosenke; Modeling Trading Systems using ...
Mar 25, 2008 · There are numerous applications that need to deal with a large graph and need to query reachability between nodes in the graph.
Missing: Enabledness- | Show results with:Enabledness-
Faster Enabledness-Updates for the Reachability Graph Computation Torsten Liebke, Christian Rosenke [Slides] [Talk] ; Modeling Trading Systems using Petri Net ...
For being able to generate large state spaces in acceptable time, it is crucial to maintain a search data structure D that allows very fast lookups and updates.
Missing: Enabledness- | Show results with:Enabledness-
Aug 14, 2021 · Currently, there are two options to solve reachability queries. (1) Execute a modified version of Dijkstra's algorithm that supports time- ...