{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YJ3NG672WICMIJPZKCHROT2P23","short_pith_number":"pith:YJ3NG672","schema_version":"1.0","canonical_sha256":"c276d37bfab204c425f9508f174f4fd6f75dad66bb6987d0ac7b34f80ed7a822","source":{"kind":"arxiv","id":"1207.1272","version":1},"attestation_state":"computed","paper":{"title":"UPPAAL-SMC: Statistical Model Checking for Priced Timed Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Aalborg University, Alexandre David (Aalborg University, Axel Legay (INRIA Rennes, China), Danny B{\\o}gsted Poulsen (Aalborg University, Denmark), France, Kim Gulstrand Larsen (Aalborg University, Marius Miku\\v{c}ionis (Aalborg University, Peter Bulychev (Aalborg University, Zheng Wang (East China Normal University","submitted_at":"2012-07-04T01:24:21Z","abstract_excerpt":"This paper offers a survey of uppaalsmc, a major extension of the real-time  verification tool uppaal. uppaalsmc allows for the efficient analysis of performance properties of networks of priced timed automata under a natural stochastic semantics.  In particular, uppaalsmc relies on a series of extensions of the statistical model checking  approach generalized to handle real-time  systems and estimate undecidable problems. uppaalsmc comes together with a friendly user interface that allows a user to specify complex problems in an efficient manner as well as to get feedback in the form of proba"},"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":"1207.1272","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-07-04T01:24:21Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"a0a1c4d541033e1c63b1aca4684d45ef57b33bf5086a017e7e036fec51bf608f","abstract_canon_sha256":"02deb030dfb4c5956d86fa039baf5c109f1f346c88a2cfb1e6589067661ede16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:46.464023Z","signature_b64":"EMo81UpICvAmqtx5ZljnBVOk6+VS2Iu0kj50jlhw+wzCRqyKJnnUQcgvGQY356y4XbDF0HZ9TiGNY87tiSxBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c276d37bfab204c425f9508f174f4fd6f75dad66bb6987d0ac7b34f80ed7a822","last_reissued_at":"2026-05-18T03:51:46.463357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:46.463357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"UPPAAL-SMC: Statistical Model Checking for Priced Timed Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Aalborg University, Alexandre David (Aalborg University, Axel Legay (INRIA Rennes, China), Danny B{\\o}gsted Poulsen (Aalborg University, Denmark), France, Kim Gulstrand Larsen (Aalborg University, Marius Miku\\v{c}ionis (Aalborg University, Peter Bulychev (Aalborg University, Zheng Wang (East China Normal University","submitted_at":"2012-07-04T01:24:21Z","abstract_excerpt":"This paper offers a survey of uppaalsmc, a major extension of the real-time  verification tool uppaal. uppaalsmc allows for the efficient analysis of performance properties of networks of priced timed automata under a natural stochastic semantics.  In particular, uppaalsmc relies on a series of extensions of the statistical model checking  approach generalized to handle real-time  systems and estimate undecidable problems. uppaalsmc comes together with a friendly user interface that allows a user to specify complex problems in an efficient manner as well as to get feedback in the form of proba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1272","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":"1207.1272","created_at":"2026-05-18T03:51:46.463469+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.1272v1","created_at":"2026-05-18T03:51:46.463469+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1272","created_at":"2026-05-18T03:51:46.463469+00:00"},{"alias_kind":"pith_short_12","alias_value":"YJ3NG672WICM","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"YJ3NG672WICMIJPZ","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"YJ3NG672","created_at":"2026-05-18T12:27:27.928770+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/YJ3NG672WICMIJPZKCHROT2P23","json":"https://pith.science/pith/YJ3NG672WICMIJPZKCHROT2P23.json","graph_json":"https://pith.science/api/pith-number/YJ3NG672WICMIJPZKCHROT2P23/graph.json","events_json":"https://pith.science/api/pith-number/YJ3NG672WICMIJPZKCHROT2P23/events.json","paper":"https://pith.science/paper/YJ3NG672"},"agent_actions":{"view_html":"https://pith.science/pith/YJ3NG672WICMIJPZKCHROT2P23","download_json":"https://pith.science/pith/YJ3NG672WICMIJPZKCHROT2P23.json","view_paper":"https://pith.science/paper/YJ3NG672","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.1272&json=true","fetch_graph":"https://pith.science/api/pith-number/YJ3NG672WICMIJPZKCHROT2P23/graph.json","fetch_events":"https://pith.science/api/pith-number/YJ3NG672WICMIJPZKCHROT2P23/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YJ3NG672WICMIJPZKCHROT2P23/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YJ3NG672WICMIJPZKCHROT2P23/action/storage_attestation","attest_author":"https://pith.science/pith/YJ3NG672WICMIJPZKCHROT2P23/action/author_attestation","sign_citation":"https://pith.science/pith/YJ3NG672WICMIJPZKCHROT2P23/action/citation_signature","submit_replication":"https://pith.science/pith/YJ3NG672WICMIJPZKCHROT2P23/action/replication_record"}},"created_at":"2026-05-18T03:51:46.463469+00:00","updated_at":"2026-05-18T03:51:46.463469+00:00"}