1 citations · 1 across the 2 of their papers we have counts for
2 papers
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.LO2023★ 1 cited
Verification of Sometimes Termination of Lazy-Bounded Declarative Distributed Systems
Francesco Di Cosmo
Declarative Distributed Systems (DDSs) are distributed systems grounded in logic programming. Although DDS model-checking is undecidable in general, we detect decidable cases by tw…