Graph transformation systems, Petri nets and Semilinear Sets: Checking for the Absence of Forbidden Paths in Graphs
Explore this paper's citation graph
Summary
An analysis method that checks for the absence of (Euler) paths or cycles in the set of graphs reachable from a start graph via graph transformation rules, based on the approximation of graph transformation systems by Petri nets and on semilinear sets of markings.
- Type
- article
- Published
- 2007-05-15
- Cited by
- 3
- References
- 21
- Access
- Open access
- OpenAlex
- https://openalex.org/W36747726
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:8049230
Keywords
Petri net, Computer science, Graph rewriting, Transformation (genetics), Graph
References
- Aspects mathématiques des réseaux de pétri
- Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations
- Verification of Safety Properties Using Integer Programming: Beyond the State Equation
- Graph Transformation
- Halbordnungs- und Reduktionstechniken für die automatische Verifikation von verteilten Systemen
- Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution
- Well-structured transition systems everywhere!
- Towards Symbolic Analysis of Visual Modeling Languages
- Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS
- Parallel Program Schemata
- Petri Nets
- On Context-Free Languages
- A Static Analysis Technique for Graph Transformation Systems
- A General Approach to Partial Order Reductions in Symbolic Verification (Extended Abstract)
- Handbook of Graph Grammars and Computing by Graph Transformation
- A Temporal Graph Logic for Verification of Graph Transformation Systems
- Approximating the Behaviour of Graph Transformation Systems
- Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems
- Verification of Distributed Object-Based Systems
- A Logic for Analyzing Abstractions of Graph Transformation Systems
Cited by
Related papers
- Efficient Reachability Graph Representation of Petri Nets With Unbounded Counters
- Number of reachable states for simple classes of Petri nets
- Diagnosability of Petri nets with observation graphs
- Online Fault Diagnosis of Labeled Petri Nets Based on Reachability Graphs and Topological Sorting
- Some Remarks on “State Estimation and Fault Diagnosis of Labeled Time Petri Net Systems With Unobservable Transitions”
- Distributing Finite Automata Through Petri Net Synthesis
- Petri net approach to enumerate all simple paths in a graph