Sciweavers

ICALP
2009
Springer
14 years 4 months ago
Boundedness of Monadic Second-Order Formulae over Finite Words
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
Achim Blumensath, Martin Otto, Mark Weyer
43
Voted
FSTTCS
2007
Springer
14 years 6 months ago
Automata and Logics for Timed Message Sequence Charts
Abstract. We provide a framework for distributed systems that impose timing constraints on their executions. We propose a timed model of communicating finite-state machines, which...
S. Akshay, Benedikt Bollig, Paul Gastin