On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A partial approach to model checking
Papers presented at the IEEE symposium on Logic in computer science
Exact complexity bounds for ordinal addition
Theoretical Computer Science
Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy
Theoretical Computer Science - Special issue on real numbers and computers
Achilles and the tortoise climbing up the arithmetical hierarchy
Journal of Computer and System Sciences - Fourteenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Accepting Zeno words: a way toward timed refinements
Acta Informatica
Accessibility in Automata on Scattered Linear Orderings
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
A deterministic subexponential algorithm for solving parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Reasoning about transfinite sequences
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
A kleene theorem for languages of words indexed by linear orderings
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Abstract geometrical computation for black hole computation
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
The complexity of temporal logic with until and since over ordinals
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
On reachability games of ordinal length
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
| Hi-index | 0.00 |
Ordinal automata are used to model physical systems with Zeno behavior. Using automata and games techniques we solve a control problem formulated and left open by Demri and Nowak in 2005. It involves partial observability and a new synchronization between the controller and the environment.