Results 21 to 30 of about 6,025 (211)
A Bisimulation-based Method for Proving the Validity of Equations in GSOS Languages [PDF]
Electronic 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
Security 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
On bisimulations for the spi calculus [PDF]
Mathematical Structures in Computer Science, 2002 The spi calculus [\textit{M. Abadi} and \textit{A. D. Gordon}, Inf. Comput. 148, 1--70 (1999; Zbl 0924.68073)], is a process calculus extending pi-calculus. It was designed for description and formal verification of cryptographic protocols, and correctness properties of such protocols may be expressed as may-testing equivalences between certain process
Borgström, Johannes, Nestmann, Uwe
openaire +3 more sources
Reasoning About Bounds in Weighted Transition Systems [PDF]
Logical 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 and Hennessy-Milner Logic for Generalized Synchronization Trees [PDF]
Electronic 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
Locating Reactions using 2-Categories [PDF]
, 2005 Groupoidal relative pushouts (GRPOs) have recently been proposed by the authors as a new foundation for Leifer and Milner's approach to deriving labelled bisimulation congruences from reduction systems.
Vladimiro Sassone (16064975) +5 more
core +2 more sources
Observational Congruences for Dynamically Reconfigurable Tile Systems [PDF]
, 2005 The SOS formats that ensure that bisimilarity is a congruence fail in the presence of structural axioms on states. Dynamic bisimulation, introduced to characterize the coarsest congruence for CCS which is also a weak bisimulation, reconciles the ...
SASSONE V. +10 more
core +2 more sources
Bisimulation by Unification* [PDF]
, 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
Equivalence of switching linear systems by bisimulation [PDF]
, 2006 A general notion of hybrid bisimulation is proposed for the class of switching linear systems. Connections between the notions of bisimulation-based equivalence, state-space equivalence, algebraic and input–output equivalence are investigated.
Schaft, A.J. van der, +11 more
core +2 more sources
Bisimulation of Labeled State-to-Function Transition Systems of Stochastic Process Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Labeled state-to-function transition systems, FuTS for short, admit multiple transition schemes from states to functions of finite support over general semirings.
D. Latella, M. Massink, E.P. de Vink
doaj +1 more source