Results 51 to 60 of about 13,172 (205)
The Extension of Bisimulation Quantified Modal Logic Based on Covariant-Contravariant Refinement
IEEE Access, 2019 The notion of covariant-contravariant refinement (CC-refinement, for short) is a generalization of the notions of bisimulation and refinement. This paper interprets semantically a CC-refinement as bisimulation plus model restriction, that is, a CC ...
Huili Xing
doaj +1 more source
Symbolic semantics and bisimulation for full LOTOS [PDF]
, 2000 No abstract ...
Calder, M., Shankland, C.
core +5 more sources
Bisimulation for Secure Information Flow Analysis of Multi-Threaded Programs
Mathematical and Computational Applications, 2019 Preserving the confidentiality of information is a growing concern in software development. Secure information flow is intended to maintain the confidentiality of sensitive information by preventing them from flowing to attackers.
Ali A. Noroozi +2 more
doaj +1 more source
Sigref – A Symbolic Bisimulation Tool Box [PDF]
, 2006 We present a uniform signature-based approach to compute the most popular bisimulations. Our approach is implemented symbolically using BDDs, which enables the handling of very large transition systems.
A. Bouajjani +30 more
core +3 more sources
Theoretical Computer Science, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matthew Hennessy, Huimin Lin
openaire +1 more source
Conflict vs causality in event structures [PDF]
, 2019 Event structures are one of the best known models for concurrency. Many variants of the basic model and many possible notions of equivalence for them have been devised in the literature.
Gorla, Daniele +2 more
core +2 more sources
[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science, 1990 The purpose of this paper is to investigate how bisimulation equivalence may be refined to give preorders which provide divergence-respecting approximation orderings between processes whose associated theories are as close as possible to that of bisimulation equivalence. The work is based on ideas first introduced in \textit{M. Hennessy} and \textit{G.
openaire +1 more source
The Largest Respectful Function [PDF]
Logical Methods in Computer Science, 2016 Respectful functions were introduced by Sangiorgi as a compositional tool to formulate short and clear bisimulation proofs. Usually, the larger the respectful function, the easier the bisimulation proof.
Joachim Parrow, Tjark Weber
doaj +1 more source
Querying the Guarded Fragment [PDF]
, 2014 Evaluating a Boolean conjunctive query Q against a guarded first-order theory F is equivalent to checking whether "F and not Q" is unsatisfiable. This problem is relevant to the areas of database theory and description logic.
Bárány, Vince +2 more
core +2 more sources
On bisimulations for description logics [PDF]
Information Sciences, 2015 42 ...
Ali Rezaei Divroodi, Linh Anh Nguyen
openaire +2 more sources