Table of Contents
|
Coalgebraic Methods in Computer Science
Barbara König, Henning Urbat |
Front Matter |
Coalgebraic CTL: Fixpoint Characterization and Polynomial-Time Model Checking
Ryota Kojima, Corina Cîrstea, Koko Muroya, Ichiro Hasuo |
1-22 |
A Categorical Approach to Coalgebraic Fixpoint Logic
Ezra Schoen, Clemens Kupke, Jurriaan Rot, Ruben Turkenburg |
23-43 |
Preorder-Constrained Simulations for Program Refinement with Effects
Koko Muroya, Takahiro Sanada, Natsuki Urabe |
44-64 |
Automata and Coalgebras in Categories of Species
Fosco Loregian |
65-92 |
Automata in W-Toposes, and General Myhill-Nerode Theorems
Victor Iwaniack |
93-113 |
Graded Semantics and Graded Logics for Eilenberg-Moore Coalgebras
Jonas Forster, Lutz Schröder, Paul Wild, Harsh Beohar, Sebastian Gurke, Karla Messing |
114-134 |
Explicit Hopcroft’s Trick in Categorical Partition Refinement
Takahiro Sanada, Ryota Kojima, Yuichi Komorida, Koko Muroya, Ichiro Hasuo |
135-155 |
Proving Behavioural Apartness
Ruben Turkenburg, Harsh Beohar, Clemens Kupke, Jurriaan Rot |
156-173 |
A Compositional Framework for Petri Nets
Serge Lechenne, Clovis Eberhart, Ichiro Hasuo |
174-193 |
Correspondence Between Composite Theories and Distributive Laws
Aloïs Rosset , Maaike Zwart , Helle Hvid Hansen , Jörg Endrullis |
194-216 |
|
Hosted by HAL : 