10 search results - page 2 / 2 » Timed Automata with Integer Resets: Language Inclusion and E... |
CONCUR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
ACSD
2006
IEEE
13 years 10 months ago
2006
IEEE
Timed Automata (TA) and Time Petri Nets (TPN) are two well-established formal models for real-time systems. Recently, a linear transformation of TA to TPNs preserving reachability...
CONCUR
2009
Springer
13 years 8 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
LATA
2009
Springer
13 years 11 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
MTA
2007
13 years 4 months ago
2007
Abstract. In this paper we address the problem of comparing multimedia documents, which can be described according to different reference models. If we consider presentations as c...