Pages that link to "Item:Q3084987"
From MaRDI portal
The following pages link to Decidability Problems in Petri Nets with Names and Replication (Q3084987):
Displaying 5 items.
- Decidability and complexity of Petri nets with unordered data (Q554219) (← links)
- Multiset rewriting for the verification of depth-bounded processes with name binding (Q714507) (← links)
- Aligning event logs to resource-constrained \(\nu \)-Petri nets (Q2165247) (← links)
- Petri nets with name creation for transient secure association (Q2510386) (← links)
- Exact and approximated log alignments for processes with inter-case dependencies (Q6535188) (← links)
