Sciweavers

423 search results - page 15 / 85
» The Generalization of Generalized Automata: Expression Autom...
Sort
View
FORMATS
2007
Springer
14 years 2 months ago
Counter-Free Input-Determined Timed Automata
We identify a class of timed automata, which we call counter-free input-determined automata, which characterize the class of timed languages definable by several timed temporal l...
Fabrice Chevalier, Deepak D'Souza, Pavithra Prabha...
IANDC
2006
113views more  IANDC 2006»
13 years 8 months ago
Automata and fixed point logic: A coalgebraic perspective
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
Yde Venema
ACSD
2006
IEEE
129views Hardware» more  ACSD 2006»
14 years 2 months ago
Extended Timed Automata and Time Petri Nets
Timed Automata (TA) and Time Petri Nets (TPN) are two well-established formal models for real-time systems. Recently, a linear transformation of TA to TPNs preserving reachability...
Patricia Bouyer, Pierre-Alain Reynier, Serge Hadda...
CASES
2006
ACM
14 years 15 days ago
State space reconfigurability: an implementation architecture for self modifying finite automata
Many embedded systems exhibit temporally and behaviorally disjoint behavior slices. When such behaviors are captured by state machines, the current design flow will capture it as ...
Ka-Ming Keung, Akhilesh Tyagi
CADE
2008
Springer
14 years 9 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard