245 search results - page 21 / 49 » Using Finite State Automata for Sequence Mining |
APLAS
2003
ACM
13 years 11 months ago
2003
ACM
We investigate how to automatically verify that resources such as files are not used improperly or unsafely by a program. We employ a mixture of compile-time analysis and run-time ...
BC
2008
13 years 8 months ago
2008
In this paper we introduce a simple model based on probabilistic finite state automata to describe an emotional interaction between a robot and a human user, or between simulated a...
CONCUR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We consider the problem of verifying the safety of wellstructured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have (possibly) i...
IANDC
2008
13 years 8 months ago
2008
Hybrid systems are dynamical systems with the ability to describe mixed discretecontinuous evolution of a wide range of systems. Consequently, at first glance, hybrid systems appe...
ECAI
2010
Springer
13 years 5 months ago
2010
Springer
The language of linear temporal logic (LTL) has been proposed as a formalism for specifying temporally extended goals and search control constraints in planning. However, the seman...