Coalgebraic Modelling : Applications in Automata theory and Modal logic

191

[1]  George H. Mealy,et al.  A method for synthesizing sequential circuits , 1955 .

[2]  Edward F. Moore,et al.  Gedanken-Experiments on Sequential Machines , 1956 .

[3]  George N. Raney,et al.  Sequential Functions , 1958, JACM.

[4]  Robert McNaughton,et al.  Regular Expressions and State Graphs for Automata , 1960, IRE Trans. Electron. Comput..

[5]  G. N. Raney.  Functional composition patterns and power series reversion , 1960 .

[6]  Gene Ott,et al.  Design of Sequential Machines from Their Regular Expressions , 1961, JACM.

[7]  Janusz A. Brzozowski,et al.  Derivatives of Regular Expressions , 1964, JACM.

[8]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[9]  J. Lambek.  A fixpoint theorem for complete categories , 1968 .

[10]  J. R. Büchi,et al.  Solving sequential conditions by finite-state strategies , 1969 .

[11]  Dana S. Scott,et al.  Advice on Modal Logic , 1970 .

[12]  John E. Hopcroft,et al.  An n log n algorithm for minimizing states in a finite automaton , 1971 .

[13]  S. Lane.  Categories for the Working Mathematician , 1971 .

[14]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[15]  G. N. Raney.  On continued fractions and finite automata , 1973 .

[16]  N. Koblitz.  p-adic Numbers, p-adic Analysis, and Zeta-Functions , 1977 .

[17]  J.F.A.K. van Benthem,et al.  Modal Correspondence Theory , 1977 .

[18]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[19]  Christian Choffrut,et al.  A Generalization of Ginsburg and Rose's Characterization of G-S-M Mappings , 1979, ICALP.

[20]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[21]  Brian F. Chellas.  Modal Logic: Normal systems of modal logic , 1980 .

[22]  Jörg Flum,et al.  Topological Model Theory , 1980 .

[23]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[24]  Jirí Adámek,et al.  Theory of Mathematical Structures , 1983 .

[25]  Amir Pnueli,et al.  On the Development of Reactive Systems , 1989, Logics and Models of Concurrent Systems.

[26]  Moshe Y. Vardi.  On Epistemic Logic and Logical Omniscience , 1986, TARK.

[27]  Gérard Berry,et al.  From Regular Expressions to Deterministic Automata , 1986, Theor. Comput. Sci..

[28]  S. Safra,et al.  On the complexity of omega -automata , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[29]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[30]  Peter Aczel,et al.  A Final Coalgebra Theorem , 1989, Category Theory and Computer Science.

[31]  Kosta Dosen,et al.  Duality between modal algebras and neighbourhood frames , 1989, Stud Logica.

[32]  Christophe Reutenauer,et al.  Subsequential Functions: Characterizations, Minimization, Examples , 1990, International Meeting of Young Computer Scientists.

[33]  J. Adámek,et al.  Automata and Algebras in Categories , 1990 .

[34]  Edward A. Feigenbaum,et al.  Switching and Finite Automata Theory: Computer Science Series , 1990 .

[35]  Jirí Adámek,et al.  Abstract and Concrete Categories - The Joy of Cats , 1990 .

[36]  Lou Goble.  Murder most gentle: The paradox deepens , 1991 .

[37]  Christophe Reutenauer,et al.  Minimization of Rational Word Functions , 1991, SIAM J. Comput..

[38]  Fernando Q. Gouvêa,et al.  P-Adic Numbers: An Introduction , 1993 .

[39]  Michael Barr,et al.  Terminal Coalgebras in Well-Founded Set Theory , 1993, Theor. Comput. Sci..

[40]  Jean Vuillemin,et al.  On Circuits and Numbers , 1994, IEEE Trans. Computers.

[41]  maarten marx.  Algebraic Relativization and Arrow Logic , 1995 .

[42]  Johan van Benthem,et al.  Back and Forth Between Modal Logic and Classical Logic , 1995, Log. J. IGPL.

