Coinduction for preordered algebra
نویسندگان
چکیده
منابع مشابه
Coinduction for preordered algebra
We develop a combination, called hidden preordered algebra, between preordered algebra, which is an algebraic framework supporting specification and reasoning about transitions, and hidden algebra, which is the algebraic framework for behavioural specification. This combination arises naturally within the heterogeneous framework of the modern formal specification language CafeOBJ. The novel spe...
متن کاملIncremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization
We present a coinductive proof system for bisimilarity in transition systems specifiable in the de Simone SOS format. Our coinduction is incremental, in that it allows building incrementally an a priori unknown bisimulation, and pattern-based, in that it works on equalities of process patterns (i.e., universally quantified equations of process terms containing process variables), thus taking ad...
متن کاملRough Approximations on Preordered Sets
In this paper, we investigate the properties of rough approximations defined by preordered sets. We study the relations among the lower and upper rough approximations, closure and interior systems, and closure and interior operators.
متن کاملGeneralized Coinduction
We introduce the λ-coiteration schema for a distributive law λ of a functor T over a functor F. Parameterised by T and λ it generalizes the basic coiteration schema uniquely characterising functions into a final F-coalgebra. Furthermore, the same parameters are used to generalize the categorical notion of a bisimulation to that of a λ-bisimulation, still giving rise to a proof technique for bis...
متن کاملOrdinal decompositions for preordered root systems
In this paper, we explore the effects of certain forbidden substructure conditions on preordered sets. In particular, we characterize in terms of these conditions those preordered sets which can be represented as the supremum of a well-ordered ascending chain of lowersets whose members are constructed by means of alternating applications of disjoint union and ordinal sums with chains. These dec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2011
ISSN: 0890-5401
DOI: 10.1016/j.ic.2010.11.001