Non-ideal particle distributions from kinetic freeze out models

In fluid dynamical models the freeze out of particles across a three dimensional space-time hypersurface is discussed. The calculation of final momentum distribution of emitted particles is described for freeze out surfaces, with both space-like and time-like normals, taking into account conservation laws across the freeze out discontinuity

Effective Analysis of C Programs by Rewriting Variability

Context. Variability-intensive programs (program families) appear in many application areas and for many reasons today. Different family members, called variants, are derived by switching statically configurable options (features) on and off, while reuse of the common code is maximized. Inquiry. Verification of program families is challenging since the number of variants is exponential in the number of features. Existing single-program analysis and verification tools cannot be applied directly to program families, and designing and implementing the corresponding variability-aware versions is tedious and laborious. Approach. In this work, we propose a range of variability-related transformations for translating program families into single programs by replacing compile-time variability with run-time variability (non-determinism). The obtained transformed programs can be subsequently analyzed using the conventional off- the-shelf single-program analysis tools such as type checkers, symbolic executors, model checkers, and static analyzers. Knowledge. Our variability-related transformations are outcome-preserving, which means that the relation between the outcomes in the transformed single program and the union of outcomes of all variants derived from the original program family is equality. Grounding. We show our transformation rules and their correctness with respect to a minimal core imperative language IMP. Then, we discuss our experience of implementing and using the transformations for efficient and effective analysis and verification of real-world C program families. Importance. We report some interesting variability-related bugs that we discovered using various state-of-the-art single-program C verification tools, such as Frama-C, Clang, LLBMC.Comment: The Art, Science, and Engineering of Programming, Vol. 1, Issue 1, Article

Freeze out in hydrodynamical models

We study the effects of strict conservation laws and the problem of negative contributions to final momentum distribution during the freeze out through 3-dimensional hypersurfaces with space-like normal. We study some suggested solutions for this problem, and demonstrate it on one example. PACS: 24.10.Nz, 25.75.-

Freeze-out in hydrodynamical models in relativistic heavy ion collisions

In continuum and fluid dynamical models, particles, which leave the system and reach the detectors, can be taken into account via freeze-out (FO) or final break-up schemes, where the frozen out particles are formed on a 3-dimensional hypersurface in space-time. Such FO descriptions are important ingredients of evaluations of two-particle correlation data, transverse-, longitudinal-, radial- and cylindrical- flow analyses, transverse momentum and transverse mass spectra and many other observables. The FO on a hypersurface is a discontinuity, where the pre FO equilibrated and interacting matter abruptly changes to non-interacting particles, showing an ideal gas type of behavior

Large p(t) enhancement from freeze out

Freeze out of particles across three dimensional space-time hypersurface is discussed in a simple kinetic model. The final momentum distribution of emitted particles, for freeze out surfaces with space-like normal, shows a non-exponential transverse momentum spectrum. The slope parameter of the pt distribution increases with increasing pt, in agreement with recently measured SPS pion and h spectra

Kinetic freeze out models

Freeze out of particles across a space-time hypersurface is discussed in kinetic models. The calculation of final momentum distribution of emitted particles is described for freeze out surfaces, with spacelike normals. The resulting non-equilibrium distribution does not resemble, the previously proposed, cut Jüttner distribution, and shows non-exponential pt-spectra similar to the ones observed in experiments. PACS: 24.10.Nz, 25.75.-

Variability Abstraction and Refinement for Game-Based Lifted Model Checking of Full CTL

One of the most promising approaches to fighting the configuration space explosion problem in lifted model checking are variability abstractions. In this work, we define a novel game-based approach for variability-specific abstraction and refinement for lifted model checking of the full CTL, interpreted over 3-valued semantics. We propose a direct algorithm for solving a 3-valued (abstract) lifted model checking game. In case the result of model checking an abstract variability model is indefinite, we suggest a new notion of refinement, which eliminates indefinite results. This provides an iterative incremental variability-specific abstraction and refinement framework, where refinement is applied only where indefinite results exist and definite results from previous iterations are reused. The practicality of this approach is demonstrated on several variability models

Generalized abstraction-refinement for game-based CTL lifted model checking

cation areas ranging from embedded system domains to system-level software and communication protocols. Software Product Line methods and architectures allow effective building many custom variants of a software system in these domains. In many of the applications, their rigorous verification and quality assurance are of paramount importance. Lifted model checking for system families is capable of verifying all their variants simultaneously in a single run by exploiting the similarities between the variants. The computational cost of lifted model checking still greatly depends on the number of variants (the size of configuration space), which is often huge. Variability abstractions have successfully addressed this configuration space explosion problem, giving rise to smaller abstract variability models with fewer abstract configurations. Abstract variability models are given as modal transition systems, which contain may (over-approximating) and must (under-approximating) transitions. Thus, they preserve both universal and existential CTL properties. In this work, we bring two main contributions. First, we define a novel game-based approach for variability-specific abstraction and refinement for lifted model checking of the full CTL, interpreted over 3-valued semantics. We propose a direct algorithm for solving a 3-valued (abstract) lifted model checking game. In case the result of model checking an abstract variability model is indefinite, we suggest a new notion of refinement, which eliminates indefinite results. This provides an iterative incremental variability-specific abstraction and refinement framework, where refinement is applied only where indefinite results exist and definite results from previous iterations are reused. Second, we propose a new generalized definition of abstract variability models, given as so-called generalized modal transition systems, by introducing the notion of (must) hyper-transitions. This results in more precise abstract models in which more CTL formulae can be proved or disproved. We integrate the newly defined generalized abstract variability models in the existing abstraction-refinement framework for game-based lifted model checking of CTL. Finally, we evaluate the practicality of this approach on several system families