Results 21 to 30 of about 13,172 (205)

Modelling and verification of parameterized architectures: A functional approach

open access: yesIET Computers &Digital Techniques, Volume 15, Issue 5, Page 335-348, September 2021., 2021
Abstract The merit of higher order functions for hardware description and transformation is widely acknowledged by hardware designers. However, the use of higher order types makes their correctness proof very difficult. Herein, a new proof approach based on the principle of partial application is proposed which transforms higher order functions into ...
Salah Merniz, Saad Harous
wiley   +1 more source

Risk Measurement Method of Collusion Privilege Escalation Attacks for Android Apps Based on Feature Weight and Behavior Determination

open access: yesSecurity and Communication Networks, Volume 2021, Issue 1, 2021., 2021
To solve the issue of measuring the risk of the application‐layer collusion privilege escalation attacks in Android apps, this paper proposed a risk measurement method based on the feature weight and behavior determination. Analytic hierarchy process (AHP) is used to calculate the weight of feature in the feature set extracted from the app.
Hui Li   +6 more
wiley   +1 more source

A Bisimulation-based Method for Proving the Validity of Equations in GSOS Languages [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2010
This paper presents a bisimulation-based method for establishing the soundness of equations between terms constructed using operations whose semantics is specified by rules in the GSOS format of Bloom, Istrail and Meyer.
Luca Aceto   +2 more
doaj   +1 more source

Bisimulation and Hennessy-Milner Logic for Generalized Synchronization Trees [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2017
In this work, we develop a generalization of Hennessy-Milner Logic (HML) for Generalized Synchronization Trees (GSTs) that we call Generalized Hennessy Milner Logic (GHML).
James Ferlez   +2 more
doaj   +1 more source

Reasoning About Bounds in Weighted Transition Systems [PDF]

open access: yesLogical Methods in Computer Science, 2018
We propose a way of reasoning about minimal and maximal values of the weights of transitions in a weighted transition system (WTS). This perspective induces a notion of bisimulation that is coarser than the classic bisimulation: it relates states that ...
Mikkel Hansen   +3 more
doaj   +1 more source

Bisimulation by Unification* [PDF]

open access: yes, 2002
We propose a methodology for the analysis of open systems based on process calculi and bisimilarity. Open systems are seen as coordinators (i.e. terms with place-holders), that evolve when suitable components (i.e. closed terms) fill in their place-holders. The distinguishing feature of our approach is the definition of a symbolic operational semantics
BALDAN P, BRACCIALI A, BRUNI, ROBERTO
openaire   +2 more sources

Fuzzy Automata as Coalgebras

open access: yesMathematics, 2021
The coalgebraic method is of great significance to research in process algebra, modal logic, object-oriented design and component-based software engineering.
Ai Liu   +3 more
doaj   +1 more source

Globally Governed Session Semantics [PDF]

open access: yesLogical Methods in Computer Science, 2014
This paper proposes a bisimulation theory based on multiparty session types where a choreography specification governs the behaviour of session typed processes and their observer.
Dimitrios Kouzapas, Nobuko Yoshida
doaj   +1 more source

Possibilistic Cost Computation Tree Logic and Related Equivalence, Abstraction Technique

open access: yesIEEE Access, 2023
Recently, probabilistic Kripke structures have been used to represent uncertain systems; nevertheless, important transition costs were ignored in earlier studies, making it impossible to model some uncertain systems with costs.
Hui Deng, Yuzhe Zhang, Zhilong Huang
doaj   +1 more source

Bisimulation as a logical relation

open access: yesMathematical Structures in Computer Science, 2022
AbstractWe investigate how various forms of bisimulation can be characterised using the technology of logical relations. The approach taken is that each form of bisimulation corresponds to an algebraic structure derived from a transition system, and the general result is that a relation R between two transition systems on state spaces S and T is a ...
Claudio Hermida   +3 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy