{"id":13748933,"url":"https://github.com/AzeezDa/ceetle","last_synced_at":"2025-05-09T11:31:40.531Z","repository":{"id":116637746,"uuid":"580167144","full_name":"AzeezDa/ceetle","owner":"AzeezDa","description":"A Rust Library for defining models in Computational Tree Logic and verifying their semantics","archived":false,"fork":false,"pushed_at":"2023-06-06T09:41:38.000Z","size":38,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-05-08T19:38:35.882Z","etag":null,"topics":["ctl","logic","rust","verification"],"latest_commit_sha":null,"homepage":"https://docs.rs/ceetle/0.1.0/ceetle/","language":"Rust","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/AzeezDa.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2022-12-19T22:09:24.000Z","updated_at":"2023-06-15T14:34:17.000Z","dependencies_parsed_at":null,"dependency_job_id":"ff833279-930d-4eef-b1f6-d1164694dcb7","html_url":"https://github.com/AzeezDa/ceetle","commit_stats":{"total_commits":16,"total_committers":2,"mean_commits":8.0,"dds":0.125,"last_synced_commit":"acc1ac1ce9d894a9bec4ea0cbc281a3e2133de54"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AzeezDa%2Fceetle","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AzeezDa%2Fceetle/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AzeezDa%2Fceetle/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AzeezDa%2Fceetle/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/AzeezDa","download_url":"https://codeload.github.com/AzeezDa/ceetle/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":253240350,"owners_count":21876593,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["ctl","logic","rust","verification"],"created_at":"2024-08-03T07:00:52.747Z","updated_at":"2025-05-09T11:31:35.641Z","avatar_url":"https://github.com/AzeezDa.png","language":"Rust","funding_links":[],"categories":["Projects"],"sub_categories":["Verification"],"readme":"# `ceetle` - A Computional Tree Logic Verifier\nA Rust Library for defining models in Computational Tree Logic and verifying their semantics. See [Wikipedia](https://en.wikipedia.org/wiki/Computation_tree_logic) to learn more.\n\nThe library is **passively-maintained**, which means there will be no other features added however issues on the GitHub will be answered and solved.\nContributions and feedback to this library are more than welcome! \n\n## Examples\nConsider the figure below. \n\n![Finite State Machine](/images/fsm.png)\n\nTo build it as a model in the library we do this:\n\n```rust\nuse ceetle::{HashedDiscreteModel, ctl, CTLFormula, verify};\n\nlet model = HashedDiscreteModel::new(HashMap::from_iter(vec![\n    // (state, (atoms, transitions))\n    (\"s0\", (vec![\"p\", \"q\"],      vec![\"s1\"])),\n    (\"s1\", (vec![\"p\"],           vec![\"s0\", \"s3\"])),\n    (\"s2\", (vec![\"p\", \"q\"],      vec![\"s2\"])),\n    (\"s3\", (vec![\"p\", \"r\", \"s\"], vec![\"s2\"]))\n]));\n```\n\nTo verify the formula $S_0\\models \\text{AG}(p)$, we do:\n```rust\nverify(\u0026model, \u0026\"s0\", \u0026ctl!(AG(Atom(\"p\")))); // Evaluates to true\n```\n\nTo verify the formula $S_0 \\models \\text{EF(AG}(p \\land q))$, we do:\n\n```rust\nverify(\u0026model, \u0026\"s0\", \u0026ctl!(EF(AG(And(Atom(\"p\"), Atom(\"q\")))))); // Evaluates to true\n```","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2FAzeezDa%2Fceetle","html_url":"https://awesome.ecosyste.ms/projects/github.com%2FAzeezDa%2Fceetle","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2FAzeezDa%2Fceetle/lists"}