The dependence of coincidence of the global, local and pairwise Markov properties on the underlying undirected graph is examined. The pairs of these properties are found to be equivalent for graphs with some small exluded subgraphs. Prob-abilistic representations of the corresponding conditional independence structures are discussed.

We investigate bisimulation equivalence on Petri nets under durational semantics. Our motivation was to verify the conjecture that in durational setting, the bisimulation equivalence checking problem becomes more tractable (which is the case, e.g., over communication-free nets). We disprove this conjecture in three of four proposed variants of durational semantics. The fourth case remains an in...

The least common subsumer (lcs) w.r.t general EL-TBoxes does not need to exists in general due to cyclic axioms. In this report we present an algorithm for computing role-depth bounded EL-lcs based on the completion algorithm for EL. We extend this computation algorithm to a recently introduced probabilistic variant of EL: Prob-EL.

Rabin's Choice-coordination algorithm 5] allows a number of identical processes to agree on a choice between two alternatives while nevertheless executing asynchronously. The algorithm is analysed here with techniques based on prob-abilistic predicate transformers 3], in particular applying invariants and variants as set out in 2], and using a probabilistic temporal logic.

In the last few years solid state physics has increasingly benefited from scientific computing and the significance of numerical techniques is likely to keep on growing quickly in this field. Because of the high complexity of solids, which are made of a huge number of interacting electrons and nuclei, a full understanding of their properties cannot be developed using analytical methods only. Nu...

Writing a formal specification for real-life, industrial problems is a difficult and error prone task, even for experts in formal methods. In the process of specifying a formal model for later refinement and implementation it is crucial to get approval and feedback from domain experts to avoid the costs of changing a specification at a late point of the development. But understanding formal mod...

Lifted inference algorithms commonly exploit symmetries in a probabilistic graphical model (PGM) for efficient inference. However, existing algorithms for Boolean-valued domains can identify only those pairs of states as symmetric, in which the number of ones and zeros match exactly (count symmetries). Moreover, algorithms for lifted inference in multi-valued domains also compute a multi-valued...

This paper concerns numerical computation of a non-standard fourth order eigenvalue problem. For high order problems, Discontinuous Galerkin methods are competitive since they avoid some difficulties arising from other approaches. We show the well-posedness of the source problem. An interior penalty discontinuous Galerkin method using Lagrange elements (C0IPG) is proposed and its convergence is...

TLA and B share the common base of predicate logic, arithmetic and set theory. However, there are still considerable differences, such as very different approaches to typing and modularization. There is also considerable difference in the available tool support. In this paper, we present a translation of the non-temporal part of TLA to B, which makes it possible to feed TLA specifications into ...