Pages that link to "Item:Q2864393"
From MaRDI portal
The following pages link to On the expressiveness of mobile synchronizing Petri nets (Q2864393):
Displaying 9 items.
- Ordinal recursive complexity of unordered data nets (Q529043) (← links)
- Decidability and complexity of Petri nets with unordered data (Q554219) (← links)
- Aligning event logs to resource-constrained \(\nu \)-Petri nets (Q2165247) (← links)
- Hoare vs Milner: comparing synchronizations in a graphical framework with mobility (Q2852051) (← links)
- Coding mobile synchronizing Petri nets into rewriting logic (Q2864520) (← links)
- Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication (Q3636840) (← links)
- Mobile Petri nets (Q3655764) (← links)
- Formal Techniques for Networked and Distributed Systems - FORTE 2005 (Q5479155) (← links)
- Exact and approximated log alignments for processes with inter-case dependencies (Q6535188) (← links)