Pages that link to "Item:Q914407"
From MaRDI portal
The following pages link to Decidability of a temporal logic problem for Petri nets (Q914407):
Displaying 12 items.
- Undecidability of bisimilarity for Petri nets and some related problems (Q672326) (← links)
- A taxonomy of fairness and temporal logic problems for Petri nets (Q805257) (← links)
- Model checking of systems with many identical timed processes (Q1853589) (← links)
- Process rewrite systems. (Q1854328) (← links)
- Algorithmic analysis of programs with well quasi-ordered domains. (Q1854355) (← links)
- Petri nets and regular processes (Q1970202) (← links)
- Petri nets with name creation for transient secure association (Q2510386) (← links)
- Minimal Cost Reachability/Coverability in Priced Timed Petri Nets (Q3617740) (← links)
- (Q5207052) (← links)
- On the complexity of resource-bounded logics (Q5915568) (← links)
- Ensuring completeness of symbolic verification methods for infinite-state systems (Q5941104) (← links)
- Deciding bisimulation-like equivalences with finite-state processes (Q5941202) (← links)
