4 papers
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…
Nets-within-Nets through the Lens of Data Nets
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 the reachability…
A Lower Bound on Conservative Elementary Object Systems Coverability
Francesco Di Cosmo, Soumodev Mal, Tephilla Prince
Elementary Object Systems (EOS) are a form of Petri Net (PN) where tokens carry internal PN. This model has been recently proposed for analysis of robustness of Multi Agent Systems…
Satisfiability of Context-free String Constraints with Subword-ordering and Transducers
C Aiswarya, Soumodev Mal, Prakash Saivasan
We study the satisfiability of string constraints where context-free membership constraints may be imposed on variables. Additionally a variable may be constrained to be a subword…