Results 11  20
of
786,992
Bisimulation quantified logics: undecidability
 In Proceedings of FSTTCS ’05, volume 3821 of LNCS
, 2005
"... Abstract. In this paper we introduce a general semantic interpretation for propositional quantification in all multimodal logics based on bisimulations (bisimulation quantification). Bisimulation quantification has previously been considered in the context of isolated modal logics, such as PDL (D’A ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
with bisimulation quantifiers. This is part of a program of study to characterize the expressivity and decidability of bisimulation quantified modal logics. 1
Equivalence of Dynamical Systems by Bisimulation
, 2004
"... A general notion of bisimulation is defined for linear inputstateoutput systems, using analogies with the theory of concurrent processes. A characterization of bisimulation and an algorithm for computing the maximal bisimulation relation is derived using geometric control theory. Bisimulation is s ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
A general notion of bisimulation is defined for linear inputstateoutput systems, using analogies with the theory of concurrent processes. A characterization of bisimulation and an algorithm for computing the maximal bisimulation relation is derived using geometric control theory. Bisimulation
Network Centric Warfare: Developing and Leveraging Information Superiority
 Command and Control Research Program (CCRP), US DoD
, 2000
"... the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technolo ..."
Abstract

Cited by 308 (5 self)
 Add to MetaCart
technologies. The CCRP pursues a broad program of research and analysis in information superiority, information operations, command and control theory, and associated operational concepts that enable us to leverage shared awareness to improve the effectiveness and efficiency of assigned missions. An important
Amortised bisimulations
 In Proceedings of FORTE 2005, number 3731 in Lecture Notes in Computer Science
, 2005
"... Abstract. We introduce a quantitative concept for bisimulations by integrating the notion of amortisation (cf. [3]). This allows us to make behavioural comparisons between nondeterministic systems that are inherently nonterminating and to analyse the relative longterm costs of deploying them. To t ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
Abstract. We introduce a quantitative concept for bisimulations by integrating the notion of amortisation (cf. [3]). This allows us to make behavioural comparisons between nondeterministic systems that are inherently nonterminating and to analyse the relative longterm costs of deploying them
On the Reduction of Chocs Bisimulation to πcalculus Bisimulation
, 1995
"... Chocs and πcalculus are two extensions of CCS where, respectively, processes and channels are transmissible values. In previous work we have proposed a formalization of the notion of bisimulation for Chocs. In this paper we suggest a more effective way to reason about this notion by means of an emb ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Chocs and πcalculus are two extensions of CCS where, respectively, processes and channels are transmissible values. In previous work we have proposed a formalization of the notion of bisimulation for Chocs. In this paper we suggest a more effective way to reason about this notion by means
On the Origins of Bisimulation and
"... Bisimulation and bisimilarity are coinductive notions, and as such are intimately related to fixed points, in particular greatest fixed points. Therefore also the appearance of coinduction and fixed points is discussed, though in this case only within Computer Science. The paper ends with some histo ..."
Abstract
 Add to MetaCart
Bisimulation and bisimilarity are coinductive notions, and as such are intimately related to fixed points, in particular greatest fixed points. Therefore also the appearance of coinduction and fixed points is discussed, though in this case only within Computer Science. The paper ends with some
Logical Bisimulations and Functional Languages ⋆
"... Abstract. Developing a theory of bisimulation in higherorder languages can be hard. Particularly challenging can be the proof of congruence and, related to this, enhancements of the bisimulation proof method with “upto context ” techniques. We present logical bisimulations, a form of bisimulation ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Developing a theory of bisimulation in higherorder languages can be hard. Particularly challenging can be the proof of congruence and, related to this, enhancements of the bisimulation proof method with “upto context ” techniques. We present logical bisimulations, a form of bisimulation
Interpolation and Bisimulation in Temporal Logic
 In Proceedings of WoLLIC'98. Workshop of Logic, Language, Information and Computation
, 1998
"... Building on recent model theoretic results for SinceUntil logics we define an adequate notion of bisimulation and establish general theorems concerning the interpolation property. Using these general results we prove that the basic SUlogic and any SUlogic whose class of frames can be defined ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Building on recent model theoretic results for SinceUntil logics we define an adequate notion of bisimulation and establish general theorems concerning the interpolation property. Using these general results we prove that the basic SUlogic and any SUlogic whose class of frames can be defined
On the Bisimulation Proof Method
 JOURNAL OF MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE
, 1994
"... The most popular method for establishing bisimilarities among processes is to exhibit bisimulation relations. By definition, R is a bisimulation relation if R progresses to R itself, i.e., pairs of processes in R can match each other's actions and their derivatives are again in R. We study gen ..."
Abstract

Cited by 103 (6 self)
 Add to MetaCart
The most popular method for establishing bisimilarities among processes is to exhibit bisimulation relations. By definition, R is a bisimulation relation if R progresses to R itself, i.e., pairs of processes in R can match each other's actions and their derivatives are again in R. We study
Results 11  20
of
786,992