Pith. sign in

REVIEW 2 cited by

A Flexible and Efficient Temporal Logic Tool for Python: PyTeLo

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.08714 v1 pith:HYLYW4W6 submitted 2023-10-12 cs.LO cs.RO

classification cs.LOcs.RO
keywords temporallogicpytelospecificationsynthesistoolwstlabstract
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Temporal logic is an important tool for specifying complex behaviors of systems. It can be used to define properties for verification and monitoring, as well as goals for synthesis tools, allowing users to specify rich missions and tasks. Some of the most popular temporal logics include Metric Temporal Logic (MTL), Signal Temporal Logic (STL), and weighted STL (wSTL), which also allow the definition of timing constraints. In this work, we introduce PyTeLo, a modular and versatile Python-based software that facilitates working with temporal logic languages, specifically MTL, STL, and wSTL. Applying PyTeLo requires only a string representation of the temporal logic specification and, optionally, the dynamics of the system of interest. Next, PyTeLo reads the specification using an ANTLR-generated parser and generates an Abstract Syntax Tree (AST) that captures the structure of the formula. For synthesis, the AST serves to recursively encode the specification into a Mixed Integer Linear Program (MILP) that is solved using a commercial solver such as Gurobi. We describe the architecture and capabilities of PyTeLo and provide example applications highlighting its adaptability and extensibility for various research problems.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. An Iterative Approach for Heterogeneous Multi-Agent Route Planning with Resource Transportation Uncertainty and Temporal Logic Goals

    cs.RO 2025-08 conditional novelty 6.0 of 10

    An iterative explore-plan-update algorithm that refines a resource belief map for heterogeneous multi-robot teams under CaTL specifications, shown to reach full mission satisfaction in small simulations.

  2. BT-TL-DMPs: A Novel Robot TAMP Framework Combining Behavior Tree, Temporal Logic and Dynamical Movement Primitives

    cs.RO 2025-07 reject novelty 4.0 of 10

    A hierarchical robot planning framework that generates behavior trees from temporal logic specifications and optimizes dynamic movement primitives to satisfy spatiotemporal constraints while preserving demonstrated mo...

Pith tools