scientific article; zbMATH DE number 1954378

MaRDI QIDQ4415249zbMATH OpenFDO

Authors Stéphane Demri, Deepak D'Souza

Publication date 28 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2556/25560121.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44) Logic in computer science (03B70)

Recommendations

• An automata-theoretic approach to constraint LTL
• Verification of qualitative \(\mathbb Z\) constraints
• Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints
• An automata-based approach for \(\text{CTL}^{*}\) with constraints
• CONCUR 2005 – Concurrency Theory

Cited in

(17)

• CONCUR 2005 – Concurrency Theory
• Completeness of the bounded satisfiability problem for constraint LTL
• Temporal logics on strings with prefix relation
• The effects of bounding syntactic resources on Presburger LTL
• Temporal logics with local constraints (invited talk)
• From LTL to deterministic automata. A safraless compositional approach
• An automata-theoretic approach to constraint LTL
• LTL over integer periodicity constraints
• Linear-time temporal logics with Presburger constraints: an overview
• Constraint LTL satisfiability checking without automata
• An Asymptotically Correct Finite Path Semantics for LTL
• On the freeze quantifier in Constraint LTL: Decidability and complexity
• Failure-based equivalence of constraint automata
• Linear Temporal Logic of Constraint Automata
• An automata-based approach for \(\text{CTL}^{*}\) with constraints
• Mathematical Foundations of Computer Science 2003
• Realizability modulo theories

This page was built for publication:

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