Expressiveness and Completeness in Abstraction

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

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

Expressiveness and Completeness in Abstraction

ion is often a key instrument for turning intractable model checking problems into tractable problems. In the theoretical studies on abstraction frameworks, the expressivity and completeness of the frameworks are the main indicators of the power of the frameworks. A major problem is that the notion of expressiveness of an abstraction framework is not defined unambiguously in the literature. Wei...

متن کامل

Completeness of Lyapunov Abstraction

In this work, we continue our study on discrete abstractions of dynamical systems. To this end, we use a family of partitioning functions to generate an abstraction. The intersection of sub-level sets of the partitioning functions defines cells, which are regarded as discrete objects. The union of cells makes up the state space of the dynamical systems. Our construction gives rise to a combinat...

متن کامل

Abstraction and Completeness for Real-Time Maude

ion and Completeness for Real-Time Maude Peter Csaba Ölveczky a,b and José Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, University of Illinois at Urbana-Champaign Abstract This paper presents criteria that guarantee completeness of Real-Time Maude search and temporal logic model checking analyses, under the maximal time sampling strategy, for a la...

متن کامل

Epistemic Quantified Boolean Logic: Expressiveness and Completeness Results

We introduce epistemic quantified boolean logic (EQBL), an extension of propositional epistemic logic with quantification over propositions. We show that EQBL can express relevant properties about agents’ knowledge in multi-agent contexts, such as “agent a knows as much as agent b”. We analyse the expressiveness of EQBL through a translation into monadic second-order logic, and provide complete...

متن کامل

On the Completeness and Expressiveness of Spider Diagram Systems

Spider diagram systems provide a visual language that extends the popular and intuitive Venn diagrams and Euler circles. Designed to complement object-oriented modelling notations in the specification of large software systems they can be used to reason diagrammatically about sets, their cardinalities and their relationships with other sets. A set of reasoning rules for a spider diagram system ...

متن کامل

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


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

ژورنال

عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science

سال: 2012

ISSN: 2075-2180

DOI: 10.4204/eptcs.89.5