Results 121 to 130 of about 13,172 (205)
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 Categorical Axiomatics for Bisimulation
BRICS Report Series, 1998 We give an axiomatic category theoretic account of bisimulation in process algebras based on the idea of functional bisimulations as open maps. We work with 2-monads, T, on Cat. Operations on processes, such as nondeterministic sum, prexing and parallel composition are modelled using functors in the Kleisli category for the 2-monad T. We may define the
Gian Luca Cattani +2 more
openaire +2 more sources
International Journal of Advanced Robotic SystemsThis work introduces Deep Policy Similarities (DeePS), a learning-based bisimulation approach designed to enhance generalization in reinforcement learning for robotic control.
Ming Chong Lim, Han-Lim Choi
doaj +1 more source
Formal methods: practical applications and foundations: Editorial. [PDF]
Form Methods Syst Des, 2021 Ter Beek MH, McIver A.
europepmc +1 more source
Bisimulation for component-based development
Journal of Computer Science and Technology, 2002 Guaranteeing that assembled components will behave as required is one of the main aspects in working with Component-Based Development. In this paper we present a formal approach for tackling this problem by applying the concept of bisimulation ...
Elsa Clara Estévez +1 more
doaj
Approximating Bisimulation in One-counter Nets
Моделирование и анализ информационных систем, 2011 One-counter nets are finite-state machines operating on a variable (counter) which ranges over the natural numbers. Every transition can increase or decrease the value of the counter (the decrease is possible only if the result is non-negative, hence ...
V. A. Bashkin
doaj
Theoretical Computer Science, 2005 Some properties of quasi-open bisimilarity as well as other bisimulations (for \(\pi\)-calculus), such as open bisimulation, open barbed bisimulation, \(q\)-open bisimulation, local open bisimulation, are discussed. A complete axiomatization of weak quasi-open congruence is given.
openaire +2 more sources
Bounded Model Checking for Metric Temporal Logic Properties of Timed Automata with Digital Clocks. [PDF]
Sensors (Basel), 2022 Zbrzezny AM, Zbrzezny A.
europepmc +1 more source
What Can Deep Neural Networks Teach Us About Embodied Bounded Rationality. [PDF]
Front Psychol, 2022 Lee EA.
europepmc +1 more source
On bisimulation in absence of restriction
RAIRO - Theoretical Informatics and ApplicationsWe revisit the standard bisimulation equalities in process models free of the restriction operator. As is well-known, in general the weak bisimilarity is coarser than the strong bisimilarity because it abstracts from internal actions.
openaire +2 more sources