Results 101 to 110 of about 13,172 (205)
CCS Dynamic Bisimulation is Progressing
, 1991 Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still woc, e.g.\ $\alpha.\tau.\beta.nil$ and $\alpha.\beta.nil$ are woc but $\tau ...
Montanari, U., Sassone, V.
core +3 more sources
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 +4 more sources
Bisimulations and Logical Characterizations on Continuous-time Markov Decision Processes
, 2013 In this paper we study strong and weak bisimulation equivalences for continuous-time Markov decision processes (CTMDPs) and the logical characterizations of these relations with respect to the continuous-time stochastic logic (CSL).
Godskesen, Jens Chr. +2 more
core +3 more sources
Generalized Vietoris Bisimulations
, 2014 We introduce and study bisimulations for coalgebras on Stone spaces [14]. Our notion of bisimulation is sound and complete for behavioural equivalence, and generalizes Vietoris bisimulations [4].
Enqvist, Sebastian, Sourabh, Sumit
core +1 more source
A Strong Bisimulation for a Classical Term Calculus [PDF]
Logical Methods in Computer ScienceWhen translating a term calculus into a graphical formalism many inessential details are abstracted away. In the case of $\lambda$-calculus translated to proof-nets, these inessential details are captured by a notion of equivalence on $\lambda$-terms ...
Eduardo Bonelli +2 more
doaj +1 more source
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 +3 more sources
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 ...
Helle Hvid Hansen +2 more
openaire +6 more sources
Simultaneous Method for Solving Certain Systems of Matrix Equations with Two Unknowns
AxiomsQuantitative bisimulations between weighted finite automata are defined as solutions of certain systems of matrix-vector inequalities and equations. In the context of fuzzy automata and max-plus automata, testing the existence of bisimulations and their ...
Predrag S. Stanimirović +4 more
doaj +1 more source
Topologies, Continuity and Bisimulations [PDF]
RAIRO - Theoretical Informatics and Applications, 1999 Summary: The notion of a bisimulation relation is of basic importance in many areas of computation theory and logic. Of late, it has come to take a particular significance in work on the formal analysis and verification of hybrid control systems, where system properties are expressible by formulas of the modal \(\mu\)-calculus or weaker temporal logics.
openaire +2 more sources
Verification of declarative LTL-specification of control programs behavior
Моделирование и анализ информационных системThe article continues the series of works on development and verification of control programs based on LTL-specifications of a special type. Previously, it was proposed a declarative LTL-specification, which allows describing the behavior of control ...
Maxim V. Neyzov, Egor V. Kuzmin
doaj +1 more source