Efficient Verification of Timed Automata Using Dense and Discrete Time Semantics
Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-48153-2_11
Full Text
Open PDFAbstract
Available in full text
Date
January 1, 1999
Authors
Publisher
Springer Berlin Heidelberg