Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!

Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier. Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!. In Sergei N. Artëmov, Anil Nerode, editors, Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings. Volume 4514 of Lecture Notes in Computer Science, pages 69-83, Springer, 2007. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.