Maggiori informazioni sul libro
The content includes a variety of topics related to logical semantics, concurrency, and algebraic structures. It features invited talks on regular and algebraic words, as well as ordinals, and explores the logical semantics of types within concurrent systems. Key contributions include deriving bisimulation congruences using borrowed contexts, examining symmetry in concurrency, and presenting impossibility results for the equational theory of timed CCS. The annotation highlights conceptual data modeling with constraints in Maude and discusses bisimilarity in open Petri nets. It also addresses free modal algebras from a coalgebraic perspective and explores coalgebraic epistemic updates without changing models. The Maude formal tool environment is presented alongside bifinite Chu spaces and structured co-spans for interaction protocols. Additionally, it covers graphical encodings of spatial logic for the ?-calculus and higher-dimensional trees. A semantic characterization of unbounded-nondeterministic abstract state machines is provided, along with discussions on parametric (co)iteration and bisimulation for neighborhood structures. The work also delves into algebraic models for multithreaded and multi-core processors, quasitoposes, and applications of metric coinduction. Finally, it touches on specification-based testing for CoCasl’s modal specifications and introduces a circular coinductive prover.
Acquisto del libro
Algebra and coalgebra in computer science, Till Mossakowski
- Lingua
- Pubblicato
- 2007
- product-detail.submit-box.info.binding
- (In brossura)
Metodi di pagamento
Ancora nessuna valutazione.