15,140 research outputs found
Analysis and Verification of Service Interaction Protocols - A Brief Survey
Modeling and analysis of interactions among services is a crucial issue in
Service-Oriented Computing. Composing Web services is a complicated task which
requires techniques and tools to verify that the new system will behave
correctly. In this paper, we first overview some formal models proposed in the
literature to describe services. Second, we give a brief survey of verification
techniques that can be used to analyse services and their interaction. Last, we
focus on the realizability and conformance of choreographies.Comment: In Proceedings TAV-WEB 2010, arXiv:1009.330
An Algebra of Synchronous Scheduling Interfaces
In this paper we propose an algebra of synchronous scheduling interfaces
which combines the expressiveness of Boolean algebra for logical and functional
behaviour with the min-max-plus arithmetic for quantifying the non-functional
aspects of synchronous interfaces. The interface theory arises from a
realisability interpretation of intuitionistic modal logic (also known as
Curry-Howard-Isomorphism or propositions-as-types principle). The resulting
algebra of interface types aims to provide a general setting for specifying
type-directed and compositional analyses of worst-case scheduling bounds. It
covers synchronous control flow under concurrent, multi-processing or
multi-threading execution and permits precise statements about exactness and
coverage of the analyses supporting a variety of abstractions. The paper
illustrates the expressiveness of the algebra by way of some examples taken
from network flow problems, shortest-path, task scheduling and worst-case
reaction times in synchronous programming.Comment: In Proceedings FIT 2010, arXiv:1101.426
Structural Synthesis for GXW Specifications
We define the GXW fragment of linear temporal logic (LTL) as the basis for
synthesizing embedded control software for safety-critical applications. Since
GXW includes the use of a weak-until operator we are able to specify a number
of diverse programmable logic control (PLC) problems, which we have compiled
from industrial training sets. For GXW controller specifications, we develop a
novel approach for synthesizing a set of synchronously communicating
actor-based controllers. This synthesis algorithm proceeds by means of
recursing over the structure of GXW specifications, and generates a set of
dedicated and synchronously communicating sub-controllers according to the
formula structure. In a subsequent step, 2QBF constraint solving identifies and
tries to resolve potential conflicts between individual GXW specifications.
This structural approach to GXW synthesis supports traceability between
requirements and the generated control code as mandated by certification
regimes for safety-critical software. Synthesis for GXW specifications is in
PSPACE compared to 2EXPTIME-completeness of full-fledged LTL synthesis. Indeed
our experimental results suggest that GXW synthesis scales well to
industrial-sized control synthesis problems with 20 input and output ports and
beyond.Comment: The long (including appendix) version being reviewed by CAV'16
program committee. Compared to the submitted version, one author (out of her
wish) is moved to the Acknowledgement. (v2) Corrected typos. (v3) Add an
additional remark over environment assumption and easy corner case
Contract Aware Components, 10 years after
The notion of contract aware components has been published roughly ten years
ago and is now becoming mainstream in several fields where the usage of
software components is seen as critical. The goal of this paper is to survey
domains such as Embedded Systems or Service Oriented Architecture where the
notion of contract aware components has been influential. For each of these
domains we briefly describe what has been done with this idea and we discuss
the remaining challenges.Comment: In Proceedings WCSI 2010, arXiv:1010.233
Stratospheric measurement requirements and satellite-borne remote sensing capabilities
The capabilities of specific NASA remote sensing systems to provide appropriate measurements of stratospheric parameters for potential user needs were assessed. This was used to evaluate the capabilities of the remote sensing systems to perform global monitoring of the stratosphere. The following conclusions were reached: (1) The performance of current remote stratospheric sensors, in some cases, compares quite well with identified measurement requirements. Their ability to measure other species has not been demonstrated. (2) None of the current, in-situ methods have the capability to satisfy the requirements for global monitoring and the temporal constraints derived from the users needs portion of the study. (3) Existing, non-remote techniques will continue to play an important role in stratospheric investigations for both corroboration of remotely collected data and in the evolutionary development of future remote sensors
Under-approximating Cut Sets for Reachability in Large Scale Automata Networks
In the scope of discrete finite-state models of interacting components, we
present a novel algorithm for identifying sets of local states of components
whose activity is necessary for the reachability of a given local state. If all
the local states from such a set are disabled in the model, the concerned
reachability is impossible. Those sets are referred to as cut sets and are
computed from a particular abstract causality structure, so-called Graph of
Local Causality, inspired from previous work and generalised here to finite
automata networks. The extracted sets of local states form an
under-approximation of the complete minimal cut sets of the dynamics: there may
exist smaller or additional cut sets for the given reachability. Applied to
qualitative models of biological systems, such cut sets provide potential
therapeutic targets that are proven to prevent molecules of interest to become
active, up to the correctness of the model. Our new method makes tractable the
formal analysis of very large scale networks, as illustrated by the computation
of cut sets within a Boolean model of biological pathways interactions
gathering more than 9000 components
Efficient First-Order Temporal Logic for Infinite-State Systems
In this paper we consider the specification and verification of
infinite-state systems using temporal logic. In particular, we describe
parameterised systems using a new variety of first-order temporal logic that is
both powerful enough for this form of specification and tractable enough for
practical deductive verification. Importantly, the power of the temporal
language allows us to describe (and verify) asynchronous systems, communication
delays and more complex properties such as liveness and fairness properties.
These aspects appear difficult for many other approaches to infinite-state
verification.Comment: 16 pages, 2 figure
- …