The stuttering principle revisited
From MaRDI portal
Publication:2484066
DOI10.1007/S00236-005-0164-4zbMATH Open1079.03008OpenAlexW2071963633MaRDI QIDQ2484066FDOQ2484066
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
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
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cites Work
- The complexity of propositional linear temporal logics
- Temporal logic can be more expressive
- 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?)
- A note on a question of Peled and Wilke regarding stutter-invariant LTL
- A syntactic congruence for rational \(\omega\)-languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Star-free regular sets of ω-sequences
- An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic
- Title not available (Why is that?)
Cited In (15)
- Timed hyperproperties
- Characterization and verification of stuttering equivalence
- Multi-player games with LDL goals over finite traces
- 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
- Title not available (Why is that?)
- 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)
