5 search results - page 1 / 1 » Safety alternating automata on data words |
39
Voted
CORR
2008
Springer
15 years 4 days ago
2008
Springer
107
click to vote
LICS
2007
IEEE
15 years 6 months ago
2007
IEEE
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
127
click to vote
ENTCS
2006
15 years 2 days ago
2006
We present a runtime verification framework for Java programs. Properties can be specified in Linear-time Temporal Logic (LTL) over AspectJ pointcuts. These properties are checked...
103
click to vote
COLT
1995
Springer
15 years 3 months ago
1995
Springer
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
102
click to vote
CAV
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Regular model checking is a form of symbolic model checking technique for systems whose states can be represented as finite words over a finite alphabet, where regular ...