Results 121 to 130 of about 6,025 (211)

Approximate Bisimulation for High-Level Datapaths in Intelligent Transportation Systems

Advances in Mechanical Engineering, 2013
A relation called approximate bisimulation is proposed to achieve behavior and structure optimization for a type of high-level datapath whose data exchange processes are expressed by nonlinear polynomial systems. The high-level datapaths are divided into
Hui Deng, Jinzhao Wu, Hongyan Tan
doaj   +1 more source

Towards sharing in lazy computation systems [PDF]

, 2004
Work on proving congruence of bisimulation in functional programming languages often refers to [How89,How96], where Howe gave a highly general account on this topic in terms of so-called lazy computation systems .
Mann, Matthias, Matthias Mann
core  

Bisimulation quantified logics: undecidability

, 2005
. In this paper we introduce a general semantic interpretation for propositional quantification in all multi-modal logics based on bisimulations (bisimulation quantification).
Tim French
core   +1 more source

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  

Formal methods: practical applications and foundations: Editorial. [PDF]

Form Methods Syst Des, 2021
Ter Beek MH, McIver A.
europepmc   +1 more source

Bisimulation [PDF]

, 2009
This work is about bisimulation in modal logic as well as in intuicionistic logic without contraction. Bisimulation is a relation between models, which is weaker than isomorphism, yet still guarantees equivalence in the in the selected logic.
Arazim, Pavel
core   +1 more source

On bisimulation in absence of restriction

RAIRO - Theoretical Informatics and Applications
We 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

Noninterference Through Bisimulation

Noninterference properties state that data does not flow in an undesirable manner, e.g. from a high-security to a low-security setting. Within programming languages noninterference is often enforced through the use of modal type systems. Proving the property often requires non-trivial techniques, such as denotational semantics or logical relations.
April Tune, Wendy Yang, G. A. Kavvos
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

Bisimulation and Bounded Bisimulation

, 1997
In this paper the notion of bounded bisimulation is introduced to explore connections between work on Kripke models, non­well­founded sets and knowledge structures. The paper is organized as follows.
Gerbrandy, Jelle
core