{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GMB5E45QQ2ET3ZEAR3XVKOZRYF","short_pith_number":"pith:GMB5E45Q","schema_version":"1.0","canonical_sha256":"3303d273b086893de4808eef553b31c15fb8bb49c847de48a9ef6edee0201091","source":{"kind":"arxiv","id":"1808.00261","version":2},"attestation_state":"computed","paper":{"title":"Critical Observability for Automata and Petri Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.SY","authors_text":"Tom\\'a\\v{s} Masopust","submitted_at":"2018-08-01T10:53:34Z","abstract_excerpt":"Critical observability is a property of cyber-physical systems to detect whether the current state belongs to a set of critical states. In safety-critical applications, critical states model operations that may be unsafe or of a particular interest. De Santis et al. introduced critical observability for linear switching systems, and Pola et al. adapted it for discrete-event systems, focusing on algorithmic complexity. We study the computational complexity of deciding critical observability for systems modeled as (networks of) finite-state automata and Petri nets. We show that deciding critical"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1808.00261","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-08-01T10:53:34Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"db81988d2b57721c78e8ade9b38f09301ec5aa7058765f444c351ea6de26f641","abstract_canon_sha256":"d2d75c69fe58a96ed48ddc28325415d7e4fd70b4855c016c1485c643b7cb2a43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:22.535335Z","signature_b64":"6Ki3nRuuTs8coQBMFERylPk1s9A7PR7CrKPN2tHhK6xnA6Kb6+BRkhg9JRl4wsGEf7NM0pEn7TwLs4a66rVcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3303d273b086893de4808eef553b31c15fb8bb49c847de48a9ef6edee0201091","last_reissued_at":"2026-05-17T23:48:22.534795Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:22.534795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Critical Observability for Automata and Petri Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.SY","authors_text":"Tom\\'a\\v{s} Masopust","submitted_at":"2018-08-01T10:53:34Z","abstract_excerpt":"Critical observability is a property of cyber-physical systems to detect whether the current state belongs to a set of critical states. In safety-critical applications, critical states model operations that may be unsafe or of a particular interest. De Santis et al. introduced critical observability for linear switching systems, and Pola et al. adapted it for discrete-event systems, focusing on algorithmic complexity. We study the computational complexity of deciding critical observability for systems modeled as (networks of) finite-state automata and Petri nets. We show that deciding critical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00261","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.00261","created_at":"2026-05-17T23:48:22.534878+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.00261v2","created_at":"2026-05-17T23:48:22.534878+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00261","created_at":"2026-05-17T23:48:22.534878+00:00"},{"alias_kind":"pith_short_12","alias_value":"GMB5E45QQ2ET","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GMB5E45QQ2ET3ZEA","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GMB5E45Q","created_at":"2026-05-18T12:32:25.280505+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GMB5E45QQ2ET3ZEAR3XVKOZRYF","json":"https://pith.science/pith/GMB5E45QQ2ET3ZEAR3XVKOZRYF.json","graph_json":"https://pith.science/api/pith-number/GMB5E45QQ2ET3ZEAR3XVKOZRYF/graph.json","events_json":"https://pith.science/api/pith-number/GMB5E45QQ2ET3ZEAR3XVKOZRYF/events.json","paper":"https://pith.science/paper/GMB5E45Q"},"agent_actions":{"view_html":"https://pith.science/pith/GMB5E45QQ2ET3ZEAR3XVKOZRYF","download_json":"https://pith.science/pith/GMB5E45QQ2ET3ZEAR3XVKOZRYF.json","view_paper":"https://pith.science/paper/GMB5E45Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.00261&json=true","fetch_graph":"https://pith.science/api/pith-number/GMB5E45QQ2ET3ZEAR3XVKOZRYF/graph.json","fetch_events":"https://pith.science/api/pith-number/GMB5E45QQ2ET3ZEAR3XVKOZRYF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GMB5E45QQ2ET3ZEAR3XVKOZRYF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GMB5E45QQ2ET3ZEAR3XVKOZRYF/action/storage_attestation","attest_author":"https://pith.science/pith/GMB5E45QQ2ET3ZEAR3XVKOZRYF/action/author_attestation","sign_citation":"https://pith.science/pith/GMB5E45QQ2ET3ZEAR3XVKOZRYF/action/citation_signature","submit_replication":"https://pith.science/pith/GMB5E45QQ2ET3ZEAR3XVKOZRYF/action/replication_record"}},"created_at":"2026-05-17T23:48:22.534878+00:00","updated_at":"2026-05-17T23:48:22.534878+00:00"}