116
Voted
ICALP
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
119
Voted
FSTTCS
2007
Springer
15 years 9 months ago
2007
Springer
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...