97 search results - page 17 / 20 » Normalized Expressions and Finite Automata |
111
Voted
FLAIRS
2001
15 years 3 months ago
2001
Partially Observable Markov Decision Process models (POMDPs) have been applied to low-level robot control. We show how to use POMDPs differently, namely for sensorplanning in the ...
104
click to vote
CONCUR
2010
Springer
15 years 2 months ago
2010
Springer
We study decision problems for parameterized verification of a formal model of Ad Hoc Networks with selective broadcast and spontaneous movement. The communication topology of a ne...
134
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Finite trace semantics is known and well understood for classical automata and non-deterministic labelled transition systems. Jacobs et al introduced a more general definition fo...
105
Voted
ITICSE
2004
ACM
15 years 7 months ago
2004
ACM
The use of generic and generative methods for the development and application of interactive educational software is a relatively unexplored area in industry and education. Advant...
IGPL
2000
15 years 1 months ago
2000
The aim of this paper is to investigate the expressibility of classical propositional monomodal logics. To this end, a notion of embedding of one logic into another is introduced,...