omega
Specify and synthesize systems using symbolic algorithms
Science Score: 36.0%
This score indicates how likely this project is to be science-related based on various indicators:
-
○CITATION.cff file
-
✓codemeta.json file
Found codemeta.json file -
○.zenodo.json file
-
✓DOI references
Found 22 DOI reference(s) in README -
○Academic publication links
-
✓Committers with academic emails
1 of 3 committers (33.3%) from academic institutions -
○Institutional organization owner
-
○JOSS paper metadata
-
○Scientific vocabulary similarity
Low similarity (7.2%) to scientific vocabulary
Keywords
Keywords from Contributors
Repository
Specify and synthesize systems using symbolic algorithms
Basic Info
- Host: GitHub
- Owner: tulip-control
- License: other
- Language: Python
- Default Branch: main
- Homepage: https://pypi.org/project/omega
- Size: 899 KB
Statistics
- Stars: 50
- Watchers: 4
- Forks: 5
- Open Issues: 5
- Releases: 0
Topics
Metadata Files
README.md
About
A package of symbolic algorithms using binary decision diagrams (BDDs) for synthesizing implementations from temporal logic specifications. This is useful for designing systems, especially vehicles that carry humans.
Synthesis algorithms for Moore or Mealy implementations of:
- generalized Streett(1) specifications (known as GR(1))
- generalized Rabin(1) specifications (counter-strategies to GR(1))
- detection of trivial realizability in GR(1) specifications.
See omega.games.gr1 and the example gr1_synthesis_intro.
Enumeration of state machines (as
networkxgraphs) from the synthesized symbolic implementations. Seeomega.games.enumeration.Facilities to simulate the resulting implementations with little and readable user code. See
omega.stepsand the examplemoore_moore.Code generation for the synthesized symbolic implementations. This code is correct-by-construction. See
omega.symbolic.codegen.Minimal covering with a symbolic algorithm to find a minimal cover, and to enumerate all minimal covers. Used to convert BDDs to minimal formulas. See
omega.symbolic.coverandomega.symbolic.cover_enum, and the exampleminimal_formula_from_bdd.First-order linear temporal logic (LTL) with rigid quantification and substitution. See
omega.logic.lexyacc,omega.logic.ast, andomega.logic.syntax.Bitblaster of quantified integer arithmetic (integers -> bits). See
omega.logic.bitvector.Translation from past to future LTL, using temporal testers. See
omega.logic.past.Symbolic automata that manage first-order formulas by seamlessly using binary decision diagrams (BDDs) underneath. You can:
- declare variables and constants
- translate:
- formulas to BDDs and
- BDDs to minimal formulas via minimal covering
- quantify
- substitute
- prime/unprime variables
- get the support of predicates
- pick satisfying assignments (or work with iterators)
- define operators
See omega.symbolic.temporal and omega.symbolic.fol for more details.
Facilities to write symbolic fixpoint algorithms. See
omega.symbolic.fixpointandomega.symbolic.prime, and the examplereachability_solver.Conversion from graphs annotated with formulas to temporal logic formulas. These graphs can help specify transition relations. The translation is in the spirit of predicate-action diagrams.
See omega.symbolic.logicizer and omega.automata for more details, and
the example symbolic.
- Enumeration and plotting of state predicates and actions represented as BDDs.
See
omega.symbolic.enumeration.
Documentation
In doc/doc.md.
Examples
```python import omega.symbolic.fol as _fol
ctx = fol.Context() ctx.declare( x=(0, 10), y=(-2, 5), z='bool') u = ctx.addexpr( r'(x <= 2) /\ (y >= -1)') v = ctx.addexpr( r'(y <= 3) => (x > 7)') r = u & ~ v expr = ctx.toexpr(r) print(expr) ```
Installation
pip install omega
The package and its dependencies are pure Python.
For solving demanding games, install the Cython module dd.cudd
that interfaces to CUDD.
Instructions are available at dd.
License
BSD-3, see LICENSE file.
Owner
- Name: Temporal Logic Planning (TuLiP) toolbox
- Login: tulip-control
- Kind: organization
- Repositories: 7
- Profile: https://github.com/tulip-control
GitHub Events
Total
- Watch event: 6
- Fork event: 1
Last Year
- Watch event: 6
- Fork event: 1
Committers
Last synced: over 1 year ago
Top Committers
| Name | Commits | |
|---|---|---|
| Ioannis Filippidis | j****s@g****m | 918 |
| Scott C. Livingston | s****n@c****u | 3 |
| Nok Wongpiromsarn | t****n@g****m | 1 |
Committer Domains (Top 20 + Academic)
Issues and Pull Requests
Last synced: 6 months ago
All Time
- Total issues: 13
- Total pull requests: 1
- Average time to close issues: 6 months
- Average time to close pull requests: 10 days
- Total issue authors: 5
- Total pull request authors: 1
- Average comments per issue: 1.69
- Average comments per pull request: 9.0
- Merged pull requests: 1
- Bot issues: 0
- Bot pull requests: 0
Past Year
- Issues: 0
- Pull requests: 0
- Average time to close issues: N/A
- Average time to close pull requests: N/A
- Issue authors: 0
- Pull request authors: 0
- Average comments per issue: 0
- Average comments per pull request: 0
- Merged pull requests: 0
- Bot issues: 0
- Bot pull requests: 0
Top Authors
Issue Authors
- johnyf (7)
- glarange (2)
- slivingston (2)
- thisiscam (1)
- DangMinh24 (1)
Pull Request Authors
- tichakornw (1)
Top Labels
Issue Labels
Pull Request Labels
Packages
- Total packages: 1
-
Total downloads:
- pypi 80,121 last-month
- Total dependent packages: 2
- Total dependent repositories: 9
- Total versions: 19
- Total maintainers: 3
pypi.org: omega
Symbolic algorithms for solving games of infinite duration.
- Homepage: https://github.com/tulip-control/omega
- Documentation: https://github.com/tulip-control/omega/blob/main/doc/doc.md
- License: BSD
-
Latest release: 0.4.0
published about 2 years ago
Rankings
Maintainers (3)
Dependencies
- gitpython *
- astutils *
- dd *
- humanize *
- natsort *
- networkx *
- ply *
- pydot *
- actions/checkout v2 composite
- actions/setup-python v2 composite