In this paper a novel computational technique for finite discrete approximation of continuous dynamical systems suitable for a significant class of biochemical dynamical systems is introduced. The method is parameterized in order to affect the imposed level of approximation provided that with increasing parameter value the approximation converges to the original continuous system. By employing this approximation technique, we present algorithms solving the reachability problem for biochemical dynamical systems. The presented method and algorithms are evaluated on several exemplary biological models and on a real case study. This is a full version of the paper published in the proceedings of CompMod 2011.
An indirect method based on rectangular abstraction automaton making the finite quotient of the continuous state space has been employed, e.g., in @cite_24 @cite_29 @cite_18 . In general, these methods rely on results @cite_5 @cite_22 and are applicable to (piece-wise) affine or (piece-wise) multi-affine systems. Although not addressed formally in this paper, our technique can be considered as a refinement of @cite_24 . However, we focus on obtaining satisfactory approximate results eliminating the extent of spurious behaviour coming from conservativeness of rectangular abstraction. Our technique can be employed for the recognition of spurious behaviour of the rectangular abstraction transition system.
@cite_18 @cite_22 @cite_29 @cite_24 @cite_5
1503537039 2126998703 2157239333 2154507364
Abstraction can often lead to spurious counterexamples. Counterexample-guided abstraction refinement is a method of strengthening abstractions based on the analysis of these spurious counterexamples. For invariance properties, a counterexample is a finite trace that violates the invariant; it is spurious if it is possible in the abstraction but not in the original system. When proving termination or other liveness properties of infinite-state systems, a useful notion of spurious counterexamples has remained an open problem. For this reason, no counterexample-guided abstraction refinement algorithm was known for termination. In this paper, we address this problem and present the first known automatic counterexample-guided abstraction refinement algorithm for termination proofs. We exploit recent results on transition invariants and transition predicate abstraction. We identify two reasons for spuriousness: abstractions that are too coarse, and candidate transition invariants that are too strong. Our counterexample-guided abstraction refinement algorithm successively weakens candidate transition invariants and refines the abstraction. Here, we propose a planning method for knotting unknotting of deformable linear objects. First, we propose a topological description of the state of a linear object. Second, transitions between these states are defined by introducing four basic operations. Then, possible sequences of crossing state transitions, i.e. possible manipulation processes, can be generated once the initial and the objective states are given. Third, a method for determining grasping points and their directions of movement is proposed to realize derived manipulation processes. Our proposed method indicated that it is theoretically possible for any knotting manipulation of a linear object placed on a table to be realized by a one-handed robot with three translational DOF and one rotational DOF. Furthermore, criteria for evaluation of generated plans are introduced to reduce the candidates of manipulation plans. Fourth, a planning method for tying knots tightly is established because they fulfill their fixing function by tightening them. Finally, we report knotting unknotting manipulation performed by a vision-guided system to demonstrate the usefulness of our approach. This paper proposes a novel abstraction technique for continuous-time Markov chains (CTMCs). Our technique fits within the realm of three-valued abstraction methods that have been used successfully for traditional model checking. The key idea is to apply abstraction on uniform CTMCs that are readily obtained from general CTMCs, and to abstract transition probabilities by intervals. It is shown that this provides a conservative abstraction for both true and false for a three-valued semantics of the branching-time logic CSL (Continuous Stochastic Logic). Experiments on an infinite-state CTMC indicate the feasibility of our abstraction technique. Abstract Affine systems are reproducing systems of the form A C = D c T k ψ l : 1 ⩽ l ⩽ L , k ∈ Z n , c ∈ C , which arise by applying lattice translation operators T k to one or more generators ψ l in L 2 ( R n ) , followed by the application of dilation operators D c , associated with a countable set C of invertible matrices. In the wavelet literature, C is usually taken to be the group consisting of all integer powers of a fixed expanding matrix. In this paper, we develop the properties of much more general systems, for which C = c = a b : a ∈ A , b ∈ B where A and B are not necessarily commuting matrix sets. C need not contain a single expanding matrix. Nonetheless, for many choices of A and B, there are wavelet systems with multiresolution properties very similar to those of classical dyadic wavelets. Typically, A expands or contracts only in certain directions, while B acts by volume-preserving maps in transverse directions. Then the resulting wavelets exhibit the geometric properties, e.g., directionality, elongated shapes, scales, oscillations, recently advocated by many authors for multidimensional signal and image processing applications. Our method is a systematic approach to the theory of affine-like systems yielding these and more general features.