Results 81 to 90 of about 6,025 (211)
Origins of Bisimulation and Coinduction
, 2011 International audienceThe origins of bisimulation and bisimilarity are examined, in the three fields where they have been independently discovered: Computer Science, Philosophical Logic (precisely, Modal Logic), Set Theory.
Sangiorgi, Davide, Davide Sangiorgi
core +1 more source
Compositionality of Approximate Bisimulation for Probabilistic Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Probabilistic transition system specifications using the rule format ntmuft-ntmuxt provide structural operational semantics for Segala-type systems and guarantee that probabilistic bisimilarity is a congruence.
Daniel Gebler, Simone Tini
doaj +1 more source
Logical Characterization of Bisimulation Metrics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 Bisimulation metrics provide a robust and accurate approach to study the behavior of nondeterministic probabilistic processes. In this paper, we propose a logical characterization of bisimulation metrics based on a simple probabilistic variant of the ...
Valentina Castiglioni +2 more
doaj +1 more source
Bisimulations and Reversibility
Concurrency and causality can be expressed within a labelled transition system by exploiting reversibility of transitions. It is natural to ask what behavioural equivalences can be captured by bisimulations in the reversible setting. In this paper we work with keyed configuration structures and CCS K, establish an operational correspondence between the
Clément Aubert +2 more
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 +5 more sources
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
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
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
New Bisimulation Semantics for Distributed Systems [PDF]
, 2007 Bisimulation semantics are a very pleasant way to define the semantics of systems, mainly because the simplicity of their definitions and their nice coalgebraic properties.
Carlos Gregorio-Rodríguez +5 more
core +1 more source
BRICS Report Series, 1994 Several categorical relationships (adjunctions) between models for concurrency<br /> have been established, allowing the translation of concepts and<br />properties from one model to another. A central example is a coreflection<br />between Petri nets and asynchronous transition systems.
Nielsen, Mogens, Winskel, Glynn
openaire +5 more sources