2632 search results - page 169 / 527 » Alternating Timed Automata |
156
click to vote
CIKM
2004
Springer
15 years 10 months ago
2004
Springer
At present, most of the state-of-the-art solutions for XML access controls are either (1) document-level access control techniques that are too limited to support fine-grained sec...
140
click to vote
FM
2003
Springer
15 years 10 months ago
2003
Springer
We present two instantiations of generic Interactive State Machines (ISMs) with mobility features which are useful for modeling and verifying dynamically changing mobile systems. I...
140
click to vote
CAV
2004
Springer
15 years 8 months ago
2004
Springer
Model checking algorithms can report a property as being true for reasons that may be considered vacuous. Current algorithms for detecting vacuity require either checking a quadrat...
131
click to vote
COLING
1992
15 years 5 months ago
1992
A language-independent framework for syntactic finlte-state parsing is discussed. The article presents a framework, a formalism, a compiler and a parser for grammars written in th...
143
click to vote
ICGI
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...