423 search results - page 3 / 85 » The Generalization of Generalized Automata: Expression Autom... |
WIA
2000
Springer
14 years 3 days ago
2000
Springer
Abstract. We describe a general automata-theoretic approach for analyzing the verification problems (binary reachability, safety, etc.) of discrete timed automata augmented with va...
ASYNC
2005
IEEE
14 years 2 months ago
2005
IEEE
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 ...
MST
2011
13 years 3 months ago
2011
: We define a weighted monadic second order logic for unranked trees and the concept of weighted unranked tree automata, and we investigate the expressive power of these two conce...
LICS
2009
IEEE
14 years 3 months ago
2009
IEEE
Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from co...
FSTTCS
2010
Springer
13 years 6 months ago
2010
Springer
a is an abstract framework for the uniform study of different kinds of dynamical systems. An endofunctor F determines both the type of systems (F-coalgebras) and a notion of behav...