Results 1 
4 of
4
"On the Fly" Verification of Behavioural Equivalences and Preorders
, 1991
"... This paper describes decision procedures for bisimulation and simulation relations between two transition systems. The algorithms proposed here do not need to previously construct them: the verification can be performed during their generation. In addition, a diagnosis is computed when the two trans ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
This paper describes decision procedures for bisimulation and simulation relations between two transition systems. The algorithms proposed here do not need to previously construct them: the verification can be performed during their generation. In addition, a diagnosis is computed when the two transitions systems are not equivalent. 1 Introduction One of the successful approaches used for the verification of systems of communicating processes is provided by behavioral equivalence and preorder relations, which allow to compare different descriptions of a given system. More precisely, if we note S (Specification) the most abstract description of the system and I (Implementation) the most detailed one, it is possible to check whether I is in fact an implementation of S in the following manner: from S and I , generate two Labeled Transition Systems (LTS for short) S 1 and S 2 . Let R be an appropriate equivalence relation or preorder relation on LTS. Then, I implements S if and only if S ...
A Tool Set for deciding Behavioral Equivalences
 In Proceedings of CONCUR'91
, 1991
"... This paper deals with verification methods based on equivalence relations between labeled transition systems. More precisely, we are concerned by two practical needs: how to efficiently minimize and compare labeled transition systems with respect to bisimulation or simulationbased equivalence relat ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
(Show Context)
This paper deals with verification methods based on equivalence relations between labeled transition systems. More precisely, we are concerned by two practical needs: how to efficiently minimize and compare labeled transition systems with respect to bisimulation or simulationbased equivalence relations. First, we recall the principle of the classical algorithms for the existing equivalence relations, which are based on successive partition refinements of the state space of the labeled transition systems under consideration. However, in spite of their theoretical efficiency, the main drawback of these algorithms is that they require to generate and to store in memory the whole labeled transition systems to be compared or minimized. Therefore, the size of the systems which can be handled in practice remains limited. We propose here another approach, allowing to combine the generation and the verification phases, which is based on two algorithms respectively devoted to the comparison ("o...
Synthesizing Distunguishing Formulae for Real Time Systems
, 1994
"... This paper describes a technique for generating diagnostic information for the timed bisimulation equivalence and the timed simulation preorder. More precisely, ..."
Abstract
 Add to MetaCart
This paper describes a technique for generating diagnostic information for the timed bisimulation equivalence and the timed simulation preorder. More precisely,
Bisimulation Respecting FirstOrder Operations.
"... We identify two features of common process algebra operations: their rstorder avour and the fact that they respect bisimulation in a uniform manner. For this purpose two notions are introduced: rst, a notion of rstorder de nable operations on process graphs and second, respect for sequence extensi ..."
Abstract
 Add to MetaCart
(Show Context)
We identify two features of common process algebra operations: their rstorder avour and the fact that they respect bisimulation in a uniform manner. For this purpose two notions are introduced: rst, a notion of rstorder de nable operations on process graphs and second, respect for sequence extension. In the rst part of the paper those rstorder de nable operations are characterised whose de ning formulas respect sequence extension. The second part uses the resulting format to calculate modal preconditions: it gives an algorithm that reduces modal truth in the output of certain process graph operations to modal truth in the inputs of this operation. 1