Sciweavers

2465 search results - page 66 / 493
» Automata on Linear Orderings
Sort
View
CDC
2009
IEEE
162views Control Systems» more  CDC 2009»
14 years 16 days ago
Distributed optimal planning: an approach by weighted automata calculus
— We consider a distributed system modeled as a possibly large network of automata. Planning in this system consists in selecting and organizing actions in order to reach a goal ...
Eric Fabre, Loig Jezequel
LICS
2010
IEEE
13 years 6 months ago
The Emptiness Problem for Tree Automata with Global Constraints
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
Luis Barguñó, Carles Creus, Guillem ...
JUCS
2010
130views more  JUCS 2010»
13 years 6 months ago
On the Linear Number of Matching Substrings
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
Yo-Sub Han
WRLA
2010
13 years 6 months ago
The Linear Temporal Logic of Rewriting Maude Model Checker
Abstract. This paper presents the foundation, design, and implementation of the Linear Temporal Logic of Rewriting model checker as an extension of the Maude system. The Linear Tem...
Kyungmin Bae, José Meseguer
ENTCS
2008
71views more  ENTCS 2008»
13 years 7 months ago
An Inverse Method for Parametric Timed Automata
Given a timed automaton with parametric timings, our objective is to describe a procedure for deriving constraints on the parametric timings in order to ensure that, for each valu...
Étienne André, Thomas Chatain, Laure...