Relational and Algebraic Methods in Computer Science (eBook, PDF)

16th International Conference, RAMiCS 2017, Lyon, France, May 15-18, 2017, Proceedings
Redaktion: Höfner, Peter; Struth, Georg; Pous, Damien

• Format: PDF

Produktbeschreibung

This book constitutes the proceedings of the 16th International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 2017, held in Lyon, France, in May 2017.

The 17 revised full papers and 2 invited papers presented together with 1 invited abstract were carefully selected from 28 submissions. Topics covered range from mathematical foundations to applications as conceptual and methodological tools in computer science and beyond.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Verlag: Springer International Publishing
• Seitenzahl: 323
• Erscheinungstermin: 8. Mai 2017
• Englisch
• ISBN-13: 9783319574189
• Artikelnr.: 53060863

Inhaltsangabe

Algebra for Quantitative Information Flow.- Dual space of a lattice as the completion of a Pervin space.- Images as relations under RelView.- Tool-Based Relational Investigation of Closure-Interior Relatives for Finite Topological Spaces.- Varieties of Cubical Sets.- Non-Associative Kleene Algebra and Temporal Logics.- Algebraic Investigation of Connected Components.- Stone Relation Algebras.- Relation algebras, idempotent semirings and generalized bunched implication algebras.- Parsing and Printing of and with Triples.- Software Development in Relation Algebra with Ampersand.- Allegories and Collagories for Transformation of Graph Structures Considered as Coalgebras.- Aggregation of Votes with Multiple Positions on Each Issue.- Complete solution of an optimization problem in tropical semifield.- Concurrency-Preserving Minimal Process Representation.- Embeddability into relational lattices is undecibable.- Tower Induction and Up-To Techniques for CCS with Fixed Points.- Reasoning aboutCardinalities of Relations with Applications Supported by Proof Assistants.- Type-n Arrow Categories.