Implementing Stochastically-Timed COWS for the Prism Probabilistic Model Checker

نویسنده

  • Michele Sevegnani
چکیده

This thesispresents the implementationof theCOWS2Prism system, a compiler for stochastic COWS (Calculus for Orchestration of Web Services) into Prism. The process calculus COWS is intended to aid in the precise description of Web Services compositions. This places the present informal development approach associated with Web Services into a formal reasoning framework. The COWS calculus concerns itself with behavioural aspects although two timed extensions exist: Stochastic COWS and Timed COWS (for reasoning about non-functional aspects such as quality of service). In the dissertation we provide a syntax and a semantics for stochastic COWS, and then a detailed description of the design and implementation of the COWS2Prism system. We also give a well commented example of compilation of a COWS service into the Prism format.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verification and Control of Partially Observable Probabilistic Real-Time Systems

We propose automated techniques for the verification and control of probabilistic real-time systems that are only partially observable. To formally model such systems, we define an extension of probabilistic timed automata in which local states are partially visible to an observer or controller. We give a probabilistic temporal logic that can express a range of quantitative properties of these ...

متن کامل

Performance Analysis of Distributed and Asynchronous Systems using Probabilistic Timed Actors

Many real-time distributed applications exhibit probabilistic and non-deterministic behaviors. In this paper, we introduce Probabilistic Timed Rebeca (PTRebeca) as an actor-based language for modeling probabilistic distributed real-time systems with asynchronous message passing. We propose the semantics of PTRebeca model in Timed Markov Decision Process (TMDP), the integral semantics of probabi...

متن کامل

Verifying Collision Avoidance Behaviours for Unmanned Surface Vehicles using Probabilistic Model Checking

Collision avoidance is an essential safety requirement for unmanned surface vehicles (USVs). Normally, its practical verification is non-trivial, due to the stochastic behaviours of both the USVs and the intruders. This paper presents the probabilistic timed automata (PTAs) based formalism for three collision avoidance behaviours of USVs in uncertain dynamic environments, which are associated w...

متن کامل

An MTBDD-Based Implementation of Forward Reachability for Probabilistic Timed Automata

Multi-Terminal Binary Decision Diagrams (MTBDDs) have been successfully applied in symbolic model checking of probabilistic systems. In this paper we propose an encoding method for Probabilistic Timed Automata (PTA) based on MTBDDs. The timing information is encoded via placeholders stored in the MTBDDs that are independent of how the timing information is represented. Using the Colorado Univer...

متن کامل

Symmetry Reduction for Probabilistic Systems

Symmetry reduction techniques have been quite successful in combatting the state-space explosion problem for temporal logic model checking [2, 3]. Recently, there has been a lot of interest in using model checkers to verify properties of probabilistic systems. We describe work in progress in extending symmetry reduction techniques to apply to discrete time Markov chains and Markov decision proc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008