Results 1  10
of
22
Web Services : a Process Algebra Approach
"... It is now welladmitted that formal methods are helpful for many issues raised in the Web service area. In this paper we present a framework for the design and the verification of WSs using process algebras and their tools. We define a twoway mapping between abstract specifications written using th ..."
Abstract

Cited by 42 (0 self)
 Add to MetaCart
(Show Context)
It is now welladmitted that formal methods are helpful for many issues raised in the Web service area. In this paper we present a framework for the design and the verification of WSs using process algebras and their tools. We define a twoway mapping between abstract specifications written using these calculi and executable Web services written in BPEL4WS; the translation includes also compensation, event, and fault handlers. The following choices are available: design and verification in BPEL4WS, using process algebra tools, or design and verification in process algebra and automatically obtaining the corresponding BPEL4WS code. The approaches can be combined. Process algebras are not useful only for temporal logic verification: we remark the use of simulation/bisimulation for verification, for the hierarchical refinement design method, for the service redundancy analysis in a community, and for replacing a service with another one in a composition.
CSPCasl – A new integration of process algebra and algebraic specification
 Theoretical Computer Science
, 2003
"... CspCasl is a combination of the process algebra Csp [11,22] and the algebraic specification language Casl [7,1]. Its novel aspects include the combination of denotational semantics in the process part and, in particular, loose semantics for the data types covering both concepts partiality and subs ..."
Abstract

Cited by 27 (16 self)
 Add to MetaCart
(Show Context)
CspCasl is a combination of the process algebra Csp [11,22] and the algebraic specification language Casl [7,1]. Its novel aspects include the combination of denotational semantics in the process part and, in particular, loose semantics for the data types covering both concepts partiality and subsorting. Technically, this integration involves the development of a new cocalled datalogic formulated as an institution. This datalogic serves as a link between the institution underlying Casl and the alphabet of communications necessary for the Csp semantics. Besides being generic in the various denotational Csp semantics, this construction leads also to an appropriate notion of refinement with clear relations to both data refinement in Casl and process refinement in Csp. Key words: Algebraic specification; institution; process algebra; CASL, CSP. 1
Algebraiccoalgebraic specification in CoCasl
 J. LOGIC ALGEBRAIC PROGRAMMING
, 2006
"... We introduce CoCasl as a simple coalgebraic extension of the algebraic specification language Casl. CoCasl allows the nested combination of algebraic datatypes and coalgebraic process types. We show that the wellknown coalgebraic modal logic can be expressed in CoCasl. We present sufficient criter ..."
Abstract

Cited by 27 (9 self)
 Add to MetaCart
(Show Context)
We introduce CoCasl as a simple coalgebraic extension of the algebraic specification language Casl. CoCasl allows the nested combination of algebraic datatypes and coalgebraic process types. We show that the wellknown coalgebraic modal logic can be expressed in CoCasl. We present sufficient criteria for the existence of cofree models, also for several variants of nested cofree and free specifications. Moreover, we describe an extension of the existing proof support for Casl (in the shape of an encoding into higherorder logic) to CoCasl.
Behavioral matchmaking for service retrieval
 In Int. Conf. on Web Services
"... The capability to easily find useful services (software applications, software components, scientific computations) becomes increasingly critical in several fields. Current approaches for services retrieval are mostly limited to the matching of their inputs/outputs. Recent works have demonstrated th ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
The capability to easily find useful services (software applications, software components, scientific computations) becomes increasingly critical in several fields. Current approaches for services retrieval are mostly limited to the matching of their inputs/outputs. Recent works have demonstrated that this approach is not sufficient to discover relevant components. In this paper we argue that, in many situations, the service discovery should be based on the specification of service behavior (in particular, the conversation protocol). The idea behind is to develop matching techniques that operate on behavior models and allow delivery of partial matches and evaluation of semantic distance between these matches and the user requirements. Consequently, even if a service satisfying exactly the user requirements does not exist, the most similar ones will be retrieved and proposed for reuse by extension or modification. To do so, we reduce the problem of behavioral matching to a graph matching problem and we adapt existing algorithms for this purpose. A prototype is presented (available as a web service) which takes as input two conversation protocols and evaluates the semantic distance between them; the prototype provides also the script of edit operations that can be used to alter the first model to render it identical with the second one.
Verifying Safety of a Token Coherence Implementation by Parametric Compositional Refinement
 In Proceedings of VMCAI
, 2005
"... ..."
Decidable extensions of HennessyMilner Logic
 In Proc. FORTE'06, LNCS 4229, 2006
