A semantic framework for the abstract model checking of tccp programs

نویسندگان
چکیده

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

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

منابع مشابه

A semantic framework for the abstract model checking of tccp programs

The Timed Concurrent Constraint programming language (tccp) introduces timeaspects into the Concurrent Constraint paradigm. This makes tccp especially ap-propriate for analyzing timing properties of concurrent systems by model checking.However, even if very compact state representations are obtained thanks to the useof constraints in tccp, large state spaces can still be generat...

متن کامل

Abstract Model Checking of tccp programs

Model Checking of tccp programs Maŕıa Alpuente 1 ,2 Maŕıa del Mar Gallardo 1 ,3 Ernesto Pimentel ,4 Alicia Villanueva 1 ,5

متن کامل

A Semantic Framework for the Abstract Model Checking

The Timed Concurrent Constraint programming language (tccp) introduces time aspects into the Concurrent Constraint paradigm. This makes tccp especially appropriate for analyzing timing properties of concurrent systems by model checking. However, even if very compact state representations are obtained thanks to the use of constraints in tccp, large state spaces can still be generated, which may ...

متن کامل

investigating the feasibility of a proposed model for geometric design of deployable arch structures

deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...

A Symbolic Model Checker for tccp Programs

In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for reactive systems. Our approach is based on using streams to extend Difference Decision Diagrams (DDDs) which generalize the classical Binary Decision Diagrams (BDDs) with constraints. We use streams to model the values of ...

متن کامل

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


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

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2005

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2005.08.009