114 research outputs found
Weak bisimulations for labelled transition systems weighted over semirings
Weighted labelled transition systems are LTSs whose transitions are given
weights drawn from a commutative monoid. WLTSs subsume a wide range of LTSs,
providing a general notion of strong (weighted) bisimulation. In this paper we
extend this framework towards other behavioural equivalences, by considering
semirings of weights. Taking advantage of this extra structure, we introduce a
general notion of weak weighted bisimulation. We show that weak weighted
bisimulation coincides with the usual weak bisimulations in the cases of
non-deterministic and fully-probabilistic systems; moreover, it naturally
provides a definition of weak bisimulation also for kinds of LTSs where this
notion is currently missing (such as, stochastic systems). Finally, we provide
a categorical account of the coalgebraic construction of weak weighted
bisimulation; this construction points out how to port our approach to other
equivalences based on different notion of observability
Association of Under-Approximation Techniques for Generating Tests from Models
International audienceIn this paper we present a Model-Based Testing approach with which we generate tests from an abstraction of a source behavioural model. We show a new algorithm that computes the abstraction as an under-approximation of the source model. Our first contribution is to combine two previous approaches proposed by Ball and Pasareanu et al. to compute May, Must+ and Must- abstract transition relations. Prooftechniques are used to compute these transition relations. The tests obtained by covering the abstract transitions have to be instantiated from the source model. So, following Pasareanu et al., our algorithm additionally computes a concrete transition relation: the tests obtained as sequences of concrete transitions need not be instantiated from the source model. Another contribution is to propose a choice of relevant paramaters and heuristics to pilot the tests computation. We experiment our approach and compare it with a previous approach of ours to compute tests from an abstraction that over-approximates the source model
Formal Relationships Between Geometrical and Classical Models for Concurrency
A wide variety of models for concurrent programs has been proposed during the
past decades, each one focusing on various aspects of computations: trace
equivalence, causality between events, conflicts and schedules due to resource
accesses, etc. More recently, models with a geometrical flavor have been
introduced, based on the notion of cubical set. These models are very rich and
expressive since they can represent commutation between any bunch of events,
thus generalizing the principle of true concurrency. While they seem to be very
promising - because they make possible the use of techniques from algebraic
topology in order to study concurrent computations - they have not yet been
precisely related to the previous models, and the purpose of this paper is to
fill this gap. In particular, we describe an adjunction between Petri nets and
cubical sets which extends the previously known adjunction between Petri nets
and asynchronous transition systems by Nielsen and Winskel
Strong coupling expansion for the Bose-Hubbard and the Jaynes-Cummings lattice model
A strong coupling expansion, based on the Kato-Bloch perturbation theory,
which has recently been proposed by Eckardt et al. [Phys. Rev. B 79, 195131]
and Teichmann et al. [Phys. Rev. B 79, 224515] is implemented in order to study
various aspects of the Bose-Hubbard and the Jaynes-Cummings lattice model. The
approach, which allows to generate numerically all diagrams up to a desired
order in the interaction strength is generalized for disordered systems and for
the Jaynes-Cummings lattice model. Results for the Bose-Hubbard and the
Jaynes-Cummings lattice model will be presented and compared with results from
VCA and DMRG. Our focus will be on the Mott insulator to superfluid transition.Comment: 29 pages, 21 figure
Experimental Aspects of Synthesis
We discuss the problem of experimentally evaluating linear-time temporal
logic (LTL) synthesis tools for reactive systems. We first survey previous such
work for the currently publicly available synthesis tools, and then draw
conclusions by deriving useful schemes for future such evaluations.
In particular, we explain why previous tools have incompatible scopes and
semantics and provide a framework that reduces the impact of this problem for
future experimental comparisons of such tools. Furthermore, we discuss which
difficulties the complex workflows that begin to appear in modern synthesis
tools induce on experimental evaluations and give answers to the question how
convincing such evaluations can still be performed in such a setting.Comment: In Proceedings iWIGP 2011, arXiv:1102.374
- …