Showing 2026Show all
2 papers · 1 filter
cs.CC2026
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…
cs.LO2026
Verification of Unbounded Client-Server Systems with Distinguishable Clients
Ramchandra Phawade, Tephilla Prince, S Sheerazuddin
Client-server systems are a computing paradigm in concurrent and distributed systems. We deal with unbounded client-server systems (UCS) where all clients are of the same type, int…