Pages that link to "Item:Q5111899"
From MaRDI portal
The following pages link to On the Decidability Status of Reachability and Coverability in Graph Transformation Systems (Q5111899):
Displaying 8 items.
- Well-structured graph transformation systems (Q729812) (← links)
- Handling infinitely branching well-structured transition systems (Q1686118) (← links)
- Reachability analysis of reversal-bounded automata on series-parallel graphs (Q1741900) (← links)
- A tale of two graph models: a case study in wireless sensor networks (Q2065559) (← links)
- Reachability in Graph Transformation Systems and Slice Languages (Q2947215) (← links)
- Declarative Parameterized Verification of Distributed Protocols via the Cubicle Model Checker (Q4991929) (← links)
- (Q5013881) (← links)
- Decidability of Resilience for Well-Structured Graph Transformation Systems (Q6487305) (← links)