Results 91 to 100 of about 13,172 (205)
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
Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus [PDF]
Logical Methods in Computer Science, 2012 Inspired by a recent graphical formalism for lambda-calculus based on linear logic technology, we introduce an untyped structural lambda-calculus, called lambda j, which combines actions at a distance with exponential rules decomposing the substitution ...
Beniamino Accattoli, Delia Kesner
doaj +1 more source
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
AbstractWe introduce a data-driven approach to computing finite bisimulations for state transition systems with very large, possibly infinite state space. Our novel technique computes stutter-insensitive bisimulations of deterministic systems, which we characterize as the problem of learning a state classifier together with a ranking function for each ...
Alessandro Abate +2 more
openaire +3 more sources
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 +2 more sources
A framework for proof certificates in finite state exploration [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Model checkers use automated state exploration in order to prove various properties such as reachability, non-reachability, and bisimulation over state transition systems.
Quentin Heath, Dale Miller
doaj +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
Coalgebraic Weak Bisimulation for Action-Type Systems [PDF]
Scientific Annals of Computer Science, 2009 We propose a coalgebraic definition of weak bisimulation for classes of coalgebras obtained from bifunctors in the category Set. Weak bisimilarity for a system is obtained as strong bisimilarity of a transformed system.
A. Sokolova, E. de Vink, H. Woracek
doaj
Pattern Matching and Bisimulation [PDF]
, 2013 Concurrent Pattern Calculus (CPC) is a minimal calculus whose communication mechanism is based on a powerful form of symmetric pattern unification. However, the richness of patterns and their unification entails some flexibility in the challenge-reply game that underpins bisimulation.
Thomas Given-Wilson, Daniele Gorla
openaire +2 more sources
A Characterization of Finitary Bisimulation
BRICS Report Series, 1997 Following a paradigm put forward by Milner and Plotkin, a primary criterion to judge the appropriateness of denotational models for programming and specification languages is that they be in agreement with operational intuition about program behaviour.
Aceto, Luca, Ingolfsdottir, Anna
openaire +4 more sources