Titlebook: NAPAW 92; Proceedings of the F S. Purushothaman,Amy Zwarico Conference proceedings 1993 British Computer Society 1993 Bisimulation.algebra.

預(yù)測

Modal Logics in Timed Process Algebrasis timed, that is labels are either action labels or elements from a time domain..Modal logics can be used to express properties of transition systems. Timed modal logics are modal logics whose sort is timed. hi this paper we consider timed propositional modal logic and timed modal .-calculus. Defin

品嘗你的人

A Process Calculus with Incomparable Prioritiesng from different processes by regarding their priorities to be incomparable. We define a prioritized bisimulation equivalence and discuss its relation to “the natural” congruence relation for our calculus. We illustrate the calculus with two small examples.

incision

過多

Exception Handling in Process AlgebraProcesses (ACP) as our starting point and equationally define strong bisimulation for ACP extended with exception handling primitives. This theory is then applied to showing fault tolerance under an explicitly stated fault hypothesis of a system that is made more fault resilient by applying dynamic

STALL

Observation Treesons of the corresponding computations. The trees are compared via bisimulations and it is shown that various observational equivalences proposed in the literature can be recast in a general experimental setting. This permits assessing the different equivalences and putting forward criteria for choos

Hemiplegia

Verification of Value-Passing Systemserify systems with values of large or infinite sort which are not finite-state..We show how to represent systems with values, specified in a process algebra, by a graph with parameters. This representation resembles a flow-chart. The size of the graph is independent of the size of the sorts. We show

Agronomy

entreat

來就得意

A Causality-based Semantics for CCSis approach relies on a simple intuition related to the expression of causal relationships among occurrences of actions, in a way closely related to the notion of variable abstraction of Lambda-Calculus. Main results deal with the definition of an operational semantics, as well as with the character

ERUPT

A π-calculus Semantics of Logical Variables and Unificationented. The π-calculus’s object-oriented approach to modelling evolving communication structures is used to model the evolving communication environment found in concurrent logic program computations. The novelty of this semantics is that it explicitly models logic variables as active channels. These