scientific article
From MaRDI portal
Publication:2753678
zbMath0973.68142MaRDI QIDQ2753678
Hubert Comon, Véronique Cortier
Publication date: 11 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)
Related Items (24)
Presburger liveness verification of discrete timed automata. ⋮ Eliminating the storage tape in reachability constructions. ⋮ Verification of Gap-Order Constraint Abstractions of Counter Systems ⋮ Forward analysis and model checking for trace bounded WSTS ⋮ On the freeze quantifier in Constraint LTL: Decidability and complexity ⋮ An automata-theoretic approach to constraint LTL ⋮ Unnamed Item ⋮ Taming strategy logic: non-recurrent fragments ⋮ Pushdown timed automata: A binary reachability characterization and safety verification. ⋮ Well-abstracted transition systems: Application to FIFO automata. ⋮ Reasoning about sequences of memory states ⋮ Verification of gap-order constraint abstractions of counter systems ⋮ Constraint LTL satisfiability checking without automata ⋮ Some Recent Results in Metric Temporal Logic ⋮ Forward Analysis and Model Checking for Trace Bounded WSTS ⋮ Verification of qualitative \(\mathbb Z\) constraints ⋮ On decidability and complexity of low-dimensional robot games ⋮ An Automata-based Approach for CTL⋆ With Constraints ⋮ Unnamed Item ⋮ LTL over integer periodicity constraints ⋮ Unnamed Item ⋮ The Complexity of Flat Freeze LTL ⋮ The complexity of propositional linear temporal logics in simple cases ⋮ Taming past LTL and flat counter systems
This page was built for publication:
