The stuttering principle revisited

DOI10.1007/s00236-005-0164-4zbMath1079.03008OpenAlexW2071963633MaRDI QIDQ2484066

Jan Strejček, Antonín Kučera

Publication date: 2 August 2005

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-005-0164-4

zbMATH Keywords

LTL formulaestutter equivalence of words

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (7)

Timed hyperproperties ⋮ Flavors of sequential information flow ⋮ Multi-player games with LDL goals over finite traces ⋮ On the semantics of polychronous polytimed specifications ⋮ Weak Kripke Structures and LTL ⋮ Taming past LTL and flat counter systems ⋮ Next-preserving branching bisimulation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stutter-invariant temporal properties are expressible without the next-time operator
• A note on a question of Peled and Wilke regarding stutter-invariant LTL
• A syntactic congruence for rational \(\omega\)-languages
• An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages
• An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic
• Temporal logic can be more expressive
• The complexity of propositional linear temporal logics
• Star-free regular sets of ω-sequences

This page was built for publication: The stuttering principle revisited