Constraint LTL with remote access

DOI10.4230/LIPICS.FSTTCS.2023.41MaRDI QIDQ6951692zbMATH OpenFDO

Authors Ashwin Bhaskar, M. Praveen

Publication date 28 July 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2023.41

zbMATH Keywords

Büchi automataconstraint LTLMSO formulasregular expressionssatisfiability

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites work

• A lattice-theoretical fixpoint theorem and its applications
• A tool for deciding the satisfiability of continuous-time metric temporal logic
• An automata-theoretic approach to constraint LTL
• Constrained properties, semilinear systems, and Petri nets
• Constraint automata on infinite data trees: from CTL\((\mathbb{Z})\text{CTL}^*(\mathbb{Z})\) to decision procedures
• Finite-memory automata
• Functional specification of hardware via temporal logic
• scientific article; zbMATH DE number 1670482 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• LTL with the freeze quantifier and register automata
• Reasoning about data repetitions with counter systems
• Temporal logics of repeating values
• Temporal stream logic modulo theories
• Temporal stream logic: synthesis beyond the Bools
• The effects of bounding syntactic resources on Presburger LTL
• Two-variable logic on data words

Cited in

(1)

• Regulating synchronous data exchange to meet control flow and data specifications

This page was built for publication: Constraint LTL with remote access

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6951692)