scientific article; zbMATH DE number 1954378

zbMATH Open1027.03027MaRDI QIDQ4415249FDOQ4415249

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

Title of this publication is not available (Why is that?)

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

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)

Cited In (15)

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

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)