Results 1  10
of
10
The Linear TimeBranching Time Spectrum II  The semantics of sequential systems with silent moves
, 1993
"... ion Rule (KFAR) (Baeten, Bergstra & Klop [3]), expresses a global fairness assumption. It says that when possible a system will escape from any cycle of internal actions. Some form of KFAR is crucial for many protocal verifications with unreliable channels, and for that reason preorders and equi ..."
Abstract

Cited by 311 (17 self)
 Add to MetaCart
ion Rule (KFAR) (Baeten, Bergstra & Klop [3]), expresses a global fairness assumption. It says that when possible a system will escape from any cycle of internal actions. Some form of KFAR is crucial for many protocal verifications with unreliable channels, and for that reason preorders and equivalences that satisfy KFAR are of special interest. Must preorders and divergence sensitive ones cannot satisfy KFAR. In Bergstra, Klop & Olderog [7] it is shown that the combination of KFAR with failure semantics is inconsistent, but they formulate a weaker version of KFAR that is satisfied in failure maysemantics. Still the combination of KFAR \Gamma and the liveness requirement appears to require global testing, and is only satisfied in the semantics between contrasimulation (C) and stability respecting branching bisimulation (BB s ). These requirements would reduce the number of suitable preorders to 18. It is in general a good strategy to do your verifications using the finest preorde...
Comparative branchingtime semantics for Markov chains
 Information and Computation
, 2003
"... This paper presents various semantics in the branchingtime spectrum of discretetime and continuoustime Markov chains (DTMCs and CTMCs). Strong and weak bisimulation equivalence and simulation preorders are covered and are logically characterised in terms of the temporal logics PCTL (Probabilisti ..."
Abstract

Cited by 39 (15 self)
 Add to MetaCart
(Show Context)
This paper presents various semantics in the branchingtime spectrum of discretetime and continuoustime Markov chains (DTMCs and CTMCs). Strong and weak bisimulation equivalence and simulation preorders are covered and are logically characterised in terms of the temporal logics PCTL (Probabilistic Computation Tree Logic) and CSL (Continuous Stochastic Logic). Apart from presenting various existing branchingtime relations in a uniform manner, this paper presents the following new results: (i) strong simulation for CTMCs, (ii) weak simulation for CTMCs and DTMCs, (iii) logical characterizations thereof (including weak bisimulation for DTMCs), (iv) a relation between weak bisimulation and weak simulation equivalence, and (v) various connections between equivalences and preorders in the continuous and discretetime setting. The results are summarized in a branchingtime spectrum for DTMCs and CTMCs elucidating their semantics as well as their relationship. Key Words: comparative semantics, Markov chain, (weak) simulation, (weak) bisimulation, temporal logic
Back and forth bisimulations
 Computer Science Report CS R9021, Centrum voor Wiskunde en Informatica
, 1990
"... This paper is concerned with bisimulation relations which do not only require related agents to simulate each others behavior in the direction of the arrows, but also to simulate each other when going back in history. First it is demonstrated that the back and forth variant of strong bisimulation le ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
(Show Context)
This paper is concerned with bisimulation relations which do not only require related agents to simulate each others behavior in the direction of the arrows, but also to simulate each other when going back in history. First it is demonstrated that the back and forth variant of strong bisimulation leads to the same equivalence as the ordinary notion of strong bisimulation. Then it is shown that the back and forth variant of Milner's observation equivalence is different from (and finer than) observation equivalence. In fact we prove that it coincides with the branching bisimulation equivalence of Van Glabbeek & Weijland. Also the back and forth variants of branching, ~ and delay bisimulation lead to branching bisimulation equivalence. The notion of back and forth bisimulation moreover leads to characterizations of branching bisimulation in terms of abstraction homomorphisms and in terms of HencessyMilner logic with backward modalities. In our view these results support the claim that branching bisimulation is a natural and important notion. The notion of bisimulation relation has been introduced by PARK [18]. It leads to an equivalence on labelled transition systems which, in case image finiteness is assumed, coincides with the strong equivalence of ~IILNER [12]. The great importance and usefulness of bisimulalions
Translations between Modal Logics of Reactive Systems
, 1994
"... We propose meaningpreserving translations between LB, LU and Lsb (three modal logics in full agreement with branching bisimulation), thus proving that they all have the same expressivity. The translations can be implemented and have potential applications in the automated analysis of reactive syste ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We propose meaningpreserving translations between LB, LU and Lsb (three modal logics in full agreement with branching bisimulation), thus proving that they all have the same expressivity. The translations can be implemented and have potential applications in the automated analysis of reactive systems. In this work the main difficulty is that LB uses both forward and backward modalities, whereas LU and Lsb only have forward modalities. The technique we developed to cope with this, is an adaptation in a branchingtime framework of the methods underlying Gabbay's Separation Theorem for P T L [8]. This technique is powerful and has been applied successfully to related problems.
Logical Characterizations of Truly Concurrent Bisimulation
, 1994
"... We present two modal logics, interpreted over prime event structures without silent moves, that characterize historypreserving bisimulation. That is, two event structures satisfy the same formulae iff they are historypreserving bisimilar. These logics use pasttense modalities and pomsets observat ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present two modal logics, interpreted over prime event structures without silent moves, that characterize historypreserving bisimulation. That is, two event structures satisfy the same formulae iff they are historypreserving bisimilar. These logics use pasttense modalities and pomsets observations. Though quite different in form and spirit, the two logics turn out to have the same expressive power, in the sense that there exists a twoway translation between them. Keywords: Semantics of concurrency, modal logics for true concurrency, expressivity of modal logics. Introduction During the past decade, partial order semantics have been studied in depth as a promising approach to the semantic aspects of reactive systems [Gra81, GR83, Pra86]. In particular, causalitybased models enable one to formalize interesting features of systems' behaviors for which concurrency is no longer identified with sequential nondeterminism as it is in interleaving models. As it has been pointed out [...
Methods for the transformation and analysis of CRL
, 1990
"... ma \Gamma @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma Specification and Programming Environment for Communication Software SPECS RACE Ref: 1046 Title: Methods for the transformation and ..."
Abstract
 Add to MetaCart
