arXiv (All)
open access
The Complexity of Coverability-Like Problems in Elementary Object Systems: Data-Nets to the Rescue
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-like problems, including termination and boundedness, over EOSs. Since coverability and boundedness are undecidable in gene
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Complexity of Coverability-Like Problems in Elementary Object Systems: Data-Nets to the Rescue#796980
- On Structural Residuals in the P versus NP Problem#89748
- Are we Theseus ships?#694805
- Structural Emergence Limits#92706
- The Cross-Domain Inviolability Principle: The Ontological Boundaries of Organizational Levels and the Deep Grammar of Longevity#695664
Record · ID 798393
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive