Decidability and Complexity Results for Timed Automata via Channel Machines
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 1089-1101
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Perturbed Timed AutomataLecture Notes in Computer Science, 2005
- Updatable timed automataTheoretical Computer Science, 2004
- Decision Problems for Timed Automata: A Survey2004
- Model checking of systems with many identical timed processesTheoretical Computer Science, 2003
- Event-clock automata: a determinizable class of timed automataTheoretical Computer Science, 1999
- 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
- Real-Time Logics: Complexity and ExpressivenessInformation and Computation, 1993