Results 51 to 60 of about 6,025 (211)
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 +3 more sources
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
, 2011 What is a basic automata-theoretic model of computation with names and fresh-name generation? We introduce Fresh-Register Automata (FRA), a new class of automata which operate on an infinite alphabet of names and use a finite number of registers to store
Tzevelekos, N, Nikos Tzevelekos
core +1 more source
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
Bisimulations and bisimulation games between Verbrugge models
Mathematical Logic Quarterly, 2023 AbstractInterpretability logic is a modal formalization of relative interpretability between first‐order arithmetical theories. Verbrugge semantics is a generalization of Veltman semantics, the basic semantics for interpretability logic. Bisimulation is the basic equivalence between models for modal logic.
Vuković, Mladen +2 more
openaire +4 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 +2 more sources
Improving Probabilistic Bisimulation for MDPs Using Machine Learning [PDF]
Mathematics Interdisciplinary ResearchThe utilization of model checking has been suggested as a formal verification technique for analyzing critical systems. However, the primary challenge in applying to complex systems is the state space explosion problem.
Mohammadsadegh Mohagheghi +1 more
doaj +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
Approximate reasoning for real-time probabilistic processes [PDF]
Logical Methods in Computer Science, 2006 We develop a pseudo-metric analogue of bisimulation for generalized semi-Markov processes. The kernel of this pseudo-metric corresponds to bisimulation; thus we have extended bisimulation for continuous-time probabilistic processes to a much broader ...
Vineet Gupta +2 more
doaj +1 more source
CAAI Transactions on Intelligence Technology, Volume 11, Issue 2, Page 332-348, April 2026.ABSTRACT Intrinsic motivation serves as the predominant paradigm of exploration in reinforcement learning. In pursuit of an informative and robust state representation, the behavioural metric groups behaviourally equivalent states together, which share the same single‐step reward and transition distribution.
Anjie Zhu +3 more
wiley +1 more source