Pages that link to "Item:Q1763373"
From MaRDI portal
The following pages link to A well-structured framework for analysing Petri net extensions (Q1763373):
Displaying 17 items.
- Forward analysis and model checking for trace bounded WSTS (Q290914) (← links)
- Ordinal recursive complexity of unordered data nets (Q529043) (← links)
- A classification of the expressive power of well-structured transition systems (Q553290) (← links)
- Multiset rewriting for the verification of depth-bounded processes with name binding (Q714507) (← links)
- Applying regions (Q728281) (← links)
- Handling infinitely branching well-structured transition systems (Q1686118) (← links)
- Branch-well-structured transition systems and extensions (Q2165211) (← links)
- Computable fixpoints in well-structured symbolic model checking (Q2248074) (← links)
- Combining free choice and time in Petri nets (Q2291812) (← links)
- Coverability Trees for Petri Nets with Unordered Data (Q2811357) (← links)
- Synthesis of Petri Nets with Whole-Place Operations and Localities (Q3179395) (← links)
- A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations (Q3618568) (← links)
- About the decision of reachability for register machines (Q4405553) (← links)
- Dynamic Recursive Petri Nets (Q5100760) (← links)
- (Q5114831) (← links)
- (Q5136306) (← links)
- Automatic Verification of Counter Systems With Ranking Function (Q5179052) (← links)
