Velocity fluctuations and population distribution in clusters of settling particles at low Reynolds number

A study on the spatial organization and velocity fluctuations of non Brownian spherical particles settling at low Reynolds number in a vertical Hele-Shaw cell is reported. The particle volume fraction ranged from 0.005 to 0.05, while the distance between cell plates ranged from 5 to 15 times the particle radius. Particle tracking revealed that particles were not uniformly distributed in space but assembled in transient settling clusters. The population distribution of these clusters followed an exponential law. The measured velocity fluctuations are in agreement with that predicted theoretically for spherical clusters, from the balance between the apparent weight and the drag force. This result suggests that particle clustering, more than a spatial distribution of particles derived from random and independent events, is at the origin of the velocity fluctuations.Comment: 13 pages, 8 figure

Forward Analysis and Model Checking for Trace Bounded WSTS

We investigate a subclass of well-structured transition systems (WSTS), the bounded---in the sense of Ginsburg and Spanier (Trans. AMS 1964)---complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as developed by Finkel and Goubault-Larrecq (Logic. Meth. Comput. Sci. 2012). Indeed, we prove that, unlike other conditions considered previously for the termination of forward analysis, boundedness is decidable. Boundedness turns out to be a valuable restriction for WSTS verification, as we show that it further allows to decide all $\omega$-regular properties on the set of infinite traces of the system

Accelerated Data-Flow Analysis

Acceleration in symbolic verification consists in computing the exact effect of some control-flow loops in order to speed up the iterative fix-point computation of reachable states. Even if no termination guarantee is provided in theory, successful results were obtained in practice by different tools implementing this framework. In this paper, the acceleration framework is extended to data-flow analysis. Compared to a classical widening/narrowing-based abstract interpretation, the loss of precision is controlled here by the choice of the abstract domain and does not depend on the way the abstract value is computed. Our approach is geared towards precision, but we don't loose efficiency on the way. Indeed, we provide a cubic-time acceleration-based algorithm for solving interval constraints with full multiplication

The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems

International audienceBounded languages have recently proved to be an important class of languages for the analysis of Turing-powerful models. For instance, bounded context-free languages are used to under-approximate the behav-iors of recursive programs. Ginsburg and Spanier have shown in 1966 that a bounded language L ⊆ a * 1 · · · a * d is context-free if, and only if, its Parikh image is a stratifiable semilinear set. However, the question whether a semilinear set is stratifiable, hereafter called the stratifiability problem, was left open, and remains so. In this paper, we give a partial answer to this problem. We focus on semilinear sets that are given as finite systems of linear inequalities, and we show that stratifiability is coNP-complete in this case. Then, we apply our techniques to the context-freeness problem for flat counter systems, that asks whether the trace language of a counter system intersected with a bounded regular language is context-free. As main result of the paper, we show that this problem is coNP-complete

Senescent ground tree rewrite systems

Ground Tree Rewrite Systems with State are known to have an undecidable control state reachability problem. Taking inspiration from the recent introduction of scope-bounded multi-stack pushdown systems, we define Senescent Ground Tree Rewrite Systems. These are a restriction of ground tree rewrite systems with state such that nodes of the tree may no longer be rewritten after having witnessed an a priori fixed number of control state changes. As well as generalising scope-bounded multi-stack pushdown systems, we show --- via reductions to and from reset Petri-nets --- that these systems have an Ackermann-complete control state reachability problem. However, reachability of a regular set of trees remains undecidable

How to Tackle Integer Weighted Automata Positivity

International audienceThis paper is dedicated to candidate abstractions to capture relevant aspects of the integer weighted automata. The expected effect of applying these abstractions is studied to build the deterministic reachability graphs allowing us to semi-decide the positivity problem on these automata. Moreover, the papers reports on the implementations and experimental results, and discusses other encodings

Bounded Model Checking for Parametric Timed Automata

Abstract. The paper shows how bounded model checking can be ap-plied to parameter synthesis for parametric timed automata with con-tinuous time. While it is known that the general problem is undecidable even for reachability, we show how to synthesize a part of the set of all the parameter valuations under which the given property holds in a model. The results form a complete theory which can be easily applied to parametric verification of a wide range of temporal formulae – we present such an implementation for the existential part of CTL −X. 1 Introduction and related work The growing abundance of complex systems in real world, and their presence in critical areas fuels the research in formal specification and analysis. One of the established methods in systems verification is model checking, where the system is abstracted into the algebraic model (e.g. various versions of Kripke structures

Tra Comune e Mercanzia: la giurisdizione fallimentare bolognese tra Basso Medioevo e prima Et\ue0 Moderna

Il saggio ricostruisce la disciplina fallimentare bolognese tra la fine del XIV e il XVI secolo, indagando sia gli Statuti della Mercanzia sia le provvisioni comunali. Dalla ricerca si evince come fine ultimo della procedura concursuale - ripercorsa nelle sue tappe principali - sia la garanzia dei creditori