The Complexity of Coverability-Like Problems in Elementary Object Systems: Data-Nets to the Rescue

Francesco Di Cosmo, Soumodev Mal, Tephilla Prince

Elementary Object Systems (EOSs) are a model in the nets-within-nets (NWNs) paradigm, where tokens in turn can host standard Petri nets. We study the complexity of coverability-lik…