A note on a question of Peled and Wilke regarding stutter-invariant LTL

DOI10.1016/S0020-0190(00)00113-7zbMATH Open1339.68166MaRDI QIDQ294841FDOQ294841

Authors: Kousha Etessami 

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000001137?np=y

Recommendations

• A note on stutter-invariant PLTL
• The stuttering principle revisited
• scientific article; zbMATH DE number 1948168
• scientific article; zbMATH DE number 2102709
• On closure under stuttering

zbMATH Keywords

temporal logicnext operatorspecification languagesefficient translationstutter-invariance

Mathematics Subject Classification ID

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

Cites Work

• The complexity of propositional linear temporal logics
• Stutter-invariant temporal properties are expressible without the next-time operator
• An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages
• Title not available (Why is that?)

Cited In (10)

• Complete axiomatization of the stutter-invariant fragment of the linear time \(\mu\)-calculus
• On closure under stuttering
• The stuttering principle revisited
• A note on stutter-invariant PLTL
• Title not available (Why is that?)
• Invariance under stuttering in a temporal logic without the ``until operator
• On-the-Fly Stuttering in the Construction of Deterministic ω-Automata
• Specification languages for stutter-invariant regular properties
• LTL under reductions with weaker conditions than stutter invariance
• Title not available (Why is that?)

This page was built for publication: A note on a question of Peled and Wilke regarding stutter-invariant LTL

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