44,575 research outputs found
Dense-choice Counter Machines revisited
This paper clarifies the picture about Dense-choice Counter Machines, which
have been less studied than (discrete) Counter Machines. We revisit the
definition of "Dense Counter Machines" so that it now extends (discrete)
Counter Machines, and we provide new undecidability and decidability results.
Using the first-order additive mixed theory of reals and integers, we give a
logical characterization of the sets of configurations reachable by
reversal-bounded Dense-choice Counter Machines
Recommended from our members
On Robust Stability of Limit Cycles for Hybrid Systems with Multiple Jumps
In this paper, we address stability and robustness properties of hybrid limit cycles for a class of hybrid systems with multiple jumps in one period. The main results entail equivalent characterizations of stability of hybrid limit cycles for hybrid systems. The hybrid limit cycles may have multiple jumps in one period and the jumps are allowed to occur on sets. Conditions guaranteeing robustness of hybrid limit cycles are also presented
Hybrid Branching-Time Logics
Hybrid branching-time logics are introduced as extensions of CTL-like logics
with state variables and the downarrow-binder. Following recent work in the
linear framework, only logics with a single variable are considered. The
expressive power and the complexity of satisfiability of the resulting logics
is investigated.
As main result, the satisfiability problem for the hybrid versions of several
branching-time logics is proved to be 2EXPTIME-complete. These branching-time
logics range from strict fragments of CTL to extensions of CTL that can talk
about the past and express fairness-properties. The complexity gap relative to
CTL is explained by a corresponding succinctness result.
To prove the upper bound, the automata-theoretic approach to branching-time
logics is extended to hybrid logics, showing that non-emptiness of alternating
one-pebble Buchi tree automata is 2EXPTIME-complete.Comment: An extended abstract of this paper was presented at the International
Workshop on Hybrid Logics (HyLo 2007
(Co-)Inductive semantics for Constraint Handling Rules
In this paper, we address the problem of defining a fixpoint semantics for
Constraint Handling Rules (CHR) that captures the behavior of both
simplification and propagation rules in a sound and complete way with respect
to their declarative semantics. Firstly, we show that the logical reading of
states with respect to a set of simplification rules can be characterized by a
least fixpoint over the transition system generated by the abstract operational
semantics of CHR. Similarly, we demonstrate that the logical reading of states
with respect to a set of propagation rules can be characterized by a greatest
fixpoint. Then, in order to take advantage of both types of rules without
losing fixpoint characterization, we present an operational semantics with
persistent. We finally establish that this semantics can be characterized by
two nested fixpoints, and we show the resulting language is an elegant
framework to program using coinductive reasoning.Comment: 17 page
Abstract State Machines 1988-1998: Commented ASM Bibliography
An annotated bibliography of papers which deal with or use Abstract State
Machines (ASMs), as of January 1998.Comment: Also maintained as a BibTeX file at http://www.eecs.umich.edu/gasm
Memristor MOS Content Addressable Memory (MCAM): Hybrid Architecture for Future High Performance Search Engines
Large-capacity Content Addressable Memory (CAM) is a key element in a wide
variety of applications. The inevitable complexities of scaling MOS transistors
introduce a major challenge in the realization of such systems. Convergence of
disparate technologies, which are compatible with CMOS processing, may allow
extension of Moore's Law for a few more years. This paper provides a new
approach towards the design and modeling of Memristor (Memory resistor) based
Content Addressable Memory (MCAM) using a combination of memristor MOS devices
to form the core of a memory/compare logic cell that forms the building block
of the CAM architecture. The non-volatile characteristic and the nanoscale
geometry together with compatibility of the memristor with CMOS processing
technology increases the packing density, provides for new approaches towards
power management through disabling CAM blocks without loss of stored data,
reduces power dissipation, and has scope for speed improvement as the
technology matures.Comment: 10 pages, 11 figure
On the Hybrid Extension of CTL and CTL+
The paper studies the expressivity, relative succinctness and complexity of
satisfiability for hybrid extensions of the branching-time logics CTL and CTL+
by variables. Previous complexity results show that only fragments with one
variable do have elementary complexity. It is shown that H1CTL+ and H1CTL, the
hybrid extensions with one variable of CTL+ and CTL, respectively, are
expressively equivalent but H1CTL+ is exponentially more succinct than H1CTL.
On the other hand, HCTL+, the hybrid extension of CTL with arbitrarily many
variables does not capture CTL*, as it even cannot express the simple CTL*
property EGFp. The satisfiability problem for H1CTL+ is complete for triply
exponential time, this remains true for quite weak fragments and quite strong
extensions of the logic
- …