Sigref – A Symbolic Bisimulation Tool Box

We present a uniform signature-based approach to compute the most popular bisimulations. Our approach is implemented symbolically using BDDs, which enables the handling of very large transition systems. Signatures for the bisimulations are built up from a few generic building blocks, which naturally correspond to efficient BDD operations. Thus, the definition of an appropriate signature is the key for a rapid development of algorithms for other types of bisimulation. We provide experimental evidence of the viability of this approach by presenting computational results for many bisimulations on real-world instances. The experiments show cases where our framework can handle state spaces efficiently that are far too large to handle for any tool that requires an explicit state space description. This work was partly supported by the German Research Council (DFG) as part of the Transregional Collaborative Research Center “Automatic Verification and Analysis of Complex Systems” (SFB/TR 14 AVACS). See www.avacs.org for more information

Prehension and perception of size in left visual neglect

Right hemisphere damaged patients with and without left visual neglect, and age-matched controls had objects of various sizes presented within left or right body hemispace. Subjects were asked to estimate the objects’ sizes or to reach out and grasp them, in order to assess visual size processing in perceptual-experiential and action-based contexts respectively. No impairments of size processing were detected in the prehension performance of the neglect patients but a generalised slowing of movement was observed, associated with an extended deceleration phase. Additionally both patient groups reached maximum grip aperture relatively later in the movement than did controls. For the estimation task it was predicted that the left visual neglect group would systematically underestimate the sizes of objects presented within left hemispace but no such abnormalities were observed. Possible reasons for this unexpected null finding are discussed

Rate-Based Transition Systems for Stochastic Process Calculi

A variant of Rate Transition Systems (RTS), proposed by Klin and Sassone, is introduced and used as the basic model for defining stochastic behaviour of processes. The transition relation used in our variant associates to each process, for each action, the set of possible futures paired with a measure indicating their rates. We show how RTS can be used for providing the operational semantics of stochastic extensions of classical formalisms, namely CSP and CCS. We also show that our semantics for stochastic CCS guarantees associativity of parallel composition. Similarly, in contrast with the original definition by Priami, we argue that a semantics for stochastic π-calculus can be provided that guarantees associativity of parallel composition

Compositional Performance Modelling with the TIPPtool

Stochastic process algebras have been proposed as compositional specification formalisms for performance models. In this paper, we describe a tool which aims at realising all beneficial aspects of compositional performance modelling, the TIPPtool. It incorporates methods for compositional specification as well as solution, based on state-of-the-art techniques, and wrapped in a user-friendly graphical front end. Apart from highlighting the general benefits of the tool, we also discuss some lessons learned during development and application of the TIPPtool. A non-trivial model of a real life communication system serves as a case study to illustrate benefits and limitations

On Observing Dynamic Prioritised Actions in SOC

We study the impact on observational semantics for SOC of priority mechanisms which combine dynamic priority with local pre-emption. We define manageable notions of strong and weak labelled bisimilarities for COWS, a process calculus for SOC, and provide alternative characterisations in terms of open barbed bisimilarities. These semantics show that COWS’s priority mechanisms partially recover the capability to observe receive actions (that could not be observed in a purely asynchronous setting) and that high priority primitives for termination impose specific conditions on the bisimilarities

Longitudinal and Transverse Response Functions in ^(56)Fe(e,e') at Momentum Transfer near 1 GeV/c

Inclusive electron-scattering cross sections have been measured for ^(56)Fe in the quasielastic region at electron energies between 0.9 and 4.3 GeV, at scattering angles of 15° and 85°. Longitudinal and transverse response functions at a q of 1.14 GeV/c have been extracted using a Rosenbluth separation. The experimental Coulomb sum has been obtained with aid of an extrapolation. The longitudinal response function, after correction for Coulomb distortion, is lower than quasifree-scattering-model predictions at the quasielastic peak and on the high-ω side

Compositional nonblocking verification with always enabled events and selfloop-only events

This paper proposes to improve compositional nonblocking verification through the use of always enabled and selfloop-only events. Compositional verification involves abstraction to simplify parts of a system during verification. Normally, this abstraction is based on the set of events not used in the remainder of the system, i.e., in the part of the system not being simplified. Here, it is proposed to exploit more knowledge about the system and abstract events even though they are used in the remainder of the system. Abstraction rules from previous work are generalised, and experimental results demonstrate the applicability of the resulting algorithm to verify several industrial-scale discrete event system models, while achieving better state-space reduction than before

Hierarchical models for service-oriented systems

We present our approach to the denotation and representation of hierarchical graphs: a suitable algebra of hierarchical graphs and two domains of interpretations. Each domain of interpretation focuses on a particular perspective of the graph hierarchy: the top view (nested boxes) is based on a notion of embedded graphs while the side view (tree hierarchy) is based on gs-graphs. Our algebra can be understood as a high-level language for describing such graphical models, which are well suited for defining graphical representations of service-oriented systems where nesting (e.g. sessions, transactions, locations) and linking (e.g. shared channels, resources, names) are key aspects

Search for fractionally charged particles

An ion source and a charge spectrometer system have been used to search in solid, stable matter for particles with nonintegral charge. Samples of niobium, tungsten, selenium, and meteorites were searched for fractionally charged particles with effective nuclear charge Z=N+(1/3e (N=0,1,...), and Z=N+(2/3e (N=0,1). No positive signal was observed and concentration limits are reported