We organize Models of Computation (MoC) with respect to their time abstraction. We distinguish between continuous time, discrete time, synchronous and untimed MoCs. System level models serve a variety of objectives with partially contradicting requirements. Consequently, different MoCs are necessary for the various tasks and phases in the design of an embedded system. We trace the impact of MoC...

This paper considers solving optimization problem for linear discrete time systems such that closed-loop discrete-time system is positive (i.e., all of its state variables have non-negative values) and also finite-time stable. For this purpose, by considering a quadratic cost function, an optimal controller is designed such that in addition to minimizing the cost function, the positivity proper...

Stateful aspects is a recent topic in AOSD. As the trigger of a stateful aspect depends on the system execution trace, it needs complicate modeling mechanisms for the pointcuts and weaving operations. We present an approach to weaving stateful aspects using Labelled Transition System (LTS). In the approach, the base system is specified as a LTS. The pointcut is modeled as an extended LTS that o...

We consider two discrete completely integrable evolutions: the Toda Lattice and Ablowitz–Ladik system. The principal thrust of paper is development microscopic conservation laws that witness perturbation determinant under these dynamics. In this way, we obtain analogues objects found essential in our recent analyses KdV, NLS, mKdV. concert with this, revisit classical topic attendant to (renorm...

Considering a temperature dependent two-level quantum system, we have numerically solved the Landau-Zener transition problem. The method includes the incorporation of temperature effect as a thermal noise added Schrödinger equation for the construction of the Hamiltonian. Here, the obtained results which describe the changes in the system including the quantum states and the transition pro...

First we define a new type of transition system in which states are symbolic (i.e., we should think of them as distributions on concrete states) and transitions are probabilistic. Apart from the intended meaning of states, this system type is equivalent to a special case of Segala’s general PA. We propose a (non-deterministic) composition mechanism for this system type, as well as trace distrib...

Gamma is a language of conditional multiset rewrites, which can be seen either as a parallel programming language or as a speciication language for parallel algorithms. Taking the latter view, we are interested in program reenement and formal techniques for reasoning about it. In the present paper we apply Abramsky's framework of domain theory in logical form, to systematically develop a progra...

The nucleus accumbens (n. acc.) has been implicated in conditioning to both discrete and contextual cues but its precise role is as yet controversial because conflicting patterns of effect have been reported. These inconsistencies may relate to the extent to which the lesions used encroach on different subfields of n. acc. and the use of different task variants. The present study compared the e...

ion Refinement for Termination⋆ Byron Cook, Andreas Podelski, and Andrey Rybalchenko 1 Microsoft Research, Cambridge 2 Max-Planck-Institut für Informatik, Saarbrücken Abstract. 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 prope...