Results 41 to 50 of about 13,172 (205)
Proving Continuity of Coinductive Global Bisimulation Distances: A Never Ending Story [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 We have developed a notion of global bisimulation distance between processes which goes somehow beyond the notions of bisimulation distance already existing in the literature, mainly based on bisimulation games.
David Romero-Hernández +2 more
doaj +1 more source
Neighbourhood Semantics for Graded Modal Logic
Bulletin of the Section of Logic, 2021 We introduce a class of neighbourhood frames for graded modal logic embedding Kripke frames into neighbourhood frames. This class of neighbourhood frames is shown to be first-order definable but not modally definable.
Jinsheng Chen +3 more
doaj +1 more source
Bisimulation for quantum processes [PDF]
, 2011 In this paper we introduce a novel notion of probabilistic bisimulation for quantum processes and prove that it is congruent with respect to various process algebra combinators including parallel composition even when both classical and quantum ...
Duan, Runyao +2 more
core +2 more sources
Journal of Advanced Transportation, Volume 2020, Issue 1, 2020., 2020 CADS (cooperative autonomous driving systems) are software‐intensive and safety‐critical reactive systems and give great promise to our daily life, but system errors may not be identified in the design stage until the implement stage, and the cost to correct them will be more expensive later than the early stage.
Jinyong Wang +5 more
wiley +1 more source
Open Bisimulation for Aspects [PDF]
Proceedings of the 6th international conference on Aspect-oriented software development, 2007 We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive reasoning principles aimed at proving equality of aspect programs. The language we study is very small, yet powerful enough to encode mutable references and a range of ...
Radha Jagadeesan +2 more
openaire +1 more source
Games for Bisimulations and Abstraction [PDF]
Logical Methods in Computer Science, 2017 Weak bisimulations are typically used in process algebras where silent steps are used to abstract from internal behaviours. They facilitate relating implementations to specifications. When an implementation fails to conform to its specification, pinpointing the root cause can be challenging.
David de Frutos-Escrig +2 more
openaire +6 more sources
, 2011 Beahvioral equivalences serve to establish in which cases two reactive (possible concurrent) systems offer similar interaction capabilities relatively to other systems representing their operating environment.
De Nicola, Rocco
core +1 more source
An Algebra of Quantum Processes [PDF]
, 2009 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.
Duan, Runyao +3 more
core +2 more sources
Modal Logics for Nominal Transition Systems [PDF]
Logical Methods in Computer Science, 2021 We define a general notion of transition system where states and action labels can be from arbitrary nominal sets, actions may bind names, and state predicates from an arbitrary logic define properties of states. A Hennessy-Milner logic for these systems
Joachim Parrow +4 more
doaj +1 more source
Bisimulation can't be traced [PDF]
Journal of the ACM, 1988 In the concurrent language CCS, two programs are considered the same if they are bisimilar . Several years and many researchers have demonstrated that the theory of bisimulation is mathematically appealing and useful in practice. However, bisimulation makes too many distinctions between programs.
Bard Bloom +2 more
openaire +2 more sources