[43]  Peter Tiño,et al.  Learning and Extracting Initial Mealy Automata with a Modular Neural Network Model , 1995, Neural Comput..

[44]  Bart Jacobs,et al.  Objects and Classes, Co-Algebraically , 1995, Object Orientation with Parallelism and Persistence.

[45]  Moshe Y. Vardi.  An Automata-Theoretic Approach to Fair Realizability and Synthesis , 1995, CAV.

[46]  Valentin M. Antimirov.  Partial Derivatives of Regular Expressions and Finite Automaton Constructions , 1996, Theor. Comput. Sci..

[47]  Moshe Y. Vardi.  Why is Modal Logic So Robustly Decidable? , 1996, Descriptive Complexity and Finite Models.

[48]  Dexter Kozen,et al.  Automata and Computability , 1997, Undergraduate Texts in Computer Science.

[49]  Mehryar Mohri,et al.  Finite-State Transducers in Language and Speech Processing , 1997, CL.

[50]  Jan J. M. M. Rutten.  Relators and Metric Bisimulations , 1998, CMCS.

[51]  Jan J. M. M. Rutten,et al.  Automata and Coinduction (An Exercise in Coalgebra) , 1998, CONCUR.

[52]  Jan Rutten,et al.  On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces , 1998, Mathematical Structures in Computer Science.

[53]  Johan van Benthem,et al.  Modal Languages and Bounded Fragments of Predicate Logic , 1998, J. Philos. Log..

[54]  Roman R. Redziejowski.  Construction of a deterministic -automaton using derivatives , 1999, RAIRO Theor. Informatics Appl..

[55]  Jan J. M. M. Rutten,et al.  A note on coinduction and weak bisimilarity for while programs , 1998, RAIRO Theor. Informatics Appl..

[56]  Tarmo Uustalu,et al.  Primitive (Co)Recursion and Course-of-Value (Co)Iteration, Categorically , 1999, Informatica.

[57]  Véronique Bruyère,et al.  A Proof of Choffrut's Theorem on Subsequential Functions , 1999, Theor. Comput. Sci..

[58]  Erik P. de Vink,et al.  Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach , 1999, Theor. Comput. Sci..

[59]  Judit X. Madarász,et al.  Interpolation and Amalgamation; Pushing the Limits. Part II , 1999, Stud Logica.

[60]  Marcus Kracht,et al.  Normal monomodal logics can simulate all others , 1999, Journal of Symbolic Logic.

[61]  Johan van Benthem,et al.  Information Transfer across Chu Spaces , 2000, Log. J. IGPL.

[62]  Winfried Lamersdorf,et al.  Genetic algorithms for automated negotiations: a FSM-based application approach , 2000, Proceedings 11th International Workshop on Database and Expert Systems Applications.

[63]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[64]  Olivier Carton,et al.  Computing the prefix of an automaton , 2000, RAIRO Theor. Informatics Appl..

[65]  Marc Pauly,et al.  Logic for social software , 2000 .

[66]  Robert K. Brayton,et al.  Sequential synthesis using S1S , 2000, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[67]  Jeffrey D. Ullman,et al.  Introduction to automata theory, languages, and computation, 2nd edition , 2001, SIGA.

[68]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[69]  Bart Jacobs,et al.  Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study , 2001, RAIRO Theor. Informatics Appl..

[70]  H. Gumm.  Functors for Coalgebras , 2001 .

[71]  Timo Knuutila,et al.  Re-describing an algorithm by Hopcroft , 2001, Theor. Comput. Sci..

[72]  Luís Soares Barbosa,et al.  Components as coalgebras , 2001 .

[73]  Thomas A. Henzinger,et al.  Synthesis of Uninitialized Systems , 2002, ICALP.

[74]  Marc Pauly,et al.  A Modal Logic for Coalitional Power in Games , 2002, J. Log. Comput..

[75]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 2002, JACM.

