Verifying realizability and reachability in recursive interaction protocol specifications
نویسندگان
چکیده
The Propositional Statechart language described in [4] makes it possible to provide unambiguous joint diagrammatic specifications of complex recursive interaction protocols such as the multilateral voting protocol. Recursive protocols described using Propositional Statecharts are not necessarily finite state, meaning that verification of properties of these protocols cannot be achieved solely by means of finite state model checking. In this paper we discuss the verification of realizability, and reachability analysis, in recursive joint protocol specifications expressed using joint Propositional Statecharts.
منابع مشابه
Verifying Reachability-Logic Properties on Rewriting-Logic Specifications
Reachability Logic is a recently introduced formalism, which is currently used for defining the operational semantics of programming languages and for stating properties about program executions. In this paper we show how Reachability Logic can be adapted for stating properties of transition systems described by Rewriting-Logic specifications. We propose an automatic procedure for verifying Rew...
متن کاملRealizability Analysis 1 Running head: REALIZABILITY ANALYSIS Realizability Analysis of Top-down Web Service Composition Specifications
A conversation protocol specifies the desired global behaviors of a web service composition in a top-down fashion. Before implementing a conversation protocol, its realizability has to be determined, i.e., can a bottom-up web service composition be synthesized so that it generates exactly the same set of conversations as specified by the protocol? This chapter presents three sufficient conditio...
متن کاملAnalysis of Realizability Conditions for Web Service Choreographies
Web service choreography languages allow for the description of multipart collaborations from a global point of view, specifying the information exchanged by the participants in order to accomplish a common business goal. An important issue, emerging from the choreography modelling, is the protocol realizability, i.e., the possibility to extract the local specifications of the participants, so ...
متن کاملVerifying lossy channel systems has nonprimitive recursive complexity
Lossy channel systems are systems of finite state automata that communicate via unreliable unbounded fifo channels. It is known that reachability, termination and a few other verification problems are decidable for these systems. In this article we show that these problems cannot be solved in primitive recursive time.
متن کاملColin Mclarty Semantics for First and Higher Order Realizability
First order Kleene realizability is given a semantic interpretation, including arithmetic and other types. These types extend at a stroke to full higher order intuitionistic logic. They are also useful themselves, e.g., as models for lambda calculi, for which see Asperti and Longo 1991 and papers on PERs and polymorphism (IEEE 1990). This semantics is simpler and more explicit than in Hyland 19...
متن کامل