correctly represents the software. In contrast, model-driven software development advocates developing the model first and deriving the software through a sequence of correctness-preserving model transformations. In this report, we describe CASP (Constraint Automata with Synchronization Points): a model

Abstract. This paper introduces new invariants for multiparameter dynamical systems. This is done by counting the number of points whose orbits intersect at time n under simultaneous iteration of finitely many endomorphisms. We call these points synchronization points. The resulting sequences

, those two paths are synchronized in the sens that they have a common subpath between two points: the location where the passenger is picked up and the one where he is dropped off the car. The passenger path may include time-dependent public transportation parts before or after the common subpath

, strong and weak observational equivalence of finite transition systems, and language containment for finite w-automata. The fixed point computations for each decision procedure are sometimes complex. but can be concisely expressed in the Mu-Calculus. We illustrate the practicality of our approach

This paper describes a circuit transformation called retiming in which registers are added at some points in a circuit and removed from others in such a way that the functional behavior of the circuit as a whole is preserved. We show that retiming can be used to transform a given synchronous

, and a practical design for location-hidden services via rendezvous points. Tor works on the real-world Internet, requires no special privileges or kernel modifications, requires little synchronization or coordination between nodes, and provides a reasonable tradeoff between anonymity, usability

. In this paper, a synchronous approach is applied to specify and validate telecommunication features. A service is viewed as a reactive system and is fully described in Lustre, an executable specification language. The service properties are stated in the same language and feature validation

this technique completely eliminates the idling that would otherwise occur at barrier synchronization points, it may also change the computation and therefore the result that the computation produces. We address this issue by providing probabilistic distortion models that characterize how the use of early phase

protocols, prediction relaxes the high bandwidth requirements by replacing broadcast with multicast. In this work, we propose a new run-time coherence target prediction scheme that exploits the inherent correlation between synchronization points in a program and coherence communication. Our workload

to large delays, and shed a new light on the corresponding stabilization problem. In particular, for a chain of multiple oscillators the determination of a stabilizing value of the delay parameter is interpreted as a phase synchronization problem. The results are illustrated with the output feedback