1,307 research outputs found
Topology, randomness and noise in process calculus
Formal models of communicating and concurrent systems are one of the most important topics in formal methods, and process calculus is one of the most successful formal models of communicating and concurrent systems. In the previous works, the author systematically studied topology in process calculus, probabilistic process calculus and pi-calculus with noisy channels in order to describe approximate behaviors of communicating and concurrent systems as well as randomness and noise in them. This article is a brief survey of these works. Ā© Higher Education Press 2007
The categorical limit of a sequence of dynamical systems
Modeling a sequence of design steps, or a sequence of parameter settings,
yields a sequence of dynamical systems. In many cases, such a sequence is
intended to approximate a certain limit case. However, formally defining that
limit turns out to be subject to ambiguity. Depending on the interpretation of
the sequence, i.e. depending on how the behaviors of the systems in the
sequence are related, it may vary what the limit should be. Topologies, and in
particular metrics, define limits uniquely, if they exist. Thus they select one
interpretation implicitly and leave no room for other interpretations. In this
paper, we define limits using category theory, and use the mentioned relations
between system behaviors explicitly. This resolves the problem of ambiguity in
a more controlled way. We introduce a category of prefix orders on executions
and partial history preserving maps between them to describe both discrete and
continuous branching time dynamics. We prove that in this category all
projective limits exist, and illustrate how ambiguity in the definition of
limits is resolved using an example. Moreover, we show how various problems
with known topological approaches are now resolved, and how the construction of
projective limits enables us to approximate continuous time dynamics as a
sequence of discrete time systems.Comment: In Proceedings EXPRESS/SOS 2013, arXiv:1307.690
Formal analysis techniques for gossiping protocols
We give a survey of formal verification techniques that can be used to corroborate existing experimental results for gossiping protocols in a rigorous manner. We present properties of interest for gossiping protocols and discuss how various formal evaluation techniques can be employed to predict them
An Algebra of Quantum Processes
We introduce an algebra qCCS of pure quantum processes in which no classical
data is involved, communications by moving quantum states physically are
allowed, and computations is modeled by super-operators. An operational
semantics of qCCS is presented in terms of (non-probabilistic) labeled
transition systems. Strong bisimulation between processes modeled in qCCS is
defined, and its fundamental algebraic properties are established, including
uniqueness of the solutions of recursive equations. To model sequential
computation in qCCS, a reduction relation between processes is defined. By
combining reduction relation and strong bisimulation we introduce the notion of
strong reduction-bisimulation, which is a device for observing interaction of
computation and communication in quantum systems. Finally, a notion of strong
approximate bisimulation (equivalently, strong bisimulation distance) and its
reduction counterpart are introduced. It is proved that both approximate
bisimilarity and approximate reduction-bisimilarity are preserved by various
constructors of quantum processes. This provides us with a formal tool for
observing robustness of quantum processes against inaccuracy in the
implementation of its elementary gates
- ā¦