The stuttering principle revisited

DOI10.1007/S00236-005-0164-4MaRDI QIDQ2484066zbMATH OpenOpenAlexFDO

Authors Antonin Kučera, Jan Strejček

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)

Recommendations

• On closure under stuttering
• Characterization and verification of stuttering equivalence
• Computing Stuttering Simulations
• On intervened stuttering Poisson distribution and its applications
• The stuttering generalized Waring distribution
• Algebraic stuttering simulations
• The inspection paradox in stochastic resetting
• Some Properties of the Stuttering Poisson Distribution

Cites work

• scientific article; zbMATH DE number 3924161 (Why is no real title available?)
• scientific article; zbMATH DE number 1304310 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 1948168 (Why is no real title available?)
• 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 -regular languages
• An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic
• Star-free regular sets of ω-sequences
• Stutter-invariant temporal properties are expressible without the next-time operator
• Temporal logic can be more expressive
• The complexity of propositional linear temporal logics

Cited in

(15)

• Timed hyperproperties
• Multi-player games with LDL goals over finite traces
• Characterization and verification of stuttering equivalence
• On the semantics of polychronous polytimed specifications
• Weak Kripke structures and LTL
• On closure under stuttering
• A note on stutter-invariant PLTL
• A note on a question of Peled and Wilke regarding stutter-invariant LTL
• SOFSEM 2005: Theory and Practice of Computer Science
• LTL under reductions with weaker conditions than stutter invariance
• Flavors of sequential information flow
• Taming past LTL and flat counter systems
• scientific article; zbMATH DE number 1069482 (Why is no real title available?)
• Stirring: the Eckart paradigm revisited
• Next-preserving branching bisimulation

This page was built for publication: The stuttering principle revisited

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