[76]  Olivier Carton,et al.  Determinization of transducers over finite and infinite words , 2002, Theor. Comput. Sci..

[77]  Djelloul Ziadi,et al.  Canonical derivatives, partial derivatives and finite automaton constructions , 2002, Theor. Comput. Sci..

[78]  Dragan Masulovic,et al.  Towards Weak Bisimulation For Coalgebras , 2002, Electron. Notes Theor. Comput. Sci..

[79]  Farhad Arbab,et al.  A Coinductive Calculus of Component Connectors , 2002, WADT.

[80]  Dirk Pattinson,et al.  An Introduction to the Theory of Coalgebras , 2003 .

[81]  Jan J. M. M. Rutten,et al.  Behavioural differential equations: a coinductive calculus of streams, automata, and power series , 2003, Theor. Comput. Sci..

[82]  Dirk Pattinson,et al.  Coalgebraic modal logic: soundness, completeness and decidability of local consequence , 2003, Theor. Comput. Sci..

[83]  Helle Hvid Hansen,et al.  Monotonic modal logics , 2003 .

[84]  Jean Vuillemin,et al.  Digital Algebra and Circuits , 2003, Verification: Theory and Practice.

[85]  Peyton Jones,et al.  Haskell 98 language and libraries : the revised report , 2003 .

[86]  Christian Choffrut,et al.  Minimizing subsequential transducers: a survey , 2003, Theor. Comput. Sci..

[87]  D. Pattinson.  Expressive Logics for Coalgebras via Terminal Sequence Induction , 2004, Notre Dame J. Formal Log..

[88]  Erik P. de Vink,et al.  A hierarchy of probabilistic system types , 2003, CMCS.

[89]  Yde Venema,et al.  Stone coalgebras , 2004, Theor. Comput. Sci..

[90]  Alexander Kurz,et al.  Algebraic Semantics for Coalgebraic Logics , 2004, CMCS.

[91]  Jirí Adámek,et al.  On tree coalgebras and coalgebra presentations , 2004, Theor. Comput. Sci..

[92]  Randy H. Katz,et al.  Contemporary Logic Design , 2004 .

[93]  Helle Hvid Hansen,et al.  A Coalgebraic Perspective on Monotone Modal Logic , 2004, CMCS.

[94]  Joao Marques-Silva,et al.  Efficient Algorithms for the Inference of Minimum Size DFAs , 2001, Machine Learning.

[95]  David Gries,et al.  Describing an algorithm by Hopcroft , 1973, Acta Informatica.

[96]  Ichiro Hasuo,et al.  Context-Free Languages via Coalgebraic Trace Semantics , 2005, CALCO.

[97]  H. Peter Gumm,et al.  Types and coalgebraic structure , 2005 .

[98]  Alexander Kurz,et al.  Ultrafilter Extensions for Coalgebras , 2005, CALCO.

[99]  Jan J. M. M. Rutten,et al.  A coinductive calculus of streams , 2005, Mathematical Structures in Computer Science.

[100]  James Worrell,et al.  On the final sequence of a finitary set functor , 2005, Theor. Comput. Sci..

[101]  Wolter Pieters,et al.  Provable anonymity , 2005, FMSE '05.

[102]  D. Gabbay,et al.  Interpolation and Definability: Modal and Intuitionistic Logic , 2005 .

[103]  Erika Ábrahám,et al.  An Assertional Proof System for Multithreaded Java - Theory and Tool Support , 2005 .

[104]  Jan J. M. M. Rutten,et al.  Synthesis of Mealy Machines Using Derivatives , 2006, CMCS.

[105]  Sun Meng,et al.  Components as coalgebras: The refinement dimension , 2006, Theor. Comput. Sci..

[106]  Martin Otto,et al.  Bisimulation invariance and finite models , 2006 .

[107]  Cjf Cas Cremers.  Scyther : semantics and verification of security protocols , 2006 .

