Results 181 to 190 of about 6,025 (211)
The Semantic Units Framework, a technology-agnostic representational approach to FAIR and CLEAR knowledge infrastructures. [PDF]
Sci DataVogt L.
europepmc +1 more source
A model for correlation-based choreographic programming. [PDF]
PeerJ Comput SciGiallorenzo S, Montesi F, Gabbrielli M.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of Logic and Computation, 2008
Building on the fact that descriptive frames are coalgebras for the Vietoris functor on the category of Stone spaces, we introduce and study the concept of a Vietoris bisimulation between two descriptive modal models, together with the associated notion of bisimilarity.
Nick Bezhanishvili +2 more
openaire +2 more sources
Building on the fact that descriptive frames are coalgebras for the Vietoris functor on the category of Stone spaces, we introduce and study the concept of a Vietoris bisimulation between two descriptive modal models, together with the associated notion of bisimilarity.
Nick Bezhanishvili +2 more
openaire +2 more sources
ACM SIGLOG News, 2011
This is a very personal review of the definition of probabilistic bisimulation on continuous state spaces and the logical characterization theorem. I only consider fully probabilistic reactive systems.
openaire +2 more sources
This is a very personal review of the definition of probabilistic bisimulation on continuous state spaces and the logical characterization theorem. I only consider fully probabilistic reactive systems.
openaire +2 more sources
1998
Bisimulation is a rich concept which appears in various areas of theoretical computer science. Its origin lie in concurrency theory and in modal logic. In this paper we review results about bisimulation, from bothh the point of view of automata and from a logical point of view. We also consider how bisimulation has a role in finite model theory, and we
openaire +2 more sources
Bisimulation is a rich concept which appears in various areas of theoretical computer science. Its origin lie in concurrency theory and in modal logic. In this paper we review results about bisimulation, from bothh the point of view of automata and from a logical point of view. We also consider how bisimulation has a role in finite model theory, and we
openaire +2 more sources
Probabilistic bisimulation as a congruence
ACM Transactions on Computational Logic, 2009We propose both an SOS transition rule format for the generative model of probabilistic processes, and an SOS transition rule format for the reactive model of the probabilistic processes. Our rule formats guarantee that probabilistic bisimulation is a congruence with respect to process algebra operations.
LANOTTE, RUGGERO, TINI, SIMONE
openaire +2 more sources
Reduction and Analysis of Boolean Control Networks by Bisimulation
SIAM Journal on Control and Optimization, 2021Rui Li, Tianguang Chu
exaly