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

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

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

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

• Title not available (Why is that?)
• 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

Cited In (7)

• 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
• On-the-Fly Stuttering in the Construction of Deterministic ω-Automata
• Title not available (Why is that?)
• Specification Languages for Stutter-Invariant Regular Properties

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)