[108]  Marcello M. Bonsangue,et al.  Presenting Functors by Operations and Equations , 2006, FoSSaCS.

[109]  Yde Venema.  Automata and fixed point logic: A coalgebraic perspective , 2006, Inf. Comput..

[110]  Alexander Kurz,et al.  Coalgebras and their logics , 2006, SIGA.

[111]  Dirk Pattinson,et al.  PSPACE Bounds for Rank-1 Modal Logics , 2006, LICS.

[112]  Orna Kupferman,et al.  Safraless Compositional Synthesis , 2006, CAV.

[113]  Clemens Kupke,et al.  Finitary coalgebraic logics , 2006 .

[114]  Bart Jacobs,et al.  A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages , 2006, Essays Dedicated to Joseph A. Goguen.

[115]  Ichiro Hasuo,et al.  Probabilistic anonymity via coalgebraic simulations , 2007, Theor. Comput. Sci..

[116]  Clemens Kupke,et al.  Terminal Sequence Induction via Games , 2009, TbiLLC.

[117]  Dirk Pattinson,et al.  Rank-1 Modal Logics Are Coalgebraic , 2007, STACS.

[118]  Corina Cîrstea,et al.  Modular construction of complete coalgebraic logics , 2007, Theor. Comput. Sci..

[119]  Ana Sokolova,et al.  Generic Trace Semantics via Coinduction , 2007, Log. Methods Comput. Sci..

[120]  Alexander Kurz,et al.  The Goldblatt-Thomason Theorem for Coalgebras , 2007, CALCO.

[121]  Yde Venema,et al.  Algebras and coalgebras , 2007, Handbook of Modal Logic.

[122]  Moshe Y. Vardi.  Automata-theoretic techniques for temporal reasoning , 2007, Handbook of Modal Logic.

[123]  J. Rutten.  Coalgebraic Foundations of Linear Systems , 2007, CALCO.

[124]  Helle Hvid Hansen,et al.  Bisimulation for Neighbourhood Structures , 2007, CALCO.

[125]  Christel Baier,et al.  Principles of model checking , 2008 .

[126]  Serge Grigorieff,et al.  Duality and Equational Theory of Regular Languages , 2008, ICALP.

[127]  M. G. van der Horst,et al.  Scalable block processing algorithms , 2008 .

[128]  Yde Venema,et al.  Coalgebraic Automata Theory: Basic Results , 2008, Log. Methods Comput. Sci..

[129]  H. Peter Gumm,et al.  On Minimal Coalgebras , 2008, Appl. Categorical Struct..

[130]  Ana Sokolova,et al.  The microcosm principle and concurrency in coalgebras , 2008 .

[131]  Helle Hvid Hansen,et al.  Coalgebraising Subsequential Transducers , 2008, CMCS.

[132]  Guido Governatori,et al.  Knowledge Assessment: A Modal Logic Approach , 2008, PRIMA.

[133]  Lutz Schröder,et al.  Expressivity of coalgebraic modal logic: The limits and beyond , 2008, Theor. Comput. Sci..

[134]  César Sánchez,et al.  The Reaction Algebra: A Formal Language for Event Correlation , 2008, Pillars of Computer Science.

[135]  Alexandra Silva,et al.  Coalgebraic Logic and Synthesis of Mealy Machines , 2008, FoSSaCS.

[136]  Mehryar Mohri,et al.  Speech Recognition with Weighted Finite-State Transducers , 2008 .

[137]  Helle Hvid Hansen,et al.  Neighbourhood Structures: Bisimilarity and Basic Model Theory , 2009, Log. Methods Comput. Sci..

[138]  Alexandra Silva,et al.  An Algebra for Kripke Polynomial Coalgebras , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[139]  Dmitry Sustretov,et al.  Modal languages for topology: Expressivity and definability , 2006, Ann. Pure Appl. Log..

[140]  Niraj K. Jha,et al.  Switching and Finite Automata Theory: Frontmatter , 2009 .