Sciweavers

2467 search results - page 323 / 494
» Finite State Machines
Sort
View
IJCAI
1997
15 years 7 months ago
Charts, Interaction-free Grammars, and the Compact Representation of Ambiguity
Recently researchers working in the LFG framework have proposed algorithms for taking advantage of the implicit context-free components of a unification grammar [Maxwell and Kapla...
Marc Dymetman
IJCAI
1997
15 years 7 months ago
Model Minimization, Regression, and Propositional STRIPS Planning
Propositional STRIPS planning problems can be viewed as finite state automata (FSAs) represented in a factored form. Automaton minimization is a well-known technique for reducing ...
Robert Givan, Thomas Dean
ATAL
2010
Springer
15 years 7 months ago
Reasoning about strategies of multi-agent programs
Verification of multi-agent programs is a key problem in agent research and development. This paper focuses on multi-agent programs that consist of a finite set of BDI-based agent...
Mehdi Dastani, Wojciech Jamroga
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
15 years 7 months ago
Reachability analysis for a class of Petri nets
In this paper, we study the reachability problem for the class of (strictly) monotone Petri nets that we define based on algebraic conditions. More specifically, given a (strictly)...
Yu Ru, Christoforos N. Hadjicostis
AUTOMATICA
2008
115views more  AUTOMATICA 2008»
15 years 6 months ago
Distributed algorithms for reaching consensus on general functions
This paper presents analysis and design results for distributed consensus algorithms in multi-agent networks. We consider continuous consensus functions of the initial state of th...
Jorge Cortés