Results 1 to 10 of about 326 (167)
Relating Apartness and Bisimulation [PDF]
Logical Methods in Computer Science, 2021 A bisimulation for a coalgebra of a functor on the category of sets can be described via a coalgebra in the category of relations, of a lifted functor. A final coalgebra then gives rise to the coinduction principle, which states that two bisimilar elements are equal. For polynomial functors, this leads to well-known descriptions.
Geuvers, J.H., Jacobs, Bart
openaire +8 more sources
INQUISITIVE BISIMULATION [PDF]
The Journal of Symbolic Logic, 2020 AbstractInquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are interested in. Technically, InqML fits within the family of logics based on team semantics.
Ciardelli I, Otto M
openaire +3 more sources
SOS rule formats for convex and abstract probabilistic bisimulations [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Probabilistic transition system specifications (PTSSs) in the ntμfθ/ntμxθ format provide structural operational semantics for Segala-type systems that exhibit both probabilistic and nondeterministic behavior and guarantee that bisimilarity is a ...
Pedro R. D'Argenio +2 more
doaj +1 more source
On Context Bisimulation for Parameterized Higher-order Processes [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 This paper studies context bisimulation for higher-order processes, in the presence of parameterization (viz. abstraction). We show that the extension of higher-order processes with process parameterization retains the characterization of context ...
Xian Xu
doaj +1 more source
Linearity and Bisimulation [PDF]
The Journal of Logic and Algebraic Programming, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nobuko Yoshida +2 more
openaire +1 more source
Coherent branching feature bisimulation [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Progress in the behavioral analysis of software product lines at the family level benefits from further development of the underlying semantical theory. Here, we propose a behavioral equivalence for feature transition systems (FTS) generalizing branching
Tessa Belder +2 more
doaj +1 more source
Scalable Minimization Algorithm for Partial Bisimulation [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We present an efficient algorithm for computing the partial bisimulation preorder and equivalence for labeled transitions systems. The partial bisimulation preorder lies between simulation and bisimulation, as only a part of the set of actions is ...
J. Markovski
doaj +1 more source
Reverse Bisimulations on Stable Configuration Structures [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 The relationships between various equivalences on configuration structures, including interleaving bisimulation (IB), step bisimulation (SB) and hereditary history-preserving (HH) bisimulation, have been investigated by van Glabbeek and Goltz (and later ...
Iain Phillips, Irek Ulidowski
doaj +1 more source
Bisimulations for delayed switched Boolean control networks and its application in controllability
IET Control Theory & Applications, 2023 This paper investigates bisimulation relations of delayed switched Boolean control networks (DSBCNs), using the semi‐tensor product (STP) approach. Firstly, the notion of bisimulation in DSBCNs is formalized. Subsequently, based on the skeleton matrix of
Weiyong Yu +3 more
doaj +1 more source
A Definition Scheme for Quantitative Bisimulation [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 FuTS, state-to-function transition systems are generalizations of labeled transition systems and of familiar notions of quantitative semantical models as continuous-time Markov chains, interactive Markov chains, and Markov automata.
Diego Latella +2 more
doaj +1 more source