Sciweavers

3229 search results - page 93 / 646
» The Theory of Timed Automata
Sort
View
LICS
2006
IEEE
16 years 12 days ago
Monadic Chain Logic Over Iterations and Applications to Pushdown Systems
Logical properties of iterations of relational structures are studied and these decidability results are applied to the model checking of a powerful extension of pushdown systems....
Dietrich Kuske, Markus Lohrey
EUROCAST
2001
Springer
106views Hardware» more  EUROCAST 2001»
15 years 11 months ago
On CAST.FSM Computation of Hierarchical Multi-layer Networks of Automata
CAST.FSM denotes a CAST tool which has been developed at the Institute of Systems Science at the University of Linz during the years 1986-1993. The first version of CAST.FSM was i...
Michael Affenzeller, Franz Pichler, Rudolf Mittelm...
ATAL
2008
Springer
15 years 8 months ago
Switching dynamics of multi-agent learning
This paper presents the dynamics of multi-agent reinforcement learning in multiple state problems. We extend previous work that formally modelled the relation between reinforcemen...
Peter Vrancx, Karl Tuyls, Ronald L. Westra
CL
2002
Springer
15 years 6 months ago
Orderly communication in the Ambient Calculus
The Ambient Calculus (henceforth, AC) was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code [9]. We present a type system for AC ...
Torben Amtoft, A. J. Kfoury, Santiago M. Peric&aac...
PODS
2007
ACM
104views Database» more  PODS 2007»
16 years 6 months ago
XML transformation by tree-walking transducers with invisible pebbles
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samw...