104 search results - page 18 / 21 » Action Abstraction in Timed Process Algebra |
CSL
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
FLAIRS
2004
15 years 1 months ago
2004
er provides new techniques for abstracting the state space of a Markov Decision Process (MDP). These techniques extend one of the recent minimization models, known as -reduction, ...
113
click to vote
CSMR
2002
IEEE
15 years 4 months ago
2002
IEEE
Static analysis aims at recovering the structure of a software system, while dynamic analysis focuses on its run time behaviour. We propose a technique for combining the analysis ...
ITS
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. It is common to think of a "learner model" as a global description of a student's understanding of domain content. We propose a notion of learner model whe...
116
click to vote
ATAL
2005
Springer
15 years 1 months ago
2005
Springer
A constrained agent is limited in the actions that it can take at any given time, and a challenging problem is to design policies for such agents to do the best they can despite t...