"... Abstract. We propose a new class of logics for specifying and modelchecking properties of distributed systems Dynamic Epistemic Spatial Logics. They have been designed as extensions of HennessyMilner logic with spatial operators (inspired by CardelliGordonCaires spatial logic) and epistemic ope ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
(Show Context)
Abstract. We propose a new class of logics for specifying and modelchecking properties of distributed systems Dynamic Epistemic Spatial Logics. They have been designed as extensions of HennessyMilner logic with spatial operators (inspired by CardelliGordonCaires spatial logic) and epistemic operators (inspired by dynamicepistemic logics). Our logics focus on observers, agents placed in different locations of the system having access to some subsystems. Treating them as epistemic agents, we develop completely axiomatized and decidable logics that express the information flow between them in a dynamic and distributed environment. The knowledge of an epistemic agent, is understood as the information, locally available to our observer, about the overallglobal system. 1
A decidable extension of hennessymilner logic with spatial operators
, 2006
"... in addition to the modal temporal operators, some modal spatial operators such as the parallel operator φψ (meaning that the current process can be split into a parallel composition QR of a process Q satisfying φ and a process R satisfying ψ), and its adjoint the guarantee operator φ ⊲ ψ, or loca ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(Show Context)
in addition to the modal temporal operators, some modal spatial operators such as the parallel operator φψ (meaning that the current process can be split into a parallel composition QR of a process Q satisfying φ and a process R satisfying ψ), and its adjoint the guarantee operator φ ⊲ ψ, or location operator 1 n[φ] (meaning that the current process is an ambient n[P] and the process P satisfies φ), etc. A formula in a spatial logic describes a property of a particular part of the system at a particular time. These spatial modalities have an intensional flavor, the properties they express being invariant only for simple spatial rearrangements of the system. As the main reason for introducing spatial logics was to provide appropriate techniques for specification and model checking concurrent distributed systems, most of the work done in this field points to decidability problems. The decidability of Dynamic Spatial Logic has been anticipated in [4]. Still, on the best of our knowledge, there is no prove in this direction. In this paper we will provide such a prove underpinning on finite model property. In proving the finite model property for our logic, we used a new congruence on processes the structural bisimulation. A conceptually similar congruence has been proposed in [5], but for static processes only. The structural bisimulation
Consistency between Task Models and Use Cases
"... Abstract. Use cases are the notation of choice for functional requirements documentation, whereas task models are used as a starting point for user interface design. In this paper, we motivate the need for an integrated development methodology in order to narrow the conceptual gap between software e ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
Abstract. Use cases are the notation of choice for functional requirements documentation, whereas task models are used as a starting point for user interface design. In this paper, we motivate the need for an integrated development methodology in order to narrow the conceptual gap between software engineering and user interface design. This methodology rests upon a common semantic framework for developing and handling use cases and task models. Based on the intrinsic characteristic of both models we define a common formal semantics and provide a formal definition of consistency between task models and use cases. The semantic mapping and the application of the proposed consistency definition are supported by an illustrative example.
Modeling an Electronic Throttle Controller using the Timed Abstract State Machine Language and Toolset
 IN: PROCEEDINGS OF THE SATELLITE EVENTS OF THE 2006 MODELS CONFERENCE. LNCS
, 2006
"... A key challenge in the design and analysis of realtime systems is the integration of functional and nonfunctional properties into a single specification. In this paper, we present an integrated toolset based on the TASM language. The toolset is used to specify and analyze reactive embedded realti ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
A key challenge in the design and analysis of realtime systems is the integration of functional and nonfunctional properties into a single specification. In this paper, we present an integrated toolset based on the TASM language. The toolset is used to specify and analyze reactive embedded realtime systems. The toolset implements the features of the Timed Abstract State Machine (TASM) language, a novel specification language. The nonfunctional properties that can be expressed in the language include timing behavior and resource consumption. The toolset enables the creation of executable specifications with welldefined execution semantics, abstraction mechanisms, and composition semantics. The toolset includes facilities for editing, analyzing, and simulating TASM specifications. The features of the toolset are demonstrated using an Electronic Throttle Controller (ETC) from a major automotive vendor. The TASM toolset is used to analyze the mode switching logic of the ETC. The ETC is used to calculate fuel injection and air intake to optimize fuel consumption. The TASM toolset is used to analyze the resource consumption resulting from the mode switching logic, and to verify the completeness and consistency of the specification.
Verification of Open Interactive Markov Chains
"... Interactive Markov chains (IMC) are compositional behavioral models extending both labeled transition systems and continuoustime Markov chains. IMC pair modeling convenience owed to compositionality properties with effective verification algorithms and tools owed to Markov properties. Thus far h ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Interactive Markov chains (IMC) are compositional behavioral models extending both labeled transition systems and continuoustime Markov chains. IMC pair modeling convenience owed to compositionality properties with effective verification algorithms and tools owed to Markov properties. Thus far however, IMC verification did not consider compositionality properties, but considered closed systems. This paper discusses the evaluation of IMC in an open and thus compositional interpretation. For this we embed the IMC into a game that is played with the environment. We devise algorithms that enable us to derive bounds on reachability probabilities that are assured to hold in any composition context.