A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
Refinement of Kripke Models for Dynamics
[chapter]
Lecture Notes in Computer Science
Preserved Fulltext
We prove that the refinement relation on static models assures us to safely reason about any dynamic properties in terms of PAL-formulas on the abstraction of a model. ...
We propose a property-preserving refinement/abstraction theory for Kripke Modal Labelled Transition Systems incorporating not only state mapping but also label and proposition lumping, in order to have ...
We thank the anonymous referees for their detailed comments. The authors are supported by Dutch NWO project VEMPS (612.000.528).
References ...
doi:10.1007/978-3-540-85762-4_8
fatcat:p4xusna47zdfln57nlzema2pwm
Model Checking of Embedded Assembly Program Based on Simulation
2017
IEICE transactions on information and systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
It generates exact Kripke structure by exhaustively and dynamically simulating assembly programs, and simultaneously verify it by model checking. ...
It is important to ensure the safety for embedded software by software model checking. We have developed a verification system for verifying embedded assembly programs. ...
Also we verify Kripke structure by model checking while generating the Kripke structure by dynamic program analysis. ...
doi:10.1587/transinf.2016edp7452
fatcat:3mo2sevr5varhnia3vhgbrgspm
A Refinement based Verification Approach of BPMN Models using NuSMV
2018
Proceedings of the 13th International Conference on Software Technologies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Hence, a formal semantics for BPMN models based on Kripke structure and BPMN refinement patterns will be provided for a formal verification of this correctness. ...
A Refinement based Verification Approach of BPMN Models using NuSMV. ...
The adaptability of a business process is an essential requirement for businesses to cope with the dynamic nature of their environments. ...
doi:10.5220/0006914105630574
dblp:conf/icsoft/AyariHA18
fatcat:px7b4zev6zf3zgqjukahyiwcq4
Automata Games for Multiple-model Checking
2006
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
concretizations exist for a fixed number of models, and propose using parity games on variants of tree automata to efficiently approximate validity checks of multiple models. ...
Structural properties of a universal topological model confirm that such approximations are reasonably precise only for tree-automata-like models. ...
Glenn Bruns is thanked for discussions on databases and abstract views. ...
doi:10.1016/j.entcs.2005.11.067
fatcat:7ybxfy6ecjcphi4ym3rpugjg64
A Formal Development Cycle for Security Engineering in Isabelle
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Since we use a fully formalized model of infrastructures with actors and policies we can support a novel way of formal security refinement for system specifications. ...
We define a formal notion of refinement on infrastructure models. ...
Kripke Structures and CTL Kripke structures and CTL model state based systems and enable analysis of properties under dynamic state changes. ...
arXiv:2001.08983v1
fatcat:3kwu4u25preaplmasfuuzhgdgy
Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
, give rise to a genuine counter-example or produce a spurious counter-example that drives refinement of the abstract model. ...
Abstraction of models [5, 7, 8] is seen as a key aid in realizing scalable model checks: instead of checking M |= φ for a large model M , construct an abstract model A from a compact specification of M ...
Finite refinement plays for models M 1 and M 2 have the rules and winning condi-
tions as stated in Table 1. ...
doi:10.1007/11901914_25
fatcat:a4o4b5islrfurdgfoxd6fzr4da
An approach for verifying correctness of web service compositions
2018
International Journal of Engineering & Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Interleaved dynamic composition and execution of services is beneficial for adapting to changing user preferences. ...
Hence in this work, a two level model verification approach has been proposed to verify the correctness of dynamically composed services. ...
Due to dynamic nature of web service in dynamic composition this method was not applied for dynamic composition by the authors. ...
doi:10.14419/ijet.v7i1.7.9378
fatcat:mgjskkcb7fglhexnlzyqnw3dzm
A Proof Calculus for Attack Trees in Isabelle
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
So far, we have used the combination of a slightly adapted notion of the state transition of the Kripke structures to build a model for attack refinement of attack trees. ...
In the current approach, we use the Kripke models as the semantics for the attack tree analysis. ...
doi:10.1007/978-3-319-67816-0_1
fatcat:2fjl5y6dzzhlvoqp5iedkxfirm
Dependability Engineering in Isabelle
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
It is a known hard problem how to find the next refinement step: this problem is addressed by the attack based analysis using Kripke structures and CTL logic. ...
In this paper, we present the extensions to the Isabelle Infrastructure framework implementing a formal notion of property preserving refinement interleaved with attack tree analysis for the RR-cycle. ...
Statecharts thus also combine data in states as well as dynamic behaviour; their semantics resembles our model. ...
arXiv:2112.04374v1
fatcat:n426mfwflzaj7ikbdjaozhxs6u
Attack Trees in Isabelle
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Attack trees are a well established and useful model for the construction of attacks on systems since they allow a stepwise exploration of high level attacks in application scenarios. ...
Using the expressiveness of Higher Order Logic in Isabelle, we succeed in developing a generic theory of attack trees with a state-based semantics based on Kripke structures and CTL. ...
Kripke Structures and CTL We apply Kripke structures and CTL to model state based systems and analyse properties under dynamic state changes. ...
arXiv:1803.06494v2
fatcat:cb3dhp4y2repvja4ubolwy7ene
Novel Epistemic and Predictive Heuristic for Semantic and Dynamic Social Networks Analysis
2014
Social Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Based on our theoretical findings, we define a semantic and predictive model of dynamic SNA for Enterprises Social Networks (ESN), and experiment it on a real dataset. ...
Our theoretical approach defines a new paradigm for the semantic and dynamic analysis of social networks including shared content. ...
A proposition p is Kripke-equivalent to p′ if p
p′
⇔
in every world of every defined
KRIPKE model, or in every world of a unique KRIPKE model. ...
doi:10.4236/sn.2014.33021
fatcat:7glr2ztrtrg3vb5chmewgzywre
An Outline of a Dynamic Theory of Frames
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Basic frames are defined as Kripke-models. In order to represent the dynamic dimension one needs in addition both combinations of and transformation between such models. ...
Combinations of Kripkemodels are used for temporalization (representing stages of objects and the temporal development of events) and refinement (representing the internal structure of objects). ...
Refinement is a first step to model the dynamic aspect. ...
doi:10.1007/978-3-642-36976-6_9
fatcat:imwq2bdwrvhdjhkgwvswx4uv6q
On Two-Sided Approximate Model-Checking: Problem Formulation and Solution via Finite Topologies
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We give a general construction of a topological finite approximation scheme for a Kripke model from a state-space discretization via an A/D-map and its induced finite topology. ...
We give a general formulation of approximate model-checking, in which both under-and over-approximations are propagated to give two-sided approximations of the denotation set of an arbitrarily complex ...
the particular dynamics of the steered system. ...
doi:10.1007/978-3-540-30206-3_6
fatcat:ioeq4umwsfhtniqhwl7xmm7bp4
Refinement Quantified Logics of Knowledge
2011
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Refinement quantifiers were introduced to quantify over all refinements of a model in modal logic, where a refinement is described by a simulation relation. ...
Given the "possible worlds" interpretation of modal logic, a refinement corresponds to an agent ruling out certain possible worlds based on new information. ...
The significance of refinements is that the refinements of a finite Kripke model are exactly the models that result from the execution of an arbitrary action model [6] . ...
doi:10.1016/j.entcs.2011.10.008
fatcat:oor4yrdhevgfnk2bstsiqwmxvi
A Topological Approach to Full Belief
2018
Journal of Philosophical Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we provide a topological semantics for belief, in particular, for Stalnaker's notion of belief defined as 'epistemic possibility of knowledge', in terms of the closure of the interior operator ...
We also study (static) belief revision as well as belief dynamics by providing a topological semantics for conditional belief and belief update modalities, respectively. ...
We denote a Kripke frame by F = (X, R), a Kripke model by M = (X, R, ν) and we let ϕ M denote the truth set of formula ϕ in a Kripke model M = (X, R, ν). ...
doi:10.1007/s10992-018-9463-4
pmid:30956353
pmcid:PMC6423016
fatcat:se5zhba22ja7fg7z4wga7swlae
« Previous
Showing results 1 — 15 out of 2,139 results