Sciweavers

281 search results - page 5 / 57
» Solving Parametric Algebraic Systems
Sort
View
TCS
2008
13 years 10 months ago
Solving difference equations whose coefficients are not transcendental
We consider a large class of sequences, called admissible sequences, which are defined by systems of (possibly nonlinear) difference equations. A procedure for recursively enumera...
Manuel Kauers
STACS
2001
Springer
14 years 3 months ago
Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra
It is well known that finite square matrices over a Kleene algebra again form a Kleene algebra. This is also true for infinite matrices under suitable restrictions. One can use t...
Dexter Kozen
AAECC
1998
Springer
167views Algorithms» more  AAECC 1998»
13 years 10 months ago
Generalized Bezout Identity
We describe a new approach of the generalized Bezout identity for linear time-varying ordinary differential control systems. We also explain when and how it can be extended to line...
J. F. Pommaret, Alban Quadrat
HYBRID
2000
Springer
14 years 2 months ago
Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...
Joseph S. Miller
AMAST
1997
Springer
14 years 3 months ago
Parametric Analysis of Computer Systems
Abstract. A general parametric analysis problem which allows the use of parameter variables in both the realtime automata and the specifications is proposed and solved. The analys...
Farn Wang, Pao-Ann Hsiung