Artificial Intelligence - Special issue on knowledge representation
Theoretical Computer Science
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
The benefits of relaxing punctuality
Journal of the ACM (JACM)
Characterization of the expressive power of silent transitions in timed automata
Fundamenta Informaticae
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Decomposition and Composition of Timed Automata
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The Regular Real-Time Languages
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
On the Design of Hybrid Control Systems Using Automata Models
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
A Determinizable Class of Timed Automata
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
A Kleene theorem for timed automata
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Intersection of regular signal-event (timed) languages
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Refinements and abstractions of signal-event (timed) languages
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
A commutative complemented Kleene algebra of sets of (positive) real numbers is introduced. For the subalgebra generated by finite unions of rational intervals a normal form is found. These are then applied to the complementation problem for real-time automata.