Sciweavers

305 search results - page 17 / 61
» Decidability of Split Equivalence
Sort
View
IJAC
2007
59views more  IJAC 2007»
13 years 7 months ago
Automorphic Equivalence Problem for Free Associative Algebras of Rank Two
Let K x, y be the free associative algebra of rank 2 over an algebraically closed constructive field of any characteristic. We present an algorithm which decides whether or not tw...
Vesselin Drensky, Jie-Tai Yu
LICS
2006
IEEE
14 years 1 months ago
Control in o-minimal Hybrid Systems
In this paper, we consider the control of general hybrid systems. In this context we show that time-abstract bisimulation is not adequate for solving such a problem. That is why w...
Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier
TACAS
2007
Springer
116views Algorithms» more  TACAS 2007»
14 years 1 months ago
Model Checking on Trees with Path Equivalences
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
Rajeev Alur, Pavol Cerný, Swarat Chaudhuri
INFORMATICALT
2000
82views more  INFORMATICALT 2000»
13 years 7 months ago
Some Grammatical Structures of Programming Languages as Simple Bracketed Languages
Abstract. We consider in this paper so called simple bracketed languages having special limitations. They are sometimes used for the definitions of some grammatical structures of p...
Boris Melnikov, Elena Kashlakova
ACTA
2007
104views more  ACTA 2007»
13 years 7 months ago
Decision problems for pushdown threads
Threads as contained in a thread algebra emerge from the behavioral abstraction from programs in an appropriate program algebra. Threads may make use of services such as stacks, an...
Jan A. Bergstra, Inge Bethke, Alban Ponse