Titlebook: Coalgebraic Methods in Computer Science; 12th IFIP WG 1.3 In Marcello M. Bonsangue Conference proceedings 2014 IFIP International Federati

脱落

A Coalgebraic View of Characteristic Formulas in Equational Modal Fixed Point Logicsulation preorders. An important problem in this area from the point of view of logic is to find formulas that characterize states in finite transition systems with respect to these various relations. Recent work by Aceto et al. shows how such characterizing formulas in equational modal fixed point l

Monolithic

Coalgebraic Simulations and Congruencesassume that . is a set of monotonic predicate liftings and their proofs are set-theoretical. We give a different definition of simulation, called strong simulation, which has several advantages:.Our notion agrees with that of [.] in the presence of monotonicity, but it has the advantage, that it all

Negotiate

Dijkstra Monads in Monadic Computationby a theorem prover. Here we give a more general description of such Dijkstra monads in a categorical setting. We first elaborate the recently developed view on program semantics in terms of a triangle of computations, state transformers, and predicate transformers. Instantiations of this triangle f

抗体

Categories of Coalgebras with Monadic Homomorphismsributed graphs, with attributes taken from (term) algebras over arbitrary signatures do not fit directly into this kind of transformation approach, since algebras containing function symbols taking two or more arguments do not allow component-wise construction of pushouts. We show how shifting from

ECG769

Lifting Adjunctions to Coalgebras to (Re)Discover Automata Constructions From a categorical perspective this construction is the right adjoint to the inclusion functor from the category of deterministic automata to the category of nondeterministic automata. This is in fact an adjunction between two categories of coalgebras: deterministic automata are coalgebras over . a

Mri485

Canonical Nondeterministic Automatae minimal dfa for . in a locally finite variety ., and apply an equivalence between the finite .-algebras and a category of finite structured sets and relations. By instantiating this to different varieties we recover three well-studied canonical nfas (the átomaton, the jiromaton and the minimal xor

朝圣者

Osteons

没有准备

faction

Dijkstra Monads in Monadic Computationom the state monad transformation applied to ., to the Dijkstra monad associated with .. This monad map is precisely the weakest precondition map in the triangle, given in categorical terms by substitution.