Dirk Pattinson: Publications

Recent Drafts

1. A. Edalat and D. Pattinson. Domain Theoretic Solutions of Initial Value Problems for Unboundede Vector Fields (long version .ps short version .ps), last revised Feb 20, 2005.
2. A. Edalat and D. Pattinson. A domain theoretic account of Euler's method for Solving Initial Value Problems (.ps), last revised Oct 19, 2004.
3. C. Cirstea and D. Pattinson. Modular Construction of Modal Logics. Long version (.ps.gz, last revised April 30, 2004), short version (.ps.gz).

Book Edited

1. M. Wirsing, D. Pattinson, R. Hennicker (eds.).
   Recent Trends in Algebraic Develpment Techniques, Volume 2755 of Lecture Notes in Computer Science, Springer 2003.

Journal Articles

1. D. Pattinson. Expressive Logics for Coalgebras via Terminal Sequence Induction.
   Notre Dame Journal of Formal Logic, 45(1):19-33, 2004. (Preprint)
2. D. Pattinson. Coalgebraic Modal Logic: Soundness, Completeness and Decidability of Local Consequence.
   Theoretical Computer Science 309(1-3):177-193, 2003. (Preprint)
3. A. Kurz, D. Pattinson. Coalgebraic Modal Logic of Finite Rank.
   Mathematical Structures in Computer Science, to appear.
4. D. Pattinson, M. Wirsing. A Coordination Approach to Mobile Components.
   Theoretical Computer Science, to appear. (Preprint)

Conference and Workshop Proceedings

1. D. Pattinson and B. Reus. A Complete Temporal and Spatial Logic for Distributed Systems.
   In B. Gramlich, editor, Proc. Frocos 2005, Springer LNCS 3117, pages 122-137, 2005. (.ps)
2. C. Kupke, A. Kurz and D. Pattinson. Ultrafilter Extensions for Coalgebras.
   In Proc. CALCO 2005. Springer LNCS, to appear.
3. A. Edalat and D. Pattinson. Inverse and Implicit Functions in Domain Theory.
   In Proc. LICS 2005, IEEE Press, to appear.
4. A. Edalat and D. Pattinson. Domain Theoretic Solutions of Initial Value Problems for Unbounded Vector Fields,
   In Proc. MFPS 2005, Electronic Notes in Theoretical Computer Science, to appear.
5. D. Pattinson. Domain-Theoretic Formulation of Linear Boundary Value Problems.
   In Proc. CiE 2005. Springer LNCS, to appear. (invited paper) (.ps.gz)
6. A. Edalat, A. Lieutier and D. Pattinson. A Computational Model for Multi-Variable Differential Caclulus.
   In V.Sassone, Ed., Proc. FoSSaCS 2005. Springer LNCS 3441, pages 505-519.
7. C. Cirstea and D. Pattinson. Modular Constructions of Modal Logics.
   In P. Gardner and N. Yoshida, editors, Proc. CONCUR 2004, Springer LNCS 3170, pages 258-275. (.ps.gz)
8. D. Pattinson. Euler's Theorem in Domain Theory. Proc PARA 2004, Springer LNCS, to appear. (.ps.gz)
9. C. Kupke, A. Kurz and D. Pattinson. Algebraic Semantics for Coalgebraic Logics.
   In J. Adamek, editor, Proc. CMCS 2004, Electronic Notes in Theoretical Computer Science, to appear.
10. A. Edalat and D. Pattinson. A Domain-Theoretic Account of Picard's Theorem. In J. Barcelona and D. Sanella, editors,
    Proc. ICALP 2004, Springer LNCS, to appear. (.ps.gz)
11. A. Edalat, D. Pattinson. Initial Value Problems in Domain Theory.
    In V. Brattka, M. Schröder, K. Weihrauch, N. Zhong, editors
    Proc. International Conference on Computability and Complexity in Analysis (CCA 2003). Volume 302 of Informatik Berichte, Fernuni Hagen, pages 211-227. (ps.gz)
