Algebra and coalgebra in computer science : second international conference, CALCO 2007, Bergen, Norway, August 20-24, 2007 : proceedings / Till Mossakowski, Ugo Montanari, Magne Haveraaen (eds.).
Contributor(s): Mossakowski, Till | Montanari, U. (Ugo) | Haveraaen, MagneMaterial type: TextSeries: SerienbezeichnungLecture notes in computer science: 4624.; LNCS sublibrary: Publisher: Berlin ; New York : Springer, ©2007Description: 1 online resource (xi, 461 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540738596; 3540738592; 9783540738572; 3540738576Other title: CALCO 2007Subject(s): Computer science -- Mathematics -- Congresses | Algebra -- Congresses | Algebra | Computer science -- Mathematics | Informatique | Algebra | Computer science -- Mathematics | wiskunde | mathematics | computerwetenschappen | computer sciences | logica | logic | software engineering | algebra | Information and Communication Technology (General) | Informatie- en communicatietechnologie (algemeen)Genre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Algebra and coalgebra in computer science.DDC classification: 004.01/51 LOC classification: QA76.9.M35 | C33 2007ebOther classification: TP301. 6-532 | SS 4800 | 510 | DAT 702f | DAT 500f | MAT 110f Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
Includes bibliographical references and index.
Print version record.
Front Matter; Regular and Algebraic Words and Ordinals; Logical Semantics of Types for Concurrency; Deriving Bisimulation Congruences with Borrowed Contexts; Symmetry and Concurrency; Ready to Preorder: Get Your BCCSP Axiomatization for Free!; Impossibility Results for the Equational Theory of Timed CCS; Conceptual Data Modeling with Constraints in Maude; Datatypes in Memory; Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets; Free Modal Algebras: A Coalgebraic Perspective; Coalgebraic Epistemic Update Without Change of Model; The Maude Formal Tool Environment.
Bifinite Chu SpacesStructured Co-spans: An Algebra of Interaction Protocols; Graphical Encoding of a Spatial Logic for the p -Calculus; Higher Dimensional Trees, Algebraically; A Semantic Characterization of Unbounded-Nondeterministic Abstract State Machines; Parametric (Co)Iteration vs. Primitive Direcursion; Bisimulation for Neighbourhood Structures; Algebraic Models of Simultaneous Multithreaded and Multi-core Processors; Quasitoposes, Quasiadhesive Categories and Artin Glueing; Applications of Metric Coinduction; The Goldblatt-Thomason Theorem for Coalgebras.
Specification-Based Testing for CoCasl 's Modal SpecificationsCIRC : A Circular Coinductive Prover; Observing Distributed Computation. A Dynamic-Epistemic Approach; Nabla Algebras and Chu Spaces; An Institutional Version of Gödel's Completeness Theorem; Coalgebraic Foundations of Linear Systems; Bootstrapping Types and Cotypes in HasCASL; Back Matter.
This book constitutes the refereed proceedings of the Second International Conference on Algebra and Coalgebra in Computer Science, CALCO 2007, held in Bergen, Norway in August 2007. The 26 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 57 submissions. Addressing two basic areas of application for algebras and coalgebras - as mathematical objects as well as their application in computer science - the papers cover topics such as abstract models and logics, specialised models and calculi, algebraic and coalgebraic semantics, and system spec.