Results 1  10
of
8,091
Decidable Cases of the Rational Sequence Problem
, 1996
"... Determining whether or not there is a vanishing term of a linear recurrence with rational coefficients is the Rational Sequence Problem. The decidability status of this problem is open. Several formulations of the problem are presented in this paper. A decision method for determining whether or not ..."
Abstract
 Add to MetaCart
or not infinitely many terms of a linear recurrence sequence vanish is given in terms of the Residue Theorem of complex variable theory, A decidable case, based on transcenedental number Theory is also discussed. The last section details an approach to the problem based on polynomial ideal theory.
Five misunderstandings about casestudy research
 Qualitative Inquiry
, 2006
"... When I first became interested in indepth casestudy research, I was trying to understand how power and rationality shape each other and form the urban environments in which we live (Flyvbjerg, 1998). It was clear to me that in order to understand a complex issue like this, indepth casestudy rese ..."
Abstract

Cited by 556 (2 self)
 Add to MetaCart
to such claims, which clearly formed the conventional wisdom about casestudy research. I decided therefore to find out where the claims come from and whether they are correct. This chapter contains what I discovered.
Undecidability Of The Trace Coding Problem And Some Decidable Cases
"... We introduce and investigate the notion of weak morphisms of trace monoids with the aim of dealing with the problem of deciding the existence of codings between trace monoids. We prove that this problem is not recursively enumerable, which answers the question raised by Ochmanski in 1988. On the ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We introduce and investigate the notion of weak morphisms of trace monoids with the aim of dealing with the problem of deciding the existence of codings between trace monoids. We prove that this problem is not recursively enumerable, which answers the question raised by Ochmanski in 1988
What's Decidable about Hybrid Automata?
 Journal of Computer and System Sciences
, 1995
"... . Hybrid automata model systems with both digital and analog components, such as embedded control programs. Many verification tasks for such programs can be expressed as reachability problems for hybrid automata. By improving on previous decidability and undecidability results, we identify a boundar ..."
Abstract

Cited by 377 (16 self)
 Add to MetaCart
boundary between decidability and undecidability for the reachability problem of hybrid automata. On the positive side, we give an (optimal) PSPACE reachability algorithm for the case of initialized rectangular automata, where all analog variables follow independent trajectories within piecewise
Cognitive networks
 IN PROC. OF IEEE DYSPAN 2005
, 2005
"... This paper presents a definition and framework for a novel type of adaptive data network: the cognitive network. In a cognitive network, the collection of elements that make up the network observes network conditions and then, using prior knowledge gained from previous interactions with the network ..."
Abstract

Cited by 1106 (7 self)
 Add to MetaCart
with the network, plans, decides and acts on this information. Cognitive networks are different from other “intelligent ” communication technologies because these actions are taken with respect to the endtoend goals of a data flow. In addition to the cognitive aspects of the network, a specification language
Resilient Overlay Networks
, 2001
"... A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance within several seconds, improving over today’s widearea routing protocols that take at least several minutes to recover. A R ..."
Abstract

Cited by 1160 (31 self)
 Add to MetaCart
RON is an applicationlayer overlay on top of the existing Internet routing substrate. The RON nodes monitor the functioning and quality of the Internet paths among themselves, and use this information to decide whether to route packets directly over the Internet or by way of other RON nodes
The STATEMATE Semantics of Statecharts
, 1996
"... This article describes the semantics of the language of statecharts as implenented in the STATEMATE system [Harel et al. 1990; Harel and Politi 1996]. The initial version of this semantics was developed by a team about.10 years ago. With the added experience of the users of the system it has since b ..."
Abstract

Cited by 657 (12 self)
 Add to MetaCart
been extended and modified. This executable semantics has been in operation in driving the simulation, dynamic tests, and code generation tDols of STATEMATE since 1987, and a technical report describing it has been available from iLogix, Inc. since 1989. We have now decided to revise and publish
Undecidable Case and Decidable Case of Joint Diagnosability in Distributed Discrete Event Systems
"... Abstract—Diagnosability is an important property that determines at design stage how accurate any diagnosis algorithm can be on a partially observable system. Most existing approaches assumed that each observable event in the system is globally observed. Considering the cases where there is no glob ..."
Abstract
 Add to MetaCart
communication events being unobservable is relaxed, i.e., communication events could be either observable or unobservable. Then, we discuss about the decidable case where communication events are all observable and develop a new efficient algorithm to test it. Finally, we also provide an important property
A Decidable Case of the SemiUnification Problem (Draft Version)
, 1991
"... Semiunification is a common generalization of unification and matching. The semiunification problem is to decide solvability of finite sets of equations s = t and inequations ˜s ≤i ˜t between firstorder terms, with different inequality relations ≤i, i ∈ I. A solution consists of a substitution T0 ..."
Abstract
 Add to MetaCart
Semiunification is a common generalization of unification and matching. The semiunification problem is to decide solvability of finite sets of equations s = t and inequations ˜s ≤i ˜t between firstorder terms, with different inequality relations ≤i, i ∈ I. A solution consists of a substitution T0
On the Decidability of Query Containment under Constraints
"... Query containment under constraints is the problem of checking whether for every database satisfying a given set of constraints, the result of one query is a subset of the result of another query. Recent research points out that this is a central problem in several database applications, and we addr ..."
Abstract

Cited by 256 (56 self)
 Add to MetaCart
atoms are complex expressions. We present the following results on query containment. For the case where q does not contain regular expressions, we provide a method for deciding query containment, and analyze its computational complexity. We do the same for the case where neither S nor q, q ′ contain
Results 1  10
of
8,091