100 search results - page 7 / 20 » Linear-Time Model Checking: Automata Theory in Practice |
94
Voted
FORMATS
2009
Springer
15 years 7 months ago
2009
Springer
Recently, the model of weighted timed automata has gained interest within the real-time community. In a previous work, we built a bridge to the theory of weighted automata and intr...
109
click to vote
CORR
2010
Springer
15 years 13 days ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
102
click to vote
ICFEM
2009
Springer
15 years 7 months ago
2009
Springer
Internet protocols encapsulate a significant amount of state, making implementing the host software complex. In this paper, we define the Statecall Policy Language (SPL) which pr...
100
click to vote
FOCS
2005
IEEE
15 years 6 months ago
2005
IEEE
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...
121
click to vote
IANDC
2011
14 years 7 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...