{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4R3F2RV35DD7DLGAEBYQNHQ356","short_pith_number":"pith:4R3F2RV3","schema_version":"1.0","canonical_sha256":"e4765d46bbe8c7f1acc02071069e1bef9b7bdd05371c97ff56e797e25ac06227","source":{"kind":"arxiv","id":"1204.5639","version":1},"attestation_state":"computed","paper":{"title":"SMT-based Induction Methods for Timed Systems","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":"2012-04-25T12:49:11Z","abstract_excerpt":"Modeling time related aspects is important in many applications of verification methods. For precise results, it is necessary to interpret time as a dense domain, e.g. using timed automata as a formalism, even though the system's resulting infinite state space is challenging for verification methods. Furthermore, fully symbolic treatment of both timing related and non-timing related elements of the state space seems to offer an attractive approach to model checking timed systems with a large amount of non-determinism. This paper presents an SMT-based timed system extension to the IC3 algorithm"},"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":"1204.5639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-04-25T12:49:11Z","cross_cats_sorted":[],"title_canon_sha256":"cfe5f2b3e9bad55414c4c5436bd1314ef0edd17511b36087860d15542df8ae80","abstract_canon_sha256":"0e542aa070dd513218a4f4b9116fcdeb0021e3995d418a3e99746d86a8c7ed29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:01.822439Z","signature_b64":"QtXCMNXmRXqwpA5bpKzMxA8KCkmR+DwvTFsXq/e7p/BUtuZltYDoCfdTrK3COiOiN8Th5hH86mLwIAzoNMsQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4765d46bbe8c7f1acc02071069e1bef9b7bdd05371c97ff56e797e25ac06227","last_reissued_at":"2026-05-18T03:57:01.821654Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:01.821654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SMT-based Induction Methods for Timed Systems","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":"2012-04-25T12:49:11Z","abstract_excerpt":"Modeling time related aspects is important in many applications of verification methods. For precise results, it is necessary to interpret time as a dense domain, e.g. using timed automata as a formalism, even though the system's resulting infinite state space is challenging for verification methods. Furthermore, fully symbolic treatment of both timing related and non-timing related elements of the state space seems to offer an attractive approach to model checking timed systems with a large amount of non-determinism. This paper presents an SMT-based timed system extension to the IC3 algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5639","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":"1204.5639","created_at":"2026-05-18T03:57:01.821791+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.5639v1","created_at":"2026-05-18T03:57:01.821791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5639","created_at":"2026-05-18T03:57:01.821791+00:00"},{"alias_kind":"pith_short_12","alias_value":"4R3F2RV35DD7","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4R3F2RV35DD7DLGA","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4R3F2RV3","created_at":"2026-05-18T12:26:53.410803+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/4R3F2RV35DD7DLGAEBYQNHQ356","json":"https://pith.science/pith/4R3F2RV35DD7DLGAEBYQNHQ356.json","graph_json":"https://pith.science/api/pith-number/4R3F2RV35DD7DLGAEBYQNHQ356/graph.json","events_json":"https://pith.science/api/pith-number/4R3F2RV35DD7DLGAEBYQNHQ356/events.json","paper":"https://pith.science/paper/4R3F2RV3"},"agent_actions":{"view_html":"https://pith.science/pith/4R3F2RV35DD7DLGAEBYQNHQ356","download_json":"https://pith.science/pith/4R3F2RV35DD7DLGAEBYQNHQ356.json","view_paper":"https://pith.science/paper/4R3F2RV3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.5639&json=true","fetch_graph":"https://pith.science/api/pith-number/4R3F2RV35DD7DLGAEBYQNHQ356/graph.json","fetch_events":"https://pith.science/api/pith-number/4R3F2RV35DD7DLGAEBYQNHQ356/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4R3F2RV35DD7DLGAEBYQNHQ356/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4R3F2RV35DD7DLGAEBYQNHQ356/action/storage_attestation","attest_author":"https://pith.science/pith/4R3F2RV35DD7DLGAEBYQNHQ356/action/author_attestation","sign_citation":"https://pith.science/pith/4R3F2RV35DD7DLGAEBYQNHQ356/action/citation_signature","submit_replication":"https://pith.science/pith/4R3F2RV35DD7DLGAEBYQNHQ356/action/replication_record"}},"created_at":"2026-05-18T03:57:01.821791+00:00","updated_at":"2026-05-18T03:57:01.821791+00:00"}