Results 1 - 10
of
70
Experimenting Acceleration Methods for the Validation of Infinite State Systems
- In International Workshop on Distributed System Validation and Verification (DSVV'2000
, 2000
"... In this paper, we present a generic validation tool, called FMona. We illustrate its use through the expression of iterative and abstraction methods. These methods are applied for the validation of infinite or parameterized space problems. We propose two techniques to enhance iterative methods by ac ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
and validation systems. Usually, we distinguish three families of tools: model checkers (SMV [6], SPIN [11]) to build a finite model and check its temporal properties; automatic proof tools (Mona [10] for the WSnS logic, its extension to structured types Lisa [2]), and proof assistants (Coq [3], HOL [8] and PVS
How to Specify and Verify the Long-Run Average Behavior of Probabilistic Systems
- In Proc. LICS'98
, 1998
"... Long-run average properties of probabilistic systems refer to the average behavior of the system, measured over a period of time whose length diverges to infinity. These properties include many relevant performance and reliability indices, such as system throughput, average response time, and mean t ..."
Abstract
-
Cited by 60 (3 self)
- Add to MetaCart
of temporal logics based on experiments, and we present model-checking algorithms for the verif...
Chapter 12 Rough Sets and Rough Logic: A KDD Perspective
"... Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations of con ..."
Abstract
- Add to MetaCart
Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations of con-cepts. This main goal is motivated by the basic fact, constituting also the main problem of KDD, that languages we may choose for knowledge description are incomplete. A fortiori, we have to describe concepts of interest (features, proper-ties, relations etc.) not completely but by means of their reflections (i.e. approx-imations) in the chosen language. The most important issues in this induction process are: – construction of relevant primitive concepts from which approximations of more complex concepts are assembled, – measures of inclusion and similarity (closeness) on concepts, – construction of operations producing complex concepts from the primitive ones.
Specification and Analysis of the AER/NCA Active Network Protocol Suite in Real-time Maude
, 2006
"... This paper describes the application of the Real-Time Maude tool and the Maude formal methodology to the specification and analysis of the AER/NCA suite of active network multicast protocol components. Because of the time-sensitive and resource-sensitive behavior, the presence of probabilistic algor ..."
Abstract
-
Cited by 28 (18 self)
- Add to MetaCart
. It supports a wide spectrum of formal methods, including: executable specification; symbolic simulation; breadth-first search for failures of safety properties in infinite-state systems; and linear temporal logic model checking of time-bounded temporal logic formulas. These methods complement those offered
QOS WITH RELIABILITY AND SCALABILITY IN ADAPTIVE SERVICE-BASED SYSTEMS
"... Service-based systems that are dynamically composed at runtime to provide complex, adaptive functionality are currently one of the main development paradigms in software engineering. However, the Quality of Service (QoS) delivered by these systems remains an important concern, and needs to be manage ..."
Abstract
- Add to MetaCart
that achieve their QoS requirements through dynamically adapting to changes in the system state, environment, and workload. QoSMOS service-based systems translate high-level QoS requirements specified by their administrators into probabilistic temporal logic formulae, which are then formally and automatically
A Realistic Experiment in Knowledge Representation in Open Event Calculus : Protocol Specification
- In Proceedings of the Joint International Conference and Symposium on Logic Programming
, 1996
"... This paper presents one of the first realistic experiments in the use of Event Calculus in Open Logic Programming: the specification of a process protocol. The specification task involves most of the common complications of temporal reasoning: the representation of context dependent actions, of prec ..."
Abstract
-
Cited by 7 (5 self)
- Add to MetaCart
, of preconditions and ramifications of actions, the modelling of system faults, and most of all, the representation of uncertainty of actions. As the underlying language, the Open Logic Programming formalism, an extension of Logic Programming, is used. The experiment shows that Event Calculus is a promising
Towards Verified Distributed Software Through Refinement of Formal Archetypes
"... Abstract. This paper discusses experiments with a “model-based ” approach for developing verified distributed systems in which program development is carried out by stepwise refinement: we encode, specifications and algorithm archetypes in the PVS theorem prover, carry out stepwise refinement and co ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract. This paper discusses experiments with a “model-based ” approach for developing verified distributed systems in which program development is carried out by stepwise refinement: we encode, specifications and algorithm archetypes in the PVS theorem prover, carry out stepwise refinement
Specification and Analysis of the AER/NCA Active Network Protocol Suite in Real-time Maude
, 2004
"... This paper describes the application of the Real-Time Maude tool and the Maude formal methodology to the specification and analysis of the AER/NCA suite of active network multicast protocol components. Because of the time-sensitive and resource-sensitive behavior, the presence of probabilistic algor ..."
Abstract
- Add to MetaCart
. It supports a wide spectrum of formal methods, including: executable specification; symbolic simulation; breadth-first search for failures of safety properties in infinite-state systems; and linear temporal logic model checking of time-bounded temporal logic formulas. These methods complement those oered
COSMOLOGICAL MODELS OF MODIFIED GRAVITY
, 2013
"... The recent discovery of dark energy has prompted an investigation of ways in which the accelerated expansion of the universe can be realized. In this dissertation, we present two separate projects related to dark energy. The first project analyzes a class of braneworld models in which multiple brane ..."
Abstract
- Add to MetaCart
. In particular, the Randall-Sundrum model is well-known for achieving an amelioration of the hierarchy problem. However, the basic model relies on Minkowski branes and is subject to solar system constraints in the absence of a radion stabilization mechanism. We present a method by which a four-dimensional low
Results 1 - 10
of
70