ma \Gamma @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma Specification and Programming Environment for Communication Software SPECS RACE Ref: 1046 Title: Methods for the transformation and analysis of CRL Author: WP5 Editor: LDM Type: External Deliverable SPECS Identifier: D5.7 Document Version: 0 Date: Nov 16, 1990 Status: Draft Confidentiality: WP5 Internal Copyright c fl by the SPECS consortium. The SPECS consortium consists of the following companies: GSITECSI, CNET, STETCSELT, PTTRNL, IBM France, NIHE, TFL, INESC, GPT, PKI, EB, BELL, CIT, ELIN, LdM, SESA. SPECS D5.7 Version 0 Chapter 1 Analysis of CRL V2.1 1.1 / 1.1.1 Contents The idea is
Translation Results for Modal Logics of Reactive Systems
, 1993
"... this paper we give three nontrivial translation theorems of the generic form L L ..."
Abstract
 Add to MetaCart
(Show Context)
this paper we give three nontrivial translation theorems of the generic form L L
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,
Takehome Tentamen Protocolverificatie
"... dan garanderen dat er precies 'e'en token wordt gecreeerd. Bij het ontwerp van het algoritme zijn de volgende aannames gemaakt: 1 ffl Er zijn n processen, A 0 ; : : : ; A n\Gamma1 . Deze processen zijn allemaal identiek, alleen heeft ieder process A i bij aanvang van het algoritme een ..."
Abstract
 Add to MetaCart
dan garanderen dat er precies 'e'en token wordt gecreeerd. Bij het ontwerp van het algoritme zijn de volgende aannames gemaakt: 1 ffl Er zijn n processen, A 0 ; : : : ; A n\Gamma1 . Deze processen zijn allemaal identiek, alleen heeft ieder process A i bij aanvang van het algoritme een unieke waarde id i , afkomstig uit een oneindige, totaal geordende verzameling D. ffl De individuele processen weten niet hoeveel andere processen er zich in de ring bevinden. ffl Processen kunnen communiceren met hun buren in de ring door het versturen van boodschappen. Communicatie tussen processen is asynchroon, d.w.z. verloopt via een FIFO kanaal, en vindt uitsluitend plaats in 'e'en richting (zeg met de klok mee). In het algoritme is ieder proces hetzij actief, hetzij in doorgeeftoestand
A modal logic for µCRL
, 1994
"... The language µCRL allows to specify processes with data and to reason with them in an algebraic vein. This allows to express and reason about global correctness of systems. Sometimes, one only needs to analyse particular properties of µCRLprocesses. Modal logics are very convenient to express and v ..."
Abstract
 Add to MetaCart
The language µCRL allows to specify processes with data and to reason with them in an algebraic vein. This allows to express and reason about global correctness of systems. Sometimes, one only needs to analyse particular properties of µCRLprocesses. Modal logics are very convenient to express and verify such properties. Therefore, we define a modal logic for µCRL. It is a branching time modal logic based on actions. It has future and past operators and it allows for reasoning about data, for instance using rst order quantification over data variables. It is shown that these modal formulae cannot distinguish between divergence sensitive branching bisimilar processes.