12. D. Pattinson, M. Wirsing. Making Components Move: A Separation of Concerns Approach.
    Proc. First International Symposium on Formal Methods for Components and Objects (FMCO 2002) (ps.gz, © Springer Verlag)
13. D. Pattinson. Computable Functions on Final Coalgebras.
    In H.-Peter Gumm, editor, Coalgebraic Methods in Computer Science (CMCS 2003).
    Volume 82 of Coalgebraic Methods in Computer Science (CMCS 2003) (ps.gz).
14. D. Pattinson. Translating Logics for Coalgebras.
    Proceedings of the 16th International Workshop on Algebraic Developement Techniques (WADT 2002),
    Springer LNCS, to appear (ps.gz, © Springer Verlag)
15. A. Kurz and D. Pattinson. Definability, Canonical Models, Compactness for Finitary Coalgebraic Modal Logic.
    In L. Moss, editor, Coalgebraic Methods in Computer Science (CMCS 2002).
    Volume 65.1 of of Electronic Notes in Theoretical Computer Science (ps.gz).
16. D. Pattinson. Modal Logic for Coalgebras in a Topological Setting.
    Volume 33 of Electronic Notes in Theoretical Computer Science, 2001 (ps.gz).
17. D. Pattinson. Modal Logic for Rewriting Theories.
    In K. Futatsugi, editor, The 3rd International Workshop on Rewriting Logic and its Applications.
    Volume 36 of Electronic Notes in Theoretical Computer Science, 2000. (ps.gz).
18. D. Pattinson. Semantical Principles in the Modal Logic of Coalgebras.
    Procedings of the 18th international Symposium on Theoretical Aspects of Computer Science (STACS 2001),
    Volume 2010 of Springer LNCS, 2001. (ps.gz, © Springer Verlag).
19. D. Pattinson. Coalgebraic Model Theory of Rewriting Logic.
    Contribution to the workshop "Specification and Verification: Mind the Gap".
    To appear in FAST Reihe Softwaretechnik.
    Superseded by "Modal Logic for Rewriting Theories", see below.
20. D. Pattinson, A. Kurz. Notes on Coalgebras, Cofibrations and Concurrency.
    In H. Reichel, editor, Coalgebraic Methods in Computer Science (CMCS 2000).
    Volume 33 of Electronic Notes in Theoretical Computer Science, 2000 (ps.gz).

Abstracts

1. D. Pattinson, A. Kurz. Translating Logics for Coalgebras. Extended abstract of the above paper. (ps.gz).
2. D. Pattinson. A coalgebraic approach to operational object semantics.
   In 10th Nordic Workshop on Programming Theory, TUCS General Publications No 11, October 1998. (ps.gz).

Lecture Notes

1. D. Pattinson. An Introduction to the Theory of Coalgebras.
   Notes accompanying the a course at NASSLLI 2003 (ps.gz).
   Transparencies: Slides 1 (.ps.gz), Slides 2 (.ps.gz), Slides 3 (.ps.gz), Slides 4 (.ps.gz), Slides 5 (.ps.gz).

Technical Reports and Drafts

1. D. Pattinson. Expressive Logics for Coalgebras via Terminal Sequence Induction.
   Technical Report, LMU München (ps.gz).
2. D. Pattinson. Coalgebraic Modal Logic: Soundness, Completeness and Decidability.
   Technical Report, LMU München (ps.gz). A revised version will appear in Theoretical Computer Science.
3. D. Pattinson. Semantical Principles in the Modal Logic of Coalgebras.
   Extended version of the STACS paper above. Technical Report, LMU München (ps.gz).
4. A. Kurz, D. Pattinson. Coalgebras and Modal Logic for Parameterised Endofunctors.
   Technical Report, CWI, Amsterdam, December 2000. (ps.gz).
5. D. Pattinson. Coalgebraic Techniques in Model Checking.
   Draft, July 2001. (ps.gz).
6. D. Pattinson. Fibrational Classification of Positive Horn Logic.
   Draft (ps.gz).

Thesis

1. D. Pattinson. Expressivity Results in the Modal Logic of Coalgebras.
   PhD thesis, LMU München, June 2001. (ps.gz).