Sciweavers

3229 search results - page 14 / 646
» The Theory of Timed Automata
Sort
View
CASES
2006
ACM
14 years 12 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
IANDC
2008
122views more  IANDC 2008»
13 years 8 months ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza
CIE
2005
Springer
14 years 2 months ago
Abstract Geometrical Computation: Turing-Computing Ability and Undecidability
geometrical computation: Turing-computing ability and undecidability J´erˆome Durand-Lose Laboratoire d’Informatique Fondamentale d’Orl´eans, Universit´e d’Orl´eans, B.P...
Jérôme Durand-Lose
BANFF
1995
14 years 6 days ago
An Automata-Theoretic Approach to Linear Temporal Logic
The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis. Both programs ...
Moshe Y. Vardi
LATA
2010
Springer
14 years 6 months ago
The Inclusion Problem for Regular Expressions
This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automat...
Dag Hovland