Results 71 to 80 of about 6,025 (211)
Isomorphism Theorems for Coalgebras
Annales Mathematicae Silesianae, 2019 Let F be an endofunctor of a category C. We prove isomorphism theorems for F -coalgebras under condition that the underlying category C is exact; that is, regular with exact sequences. Also, F is not assumed to preserve pullbacks.
Mavoungou Jean-Paul
doaj +1 more source
Rooted branching bisimulation as a congruence for probabilistic transition systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 We propose a probabilistic transition system specification format, referred to as probabilistic RBB safe, for which rooted branching bisimulation is a congruence. The congruence theorem is based on the approach of Fokkink for the qualitative case.
Matias D. Lee, Erik P. de Vink
doaj +1 more source
Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge [PDF]
Logical Methods in Computer Science, 2005 This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a finite equational axiomatization over the process algebra obtained by adding an auxiliary operation proposed by Hennessy in 1981 to the recursion ...
Luca Aceto +3 more
doaj +1 more source
Theoretical Computer Science, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Briais, Sébastien, Nestmann, Uwe
openaire +2 more sources
Bisimulation of Dynamical Systems [PDF]
, 2004 A general notion of bisimulation is studied for dynamical systems. An algebraic characterization of bisimulation together with an algorithm for computing the maximal bisimulation relation is derived using geometric control theory.
Schaft, Arjan van der; id_orcid
core +8 more sources
On the Approximation of the Resource Equivalences in Petri Nets with the Invisible Transitions
Моделирование и анализ информационных систем, 2020 Two resources (submarkings) are called similar if in any marking any one of them can be replaced by another one without affecting the observable behavior of the net (regarding marking bisimulation). It is known that resource similarity is undecidable for
Vladimir A. Bashkin
doaj +1 more source
Algebra, coalgebra, and minimization in polynomial differential equations [PDF]
Logical Methods in Computer Science, 2019 We consider reasoning and minimization in systems of polynomial ordinary differential equations (ode's). The ring of multivariate polynomials is employed as a syntax for denoting system behaviours.
Michele Boreale
doaj +1 more source
Bisimulations in the Join-Calculus [PDF]
, 1998 We develop a theory of bisimulation in the join-calculus. We introduce a refined operational model that makes interactions with the environment explicit, and we discuss the impact of the lexical discipline of the join-calculus on its extensional semantics.
BOREALE, MICHELE, C. Fournet, C. Laneve
openaire +3 more sources
Bisimulation Quotient in Inquisitive Modal Logic
LogicsInquisitive modal logic InqML⊞ is a natural generalization of basic modal logic, with ⊞ as a primitive modal operator. In this paper, we study the bisimulation quotients in the logic InqML⊞.
Stipe Marić
doaj +1 more source
Bisimulation for quantum processes [PDF]
ACM SIGPLAN Notices, 2011 Quantum cryptographic systems have been commercially available, with a striking advantage over classical systems that their security and ability to detect the presence of eavesdropping are provable based on the principles of quantum mechanics. On the other hand, quantum protocol designers may commit much more faults than classical protocol designers ...
Yuan Feng 0001 +2 more
openaire +4 more sources