Behavioral modeling of PWL analog circuits using symbolic analysis

Behavioral models are used both for top-down design and for bottom-up verification. During top-down design, models are created that reflect the nominal behavior of the different analog functions, as well as the constraints imposed by the parasitics. In this scenario, the availability of symbolic modeling expressions enable designers to get insight on the circuits, and reduces the computational cost of design space exploration. During bottom-up verification, models are created that capture the topological and constitutive equations of the underlying devices into behavioral descriptions. In this scenario symbolic analysis is useful because it enables to automatically obtain these descriptions in the form of equations. This paper includes an example to illustrate the use of symbolic analysis for top-down design.Comisión Interministerial de Ciencia y Tecnología TIC97-058

Behavioral Equivalences

Beahvioral equivalences serve to establish in which cases two reactive (possible concurrent) systems offer similar interaction capabilities relatively to other systems representing their operating environment. Behavioral equivalences have been mainly developed in the context of process algebras, mathematically rigorous languages that have been used for describing and verifying properties of concurrent communicating systems. By relying on the so called structural operational semantics (SOS), labelled transition systems, are associated to each term of a process algebra. Behavioral equivalences are used to abstract from unwanted details and identify those labelled transition systems that react “similarly” to external experiments. Due to the large number of properties which may be relevant in the analysis of concurrent systems, many different theories of equivalences have been proposed in the literature. The main contenders consider those systems equivalent that (i) perform the same sequences of actions, or (ii) perform the same sequences of actions and after each sequence are ready to accept the same sets of actions, or (iii) perform the same sequences of actions and after each sequence exhibit, recursively, the same behavior. This approach leads to many different equivalences that preserve significantly different properties of systems

Making use of Capuchins’ behavioral propensities to obtain hair samples for DNA analyses

Genotyping wild and captive capuchins has become a priority and hair bulbs have high quality DNA. Here, we describe a method to non-invasively collect fresh-plucked strands of hair that exploits capuchins’ manual dexterity and propensity to grasp and extract food. The apparatus consists of a transparent tube baited with food. Its extraction requires the monkey to place its forearm in contact with double-sided tape applied on the inner surface of the tube entrance. The “tube” method, successfully implemented with captive (N=23) and wild (N=21) capuchins, allowed us to obtain hair bulbs from most individuals and usable genomic DNA was extracted even from a single bulb

Behavioral Psychology

Excerpt: Behavioral psychology is concerned with the conditions involved in development, maintenance, and control of the behavior of individuals and other organisms. Behavioral approaches have been developed in many areas of applied psychology. These raise a number of issues important from a Christian perspective

Coalgebraic Behavioral Metrics

We study different behavioral metrics, such as those arising from both branching and linear-time semantics, in a coalgebraic setting. Given a coalgebra $\alpha\colon X \to HX$ for a functor $H \colon \mathrm{Set}\to \mathrm{Set}$, we define a framework for deriving pseudometrics on $X$ which measure the behavioral distance of states. A crucial step is the lifting of the functor $H$ on $\mathrm{Set}$ to a functor $\overline{H}$ on the category $\mathrm{PMet}$ of pseudometric spaces. We present two different approaches which can be viewed as generalizations of the Kantorovich and Wasserstein pseudometrics for probability measures. We show that the pseudometrics provided by the two approaches coincide on several natural examples, but in general they differ. If $H$ has a final coalgebra, every lifting $\overline{H}$ yields in a canonical way a behavioral distance which is usually branching-time, i.e., it generalizes bisimilarity. In order to model linear-time metrics (generalizing trace equivalences), we show sufficient conditions for lifting distributive laws and monads. These results enable us to employ the generalized powerset construction