Relations and Kleene Algebra in Computer Science: 10th International Conference on Relational Methods in Computer Science, and 5th International Conference on Applications of Kleene Algebra, RelMiCS/A

ISBN-13: 9783540789123 / Angielski / Miękka / 2008 / 402 str.

Rudolf Berghammer;Bernhard Möller;Georg Struth

Opis

The book constitutes the joint refereed proceedings of the 10th International Conference on Relational Methods in Computer Science, RelMiCS 2008, and the 5th International Workshop on Applications of Kleene Algebras, AKA 2008, held in Manchester, UK in April 2008. The 26 revised full papers presented together with 2 invited papers were carefully reviewed and selected from numerous submissions. The papers describe the calculus of relations and similar algebraic formalisms as methodological and conceptual tools with special focus on formal methods for software engineering, logics of programs and links to neighbouring disciplines. Their scope comprises relation algebra, fixpoint calculi, semiring theory, iteration algebras, process algebras and dynamic algebras. Applications include formal algebraic modeling, the semantics, analysis and development of programs, formal language theory and combinatorial optimization.

Spis treści

Formal Methods and the Theory of Social Choice.- Relations Making Their Way from Logics to Mathematics and Applied Sciences.- Boolean Logics with Relations.- Relation Algebra and RelView in Practical Use: Construction of Special University Timetables.- A Relation Algebraic Semantics for a Lazy Functional Logic Language.- Latest News about Demonic Algebra with Domain.- On the Structure of Demonic Refinement Algebras with Enabledness and Termination.- Multi-objective Problems in Terms of Relational Algebra.- The Lattice of Contact Relations on a Boolean Algebra.- A Non-probabilistic Relational Model of Probabilistic Kleene Algebras.- Increasing Bisemigroups and Algebraic Routing.- Lazy Relations.- The Algebraic Approach I: The Algebraization of the Chomsky Hierarchy.- The Algebraic Approach II: Dioids, Quantales and Monads.- Automated Reasoning for Hybrid Systems — Two Case Studies —.- Non-termination in Idempotent Semirings.- Formal Concepts in Dedekind Categories.- The Structure of the One-Generated Free Domain Semiring.- Determinisation of Relational Substitutions in Ordered Categories with Domain.- Boolean Algebras and Stone Maps in Schröder Categories.- Cardinality in Allegories.- Solving Linear Equations in *-continuous Action Lattices.- Reactive Probabilistic Programs and Refinement Algebra.- Knowledge and Games in Modal Semirings.- Theorem Proving Modulo Based on Boolean Equational Procedures.- Rectangles, Fringes, and Inverses.- An Ordered Category of Processes.- Automatic Proof Generation in Kleene Algebra.