1279 search results - page 5 / 256 » Fast Implementations of Automata Computations |
106
click to vote
ARTS
1997
Springer
15 years 1 months ago
1997
Springer
We introduce PLC-Automata as a new class of automata which are tailored to deal with real-time properties of Programmable Logic Controllers (PLCs). These devices are often used in...
SIGCSE
2006
ACM
15 years 3 months ago
2006
ACM
Visualization and interactivity are valuable active learning techniques that can improve mastery of difficult concepts. In this paper we describe jFAST, an easy-to-use graphical s...
AMAST
2008
Springer
14 years 11 months ago
2008
Springer
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
88
Voted
TCS
2010
14 years 4 months ago
2010
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential l...
FOCS
2005
IEEE
15 years 3 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...