On Metric Temporal Logic and Faulty Turing Machines
Open Access
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 217-230
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Verifying lossy channel systems has nonprimitive recursive complexityInformation Processing Letters, 2002
- Well-structured transition systems everywhere!Theoretical Computer Science, 2001
- State clock logic: A decidable real-time logic1997
- Undecidable Verification Problems for Programs with Unreliable ChannelsInformation and Computation, 1996
- Unreliable Channels Are Easier to Verify Than Perfect ChannelsInformation and Computation, 1996
- The benefits of relaxing punctualityJournal of the ACM, 1996
- A theory of timed automataTheoretical Computer Science, 1994
- A really temporal logicJournal of the ACM, 1994
- Real-Time Logics: Complexity and ExpressivenessInformation and Computation, 1993
- On Communicating Finite-State MachinesJournal of the ACM, 1983