Star formation efficiency in turbulent clouds

Here we present a simple, but nevertheless, instructive model for the star formation efficiency in turbulent molecular clouds. The model is based on the assumption of log-normal density distribution which reflects the turbulent nature of the interstellar medium (ISM). Together with the number count of cloud cores, which follows a Salpeter-like core mass function (CMF), and the minimum mass for the collapse of individual cloud cores, given by the local Jeans mass, we are able to derive the SFE for clouds as a function of their Jeans masses. We find a very generic power-law, SFE \propto (M_cloud/M_J)^{-0.26} and a maximum SFE_max \sim 1/3 for the Salpeter case. This result is independent of the turbulent Mach number but fairly sensitive to variations of the CMF.Comment: submitted to A&A, comments are welcom

On the set of certain conflicts of a given language

Two concurrent processes are said to be in conflict if they can get trapped in a situation where they both are waiting or running endlessly, forever unable to complete their common task. In the design of reactive systems, this is a common fault which can be very subtle and hard to detect. This paper studies conflicts in more detail and characterises the most general set of behaviours of a process which certainly leads to a conflict when accepted by another process running in parallel. It shows how this set of certain conflicts can be used to simplify the automatic detection of conflicts and thus the verification of reactive systems

The language of certain conflicts of a nondeterministic process

The language of certain conflicts is the most general set of behaviours of a nondeterministic process, which certainly lead to a livelock or deadlock when accepted by another process running in parallel. It is of great use in model checking to detect livelocks or deadlocks in very large systems, and in process-algebra to obtain abstractions preserving livelock and deadlock. Unfortunately, the language of certain conflicts is difficult to compute and has only been approximated in previous work. This paper presents an effective algorithm to calculate the language of certain conflicts for any given nondeterministic finite-state process and discusses its properties. The algorithm is shown to be correct and of exponential complexity

Traveling waves in high energy QCD

Saturation is expected to occur when a high density of partons (mainly gluons)- or equivalently strong fields in Quantum Chromodynamics (QCD) - is realized in the weak coupling regime. A way to reach saturation is through the high-energy evolution of an extended target probed at a fixed hard scale. In this case, the transition to saturation is expected to occur from nonlinear perturbative QCD dynamics. We discuss this approach to saturation, which is mathematically characterized by the appearance of traveling wave patterns in a suitable kinematical representation. A short review on traveling waves in high energy QCD and a first evidence of this phenomenon in deep-inelastic proton scattering are presented.Comment: 10 pages, 5 figures, talk given at the XXXVth International Symposium on Multiparticle Dynamics (ISMD05), Kromeriz, Czech Republic, August 9-15 200

Supervision equivalence

This paper presents a general framework for modular synthesis of supervisors for discrete event systems. The approach is based on compositional minimisation, using concepts of process equivalence. Its result is a compact representation of a least restrictive supervisor that ensures controllability and nonblocking. The method is demonstrated to reduce the number of states to be constructed for a simple manufacturing example, and the framework is proven to be sound

Compositional synthesis of discrete event systems via synthesis equivalence

A two-pass algorithm for compositional synthesis of modular supervisors for largescale systems of composed finite-state automata is proposed. The first pass provides an efficient method to determine whether a supervisory control problem has a solution, without explicitly constructing the synchronous composition of all components. If a solution exists, the second pass yields an over-approximation of the least restrictive solution which, if nonblocking, is a modular representation of the least restrictive supervisor. Using a new type of equivalence of nondeterministic processes, called synthesis equivalence, a wide range of abstractions can be employed to mitigate state-space explosion throughout the algorithm

Modular nonblocking verification using conflict equivalence

This paper proposes a modular approach to verifying whether a large discrete event system is nonconflicting. The new approach avoids computing the synchronous product of a large set of finite-state machines. Instead, the synchronous product is computed gradually, and intermediate results are simplified using conflict-preserving abstractions based on process-algebraic results about fair testing. Heuristics are used to choose between different possible abstractions. Experimental results show that the method is applicable to finite-state machine models of industrial scale and brings considerable improvements in performance over other methods