Coalgebraic Methods in Computer Science

In this paper we present a coinductive definition of context free power series in terms of behavioural differential equations. We show that our coalgebraic approach provides a unified view on many, at first sight different, existing notions of algebraicity, and we apply our behavioural differential equations to produce a new proof for a classical result by Chomsky and Schützenberger, and a simple proof that the zipoperator of two algebraic streams is algebraic.

[1]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[2]  Carroll Morgan,et al.  Characterising Testing Preorders for Finite Probabilistic Processes , 2007, LICS.

[3]  Srini Ramaswamy,et al.  Actor-Network Procedures , 2012 .

[4]  Robin Milner,et al.  A Finite Delay Operator in Synchronous CCS. , 1982 .

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

[6]  Edward A. Lee,et al.  Labelled Execution Systems , 2012 .

[7]  Lijun Zhang,et al.  Probabilistic Logical Characterization , 2011, Inf. Comput..

[8]  Dusko Pavlovic,et al.  Deriving Secrecy in Key Establishment Protocols , 2006, ESORICS.

[9]  Amir Pnueli.  The Temporal Semantics of Concurrent Programs , 1981, Theor. Comput. Sci..

[10]  Gordon D. Plotkin,et al.  The origins of structural operational semantics , 2004, J. Log. Algebraic Methods Program..

[11]  Christian Kissig,et al.  Generic Trace Logics , 2011, ArXiv.

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

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

[14]  Nancy A. Lynch,et al.  Probabilistic Simulations for Probabilistic Processes , 1994, Nord. J. Comput..

[15]  Roberto Segala,et al.  Logical Characterizations of Bisimulations for Discrete Probabilistic Systems , 2007, FoSSaCS.

[16]  James Worrell,et al.  Testing Semantics: Connecting Processes and Process Logics , 2006, AMAST.

[17]  Alexandra Silva,et al.  Generalizing the powerset construction, coalgebraically , 2010, FSTTCS.

[18]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[19]  David Michael Ritchie Park,et al.  On the Semantics of Fair Parallelism , 1979, Abstract Software Specifications.

[20]  Leslie Lamport,et al.  "Sometime" is sometimes "not never": on the temporal logic of programs , 1980, POPL '80.

[21]  Robin Milner,et al.  Synthesis of Communicating Behaviour , 1978, MFCS.

[22]  Ernst-Erich Doberkat,et al.  Eilenberg-Moore algebras for stochastic relations , 2006, Inf. Comput..

[23]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[24]  A. Sokolova,et al.  Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems , 2011, MFPS.

[25]  M. Barr,et al.  Toposes, Triples and Theories , 1984 .

[26]  Alexandra Silva,et al.  Sound and Complete Axiomatizations of Coalgebraic Language Equivalence , 2011, TOCL.

[27]  P. T. Johnstone,et al.  Adjoint Lifting Theorems for Categories of Algebras , 1975 .

[28]  Bart Jacobs.  Coalgebraic Walks, in Quantum and Turing Computation , 2011, FoSSaCS.

[29]  Vaughan R. Pratt,et al.  Modeling concurrency with partial orders , 1986, International Journal of Parallel Programming.

[30]  Vaughan R. Pratt,et al.  Process logic: preliminary report , 1979, POPL.

[31]  Bart Jacobs,et al.  Scalars, Monads, and Categories , 2010, Quantum Physics and Linguistics.

[32]  Silvia Crafa,et al.  A Spectrum of Behavioral Relations over LTSs on Probability Distributions , 2011, CONCUR.

[33]  Alexander Kurz,et al.  On coalgebras over algebras , 2011, Theor. Comput. Sci..

[34]  Michele Boreale,et al.  Weighted Bisimulation in Linear Algebraic Form , 2009, CONCUR.

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

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

[37]  Corina C rstea.  Maximal Traces and Path-Based Coalgebraic Temporal Logics , 2011 .

[38]  Sally Popkorn,et al.  A Handbook of Categorical Algebra , 2009 .

[39]  V. E. Cazanescu.  Algebraic theories , 2004 .

[40]  Doina Precup,et al.  Equivalence Relations in Fully and Partially Observable Markov Decision Processes , 2009, IJCAI.

[41]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..