Results 91 to 100 of about 6,025 (211)
Bisimulation for Neighbourhood Structures [PDF]
, 2007 Neighbourhood structures are the standard semantic tool used to reason about non-normal modal logics. In coalgebraic terms, a neighbourhood frame is a coalgebra for the contravariant powerset functor composed with itself, denoted by 22. In our paper, we investigate the coalgebraic equivalence notions of 22-bisimulation, behavioural equivalence and ...
H.H. Hansen (Helle) +2 more
openaire +8 more sources
Weak bisimulation for coalgebras over order enriched monads [PDF]
Logical Methods in Computer Science, 2015 The paper introduces the notion of a weak bisimulation for coalgebras whose type is a monad satisfying some extra properties. In the first part of the paper we argue that systems with silent moves should be modelled coalgebraically as coalgebras whose ...
Tomasz Brengos
doaj +1 more source
Enhancements of the bisimulation proof method
, 2011 International audienceCoinduction is a method for specifying and reasoning about infinite data types and automata with infinite behaviour. In recent years, it has come to play an ever more important role in the theory of computing.
Sangiorgi, Davide +3 more
core +1 more source
Environmental Bisimulations for Delimited-Control Operators with Dynamic Prompt Generation [PDF]
Logical Methods in Computer Science, 2017 We present sound and complete environmental bisimilarities for a variant of Dybvig et al.'s calculus of multi-prompted delimited-control operators with dynamic prompt generation. The reasoning principles that we obtain generalize and advance the existing
Andrés Aristizábal +3 more
doaj +1 more source
Characterizing Behavioural Congruences for Petri Nets
, 1995 We exploit a notion of interface for Petri nets in order to design a set of net combinators. For such a calculus of nets, we focus on the behavioural congruences arising from four simple notions of behaviour, viz., traces, maximal traces, step, and ...
Priese, L., Nielsen, M., Sassone, V.
core +2 more sources
Universal axioms for bisimulations
Theoretical Computer Science, 1993 Observation structures as a basic model of concurrent distributed systems are introduced. They are graphs with nodes labelled by observations. In the special case of observation trees their nodes represent computations of systems and the label of a node is an encoding of the observation of the corresponding computation performed from the beginning of ...
DEGANO, PIERPAOLO +2 more
openaire +3 more sources
Positive Hennessy-Milner Logic for Branching Bisimulation [PDF]
Logical Methods in Computer ScienceLabelled transitions systems can be studied in terms of modal logic and in terms of bisimulation. These two notions are connected by Hennessy-Milner theorems, that show that two states are bisimilar precisely when they satisfy the same modal logic ...
Herman Geuvers, Komi Golov
doaj +1 more source
On the reduction of chocs bisimulation to π-calculus bisimulation
, 1993 Chocs and p-calculus are two extensions of CCS where, respectively processes and channels are transmissible values. In previous work we have proposed a formalization of the notion of bisimulation for Chocs. In this paper we suggest a more effective way to reason about this notion by means of a translation of Chocs into a variant of the p ...
openaire +3 more sources
Tree Morphisms and Bisimulations
Electronic Notes in Theoretical Computer Science, 1998 AbstractA category of (action labelled) trees is defined that can be used to model unfolding of labelled transition systems and to study behavioural relations over them. In this paper we study five different equivalences based on bisimulation for our model. One, that we called resource bisimulation, amounts essentially to three isomorphism.
R. DE NICOLA, LABELLA, Anna
openaire +4 more sources
Playing with Bisimulation in Erlang [PDF]
, 2019 Erlang is a functional and concurrent programming language. The aim of this paper is to investigate basic properties of the Erlang concurrency model, which is based on asynchronous communication through mailboxes accessed via pattern matching. To achieve this goal, we consider Core Erlang (which is an intermediate step in Erlang compilation) and we ...
Lanese, Ivan +2 more
openaire +4 more sources