Sciweavers

2465 search results - page 98 / 493
» Automata on Linear Orderings
Sort
View
AMCS
2008
124views Mathematics» more  AMCS 2008»
13 years 9 months ago
Approximate Controllability of Infinite Dimensional Systems of the n-th Order
The objective of the article is to obtain general conditions for several types of controllability at once for an abstract differential equation of arbitrary order, instead of condi...
Jerzy Stefan Respondek
CONCUR
2007
Springer
14 years 3 months ago
Timed Concurrent Game Structures
Abstract. We propose a new model for timed games, based on concurrent game structures (CGSs). Compared to the classical timed game automata of Asarin et al. [8], our timed CGSs are...
Thomas Brihaye, François Laroussinie, Nicol...
DBPL
2007
Springer
98views Database» more  DBPL 2007»
14 years 3 months ago
Towards Practical Typechecking for Macro Tree Transducers
Macro tree transducers (mtt) are an important model that both covers many useful XML transformations and allows decidable exact typechecking. This paper reports our first step tow...
Alain Frisch, Haruo Hosoya
ASYNC
2005
IEEE
118views Hardware» more  ASYNC 2005»
14 years 2 months ago
Modeling and Verifying Circuits Using Generalized Relative Timing
We propose a novel technique for modeling and verifying timed circuits based on the notion of generalized relative timing. Generalized relative timing constraints can express not ...
Sanjit A. Seshia, Randal E. Bryant, Kenneth S. Ste...
CONCUR
2009
Springer
14 years 1 months ago
Time-Bounded Verification
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
Joël Ouaknine, Alexander Rabinovich, James Wo...