{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5R3HLAJGB4DHYS5XBPFVNPTWNM","short_pith_number":"pith:5R3HLAJG","schema_version":"1.0","canonical_sha256":"ec767581260f067c4bb70bcb56be766b043de81785c8a62394bd0e4b5f33e05f","source":{"kind":"arxiv","id":"1501.04777","version":1},"attestation_state":"computed","paper":{"title":"Transformation From Legal-marking Set to Admissible-marking Set of Petri Nets With Uncontrollable Transitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Carla Seatsu, Dan You, Mengchu Zhou, Shouguang Wang","submitted_at":"2015-01-20T12:21:13Z","abstract_excerpt":"Linear constraint transformation is an essential step to solve the forbidden state problem in Petri nets that contain uncontrollable transitions. This work studies the equivalent transformation from a legal-marking set to its admissible-marking set given such a net. First, the concepts of an escaping-marking set and a transforming marking set are defined. Based on them, two algorithms are given to compute the admissible-marking set and the transforming marking set, which establish the theoretical foundation for the equivalent transformation of linear constraints. Second, the theory about the e"},"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":"1501.04777","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-01-20T12:21:13Z","cross_cats_sorted":[],"title_canon_sha256":"1e5e2b7fd3f878713e1bedaee052fb51ee56e62eb0f1e7e26403d33f6ae3ce3f","abstract_canon_sha256":"7b1950e7b91a731f1694680d1cad5dbe01e0c456a1eaf21bab3ddb301fad38bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:02.866839Z","signature_b64":"nJKV+6rXBR+8afksYOfRJp29Y8G6GzOsqMI2NajQhfmCZlZPYEI2LByCN6Gl5LNyZQYxArqUe3CwjtiC/ImFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec767581260f067c4bb70bcb56be766b043de81785c8a62394bd0e4b5f33e05f","last_reissued_at":"2026-05-18T02:29:02.866412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:02.866412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transformation From Legal-marking Set to Admissible-marking Set of Petri Nets With Uncontrollable Transitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Carla Seatsu, Dan You, Mengchu Zhou, Shouguang Wang","submitted_at":"2015-01-20T12:21:13Z","abstract_excerpt":"Linear constraint transformation is an essential step to solve the forbidden state problem in Petri nets that contain uncontrollable transitions. This work studies the equivalent transformation from a legal-marking set to its admissible-marking set given such a net. First, the concepts of an escaping-marking set and a transforming marking set are defined. Based on them, two algorithms are given to compute the admissible-marking set and the transforming marking set, which establish the theoretical foundation for the equivalent transformation of linear constraints. Second, the theory about the e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04777","kind":"arxiv","version":1},"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":"1501.04777","created_at":"2026-05-18T02:29:02.866476+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.04777v1","created_at":"2026-05-18T02:29:02.866476+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04777","created_at":"2026-05-18T02:29:02.866476+00:00"},{"alias_kind":"pith_short_12","alias_value":"5R3HLAJGB4DH","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5R3HLAJGB4DHYS5X","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5R3HLAJG","created_at":"2026-05-18T12:29:05.191682+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/5R3HLAJGB4DHYS5XBPFVNPTWNM","json":"https://pith.science/pith/5R3HLAJGB4DHYS5XBPFVNPTWNM.json","graph_json":"https://pith.science/api/pith-number/5R3HLAJGB4DHYS5XBPFVNPTWNM/graph.json","events_json":"https://pith.science/api/pith-number/5R3HLAJGB4DHYS5XBPFVNPTWNM/events.json","paper":"https://pith.science/paper/5R3HLAJG"},"agent_actions":{"view_html":"https://pith.science/pith/5R3HLAJGB4DHYS5XBPFVNPTWNM","download_json":"https://pith.science/pith/5R3HLAJGB4DHYS5XBPFVNPTWNM.json","view_paper":"https://pith.science/paper/5R3HLAJG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.04777&json=true","fetch_graph":"https://pith.science/api/pith-number/5R3HLAJGB4DHYS5XBPFVNPTWNM/graph.json","fetch_events":"https://pith.science/api/pith-number/5R3HLAJGB4DHYS5XBPFVNPTWNM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5R3HLAJGB4DHYS5XBPFVNPTWNM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5R3HLAJGB4DHYS5XBPFVNPTWNM/action/storage_attestation","attest_author":"https://pith.science/pith/5R3HLAJGB4DHYS5XBPFVNPTWNM/action/author_attestation","sign_citation":"https://pith.science/pith/5R3HLAJGB4DHYS5XBPFVNPTWNM/action/citation_signature","submit_replication":"https://pith.science/pith/5R3HLAJGB4DHYS5XBPFVNPTWNM/action/replication_record"}},"created_at":"2026-05-18T02:29:02.866476+00:00","updated_at":"2026-05-18T02:29:02.866476+00:00"}