{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WOOEWLTPT7SL4GC2O7VJBQ33R5","short_pith_number":"pith:WOOEWLTP","schema_version":"1.0","canonical_sha256":"b39c4b2e6f9fe4be185a77ea90c37b8f74a15901676a103fc88b82a96f68d15d","source":{"kind":"arxiv","id":"1304.7209","version":1},"attestation_state":"computed","paper":{"title":"Bounded Model Checking of an MITL Fragment for Timed Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ilkka Niemel\\\"a, Roland Kindermann, Tommi Junttila","submitted_at":"2013-04-26T15:52:38Z","abstract_excerpt":"Timed automata (TAs) are a common formalism for modeling timed systems. Bounded model checking (BMC) is a verification method that searches for runs violating a property using a SAT or SMT solver. MITL is a real-time extension of the linear time logic LTL. Originally, MITL was defined for traces of non-overlapping time intervals rather than the \"super-dense\" time traces allowing for intervals overlapping in single points that are employed by the nowadays common semantics of timed automata. In this paper we extend the semantics of a fragment of MITL to super-dense time traces and devise a bound"},"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":"1304.7209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-26T15:52:38Z","cross_cats_sorted":[],"title_canon_sha256":"4e5ebf9b5f41cc0525489d88529a938f4d4c54860f713b173c213feba9084638","abstract_canon_sha256":"c15d4b4119615644cf98bfa99b2b0aa2b3f27da2af103b3892200e4ca0201954"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:02.297898Z","signature_b64":"7BB6IPNzor527wG1E1Xgtm8RqYGwzbOrA53XWHf5fsVRH9YKZ6yYFvIqFjWPUXP0xsJ0JcYD0VWitet716d1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b39c4b2e6f9fe4be185a77ea90c37b8f74a15901676a103fc88b82a96f68d15d","last_reissued_at":"2026-05-18T03:27:02.297233Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:02.297233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounded Model Checking of an MITL Fragment for Timed Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ilkka Niemel\\\"a, Roland Kindermann, Tommi Junttila","submitted_at":"2013-04-26T15:52:38Z","abstract_excerpt":"Timed automata (TAs) are a common formalism for modeling timed systems. Bounded model checking (BMC) is a verification method that searches for runs violating a property using a SAT or SMT solver. MITL is a real-time extension of the linear time logic LTL. Originally, MITL was defined for traces of non-overlapping time intervals rather than the \"super-dense\" time traces allowing for intervals overlapping in single points that are employed by the nowadays common semantics of timed automata. In this paper we extend the semantics of a fragment of MITL to super-dense time traces and devise a bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7209","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":"1304.7209","created_at":"2026-05-18T03:27:02.297333+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.7209v1","created_at":"2026-05-18T03:27:02.297333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7209","created_at":"2026-05-18T03:27:02.297333+00:00"},{"alias_kind":"pith_short_12","alias_value":"WOOEWLTPT7SL","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WOOEWLTPT7SL4GC2","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WOOEWLTP","created_at":"2026-05-18T12:28:04.890932+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/WOOEWLTPT7SL4GC2O7VJBQ33R5","json":"https://pith.science/pith/WOOEWLTPT7SL4GC2O7VJBQ33R5.json","graph_json":"https://pith.science/api/pith-number/WOOEWLTPT7SL4GC2O7VJBQ33R5/graph.json","events_json":"https://pith.science/api/pith-number/WOOEWLTPT7SL4GC2O7VJBQ33R5/events.json","paper":"https://pith.science/paper/WOOEWLTP"},"agent_actions":{"view_html":"https://pith.science/pith/WOOEWLTPT7SL4GC2O7VJBQ33R5","download_json":"https://pith.science/pith/WOOEWLTPT7SL4GC2O7VJBQ33R5.json","view_paper":"https://pith.science/paper/WOOEWLTP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.7209&json=true","fetch_graph":"https://pith.science/api/pith-number/WOOEWLTPT7SL4GC2O7VJBQ33R5/graph.json","fetch_events":"https://pith.science/api/pith-number/WOOEWLTPT7SL4GC2O7VJBQ33R5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WOOEWLTPT7SL4GC2O7VJBQ33R5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WOOEWLTPT7SL4GC2O7VJBQ33R5/action/storage_attestation","attest_author":"https://pith.science/pith/WOOEWLTPT7SL4GC2O7VJBQ33R5/action/author_attestation","sign_citation":"https://pith.science/pith/WOOEWLTPT7SL4GC2O7VJBQ33R5/action/citation_signature","submit_replication":"https://pith.science/pith/WOOEWLTPT7SL4GC2O7VJBQ33R5/action/replication_record"}},"created_at":"2026-05-18T03:27:02.297333+00:00","updated_at":"2026-05-18T03:27:02.297333+00:00"}