Reasoning about real-time repetitions: Terminating and nonterminating
From MaRDI portal
Publication:700976
DOI10.1016/S0167-6423(02)00024-2zbMATH Open1014.68036OpenAlexW1994683972MaRDI QIDQ700976FDOQ700976
Publication date: 16 October 2002
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6423(02)00024-2
Cited In (2)
Recommendations
- A Decidable Temporal Logic of Repeating Values π π
- Temporal Logics of Repeating Values π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Realizability of real-time logics π π
- Real-time refinement in Manna and Pnueli's temporal logic π π
- Title not available (Why is that?) π π
- Real-time logics: Complexity and expressiveness π π
- Decidability and Expressive Power of Real Time Logics π π
- Extending Timed Automaton and Real-Time Logic to Many-Valued Reasoning π π
This page was built for publication: Reasoning about real-time repetitions: Terminating and nonterminating
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q700976)