Results 101 to 110 of about 6,025 (211)

Higher Dimensional Transition Systems

open access: yes, 1996
We introduce the notion of higher dimensional transition systems as a model of concurrency providing an elementary, set-theoretic formalisation of the idea of higher dimensional transition.
Cattani, G.L.   +3 more
core   +1 more source

Topologies, Continuity and Bisimulations [PDF]

open access: yesRAIRO - 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

Bisimulations on Data Graphs

open access: yesJournal of Artificial Intelligence Research, 2018
Bisimulation provides structural conditions to characterize indistinguishability from an external observer between nodes on labeled graphs. It is a fundamental notion used in many areas, such as verification, graph-structured databases, and constraint satisfaction.
Abriola, Sergio   +3 more
openaire   +5 more sources

Bisimulation for Demonic Schedulers [PDF]

open access: yes, 2009
Bisimulation between processes has been proven a successful method for formalizing security properties. We argue that in certain cases, a scheduler that has full information on the process and collaborates with the attacker can allow him to distinguish two processes even though they are bisimilar.
Konstantinos Chatzikokolakis 0001   +2 more
openaire   +3 more sources

Simultaneous Method for Solving Certain Systems of Matrix Equations with Two Unknowns

open access: yesAxioms
Quantitative 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

A Strong Bisimulation for a Classical Term Calculus [PDF]

open access: yesLogical Methods in Computer Science
When 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

Neighbourhood Contingency Bisimulation [PDF]

open access: yes, 2016
We introduce a notion of bisimulation for contingency logic interpreted on neighbourhood structures, characterise this logic as bisimulation-invariant fragment of modal logic and of first-order logic, and compare it with existing notions in the literature.
Z. Bakhtiari (Zeinab)   +2 more
openaire   +5 more sources

Deciding Orthogonal Bisimulation [PDF]

open access: yes, 2007
. Bergstra, Ponse and van der Zwaag introduced in 2003 the notion of orthogonal bisimulation equivalence on labeled transition systems. This equivalence is a refinement of branching bisimulation, in which consecutive τ-actions (silent steps) can be ...
Thuy ThuyDuong Vu, Thuy Duong Vu
core   +1 more source

Verification of declarative LTL-specification of control programs behavior

open access: yesМоделирование и анализ информационных систем
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

Home - About - Disclaimer - Privacy