Searching for "Mathematical Foundations of Computer Science 2003" – sorted by Relevance.
-
Local LTL with past constants is expressively complete for Mazurkiewicz traces
- Mathematical Foundations of Computer Science 2003, 28th International Symposium Proceedings
- Cited by 4 (2 self) – Add To MetaCart
-
Probabilistic and Nondeterministic Unary Automata
- of Computer Science 2003, pp. 460–469. Lecture Notes in Computer Science 2747 Abstract. We investigate unary
- Cited by 3 (0 self) – Add To MetaCart

