Dynamic-Epistemic reasoning on distributed systems

We propose a new logic designed for modelling and reasoning about information flow and information exchange between spatially located (but potentially mobile), interconnected agents witnessing a distributed computation. This is a major problem in the field of distributed systems, covering many different issues, with potential applications from Computer Science and Economy to Chemistry and Systems Biology. Underpinning on the dual algebraical-coalgebraical characteristics of process calculi, we design a decidable and completely axiomatizad logic that combines the processalgebraical/ equational and the modal/coequational features and is developed for process-algebraical semantics. The construction is done by mixing operators from dynamic and epistemic logics with operators from spatial logics for distributed and mobile systems. This is the preliminary version of a paper that will appear in Proceedings of the second Conference on Algebra and Coalgebra in Computer Science (CALCO2007), LNCS 4624, Springer, 2007. The original publication is available at www.springerlink.co

A Process Algebraical Approach to Modelling Compartmentalized Biological Systems

This paper introduces Protein Calculus, a special modeling language designed for encoding and calculating the behaviors of compartmentilized biological systems. The formalism combines, in a unified framework, two successful computational paradigms - process algebras and membrane systems. The goal of Protein Calculus is to provide a formal tool for transforming collected information from in vivo experiments into coded definition of the different types of proteins, complexes of proteins, and membrane-organized systems of such entities. Using this encoded information as input, our calculus computes, in silico, the possible behaviors of a living system. This is the preliminary version of a paper that was published in Proceedings of International Conference of Computational Methods in Sciences and Engineering (ICCMSE), American Institute of Physics, AIP Proceedings, N 2: 642-646, 2007 (http://scitation.aip.org/dbt/dbt.jsp?KEY=APCPCS&Volume=963&Issue=2)

Model Checking Dynamic-Epistemic Spatial Logic

In this paper we focus on Dynamic Spatial Logic, the extension of Hennessy-Milner logic with the parallel operator. We develop a sound complete Hilbert-style axiomatic system for it comprehending the behavior of spatial operators in relation with dynamic/temporal ones. Underpining on a new congruence we define over the class of processes - the structural bisimulation - we prove the finite model property for this logic that provides the decidability for satisfiability, validity and model checking against process semantics. Eventualy we propose algorithms for validity, satisfiability and model checking

Definition and stability of Lorentzian manifolds with distributional curvature

Following Geroch, Traschen, Mars and Senovilla, we consider Lorentzian manifolds with distributional curvature tensor. Such manifolds represent spacetimes of general relativity that possibly contain gravitational waves, shock waves, and other singular patterns. We aim here at providing a comprehensive and geometric (i.e., coordinate-free) framework. First, we determine the minimal assumptions required on the metric tensor in order to give a rigorous meaning to the spacetime curvature within the framework of distribution theory. This leads us to a direct derivation of the jump relations associated with singular parts of connection and curvature operators. Second, we investigate the induced geometry on a hypersurface with general signature, and we determine the minimal assumptions required to define, in the sense of distributions, the curvature tensors and the second fundamental form of the hypersurface and to establish the Gauss-Codazzi equations.Comment: 28 page

Isometric immersions into the Minkowski spacetime for Lorentzian manifolds with limited regularity

Assuming minimal regularity assumptions on the data, we revisit the classical problem of finding isometric immersions into the Minkowski spacetime for hypersurfaces of a Lorentzian manifold. Our approach encompasses metrics having Sobolev regularity and Riemann curvature defined in the distributional sense, only. It applies to timelike, spacelike, or null hypersurfaces with arbitrary signature that possibly changes from point to point

and

A basic theorem from differential geometry asserts that, if the Riemann curvature tensor associated with a field C of class C 2 of positive-definite symmetric matrices of order n vanishes in a connected and simply-connected open subset Ω of R n, then there exists an immersion Θ ∈ C 3 (Ω; R n), uniquely determined up to isometries in R n, such that C is the metric tensor field of the manifold Θ(Ω), then isometrically immersed in R n. Let ˙ Θ denote the equivalence class of Θ modulo isometries in R n and let F: C → ˙ Θ denote the mapping determined in this fashion. The first objective of this paper is to show that, if Ω satisfies a certain “geodesic property ” (in effect a mild regularity assumption on the boundary ∂Ω of Ω) and if the field C and its partial derivatives of order ≤ 2 have continuous extensions to Ω, the extension of the field C remaining positive-definite on Ω, then the immersion Θ and its partial derivatives of order ≤ 3 also have continuous extensions to Ω. The second objective is to show that, under a slightly stronger regularity assumption on ∂Ω, the above extension result combined with a fundamental theorem o

Timed Comparisons of Semi-Markov Processes

Semi-Markov processes are Markovian processes in which the firing time of the transitions is modelled by probabilistic distributions over positive reals interpreted as the probability of firing a transition at a certain moment in time. In this paper we consider the trace-based semantics of semi-Markov processes, and investigate the question of how to compare two semi-Markov processes with respect to their time-dependent behaviour. To this end, we introduce the relation of being "faster than" between processes and study its algorithmic complexity. Through a connection to probabilistic automata we obtain hardness results showing in particular that this relation is undecidable. However, we present an additive approximation algorithm for a time-bounded variant of the faster-than problem over semi-Markov processes with slow residence-time functions, and a coNP algorithm for the exact faster-than problem over unambiguous semi-Markov processes

Computing Probabilistic Bisimilarity Distances for Probabilistic Automata

The probabilistic bisimilarity distance of Deng et al. has been proposed as a robust quantitative generalization of Segala and Lynch's probabilistic bisimilarity for probabilistic automata. In this paper, we present a characterization of the bisimilarity distance as the solution of a simple stochastic game. The characterization gives us an algorithm to compute the distances by applying Condon's simple policy iteration on these games. The correctness of Condon's approach, however, relies on the assumption that the games are stopping. Our games may be non-stopping in general, yet we are able to prove termination for this extended class of games. Already other algorithms have been proposed in the literature to compute these distances, with complexity in $\textbf{UP} \cap \textbf{coUP}$ and \textbf{PPAD}. Despite the theoretical relevance, these algorithms are inefficient in practice. To the best of our knowledge, our algorithm is the first practical solution. The characterization of the probabilistic bisimilarity distance mentioned above crucially uses a dual presentation of the Hausdorff distance due to M\'emoli. As an additional contribution, in this paper we show that M\'emoli's result can be used also to prove that the bisimilarity distance bounds the difference in the maximal (or minimal) probability of two states to satisfying arbitrary $\omega$-regular properties, expressed, eg., as LTL formulas

Probabilistic Mu-Calculus: Decidability and Complete Axiomatization

We introduce a version of the probabilistic mu-calculus (PMC) built on top of a probabilistic modal logic that allows encoding n-ary inequational conditions on transition probabilities. PMC extends previously studied calculi and we prove that, despite its expressiveness, it enjoys a series of good meta-properties. Firstly, we prove the decidability of satisfiability checking by establishing the small model property. An algorithm for deciding the satisfiability problem is developed. As a second major result, we provide a complete axiomatization for the alternation-free fragment of PMC. The completeness proof is innovative in many aspects combining various techniques from topology and model theory