Bialgebraic Operational Semantics and modal logic

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2007, Pages 336-345

  Klin, Bartek ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BEHAVIOUR MODELS; COALGEBRAIC; COMPOSITIONALITY; CONGRUENCE FORMATS; DISTRIBUTIVE LAWS; GENERAL APPROACH; LOGICAL DECOMPOSITION; LOGICAL EQUIVALENCE; LOGICAL FORMULAS; MODAL LOGIC; OPERATIONAL SEMANTICS; PROCESS EQUIVALENCE; SPECIFIC LANGUAGES; STRUCTURAL OPERATIONAL SEMANTICS;

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; FORMAL LOGIC; SEMANTICS; SYNTACTICS;

SYSTEMS ENGINEERING;

EID: 47249154687     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2007.13     Document Type: Conference Paper

References (30)

1. L. Aceto, W. J. Fokkink, and C. Verhoef. Structural operational semantics. In J. A. Bergstra, A. Ponse, and S. Smolka, editors, Handbook of Process Algebra, pages 197-292. Elsevier, 2002.
2. J. Adámek, H. Herrlich, and G. E. Strecker. Abstract and Concrete Categories. Wiley-Interscience, 1990.
3. H. R. Andersen, C. Stirling, and G. Winskel. A compositional proof system for the modal μ-calculus. In Procs. LICS'94, pages 144-153. IEEE Computer Society Press, 1994.
4. F. Bartels. On Generalised Coinduction and Probabilistic Specification Formats. PhD dissertation, CWI, Amsterdam, 2004.
5. J. A. Bergstra, A. Ponse, and S. Smolka. Handbook of Process Algebra. Elsevier, 2002.
6. B. Bloom, W. J. Fokkink, and R. J. van Glabbeek. Precongruence formats for decorated trace semantics. ACM Transactions on Computational Logic, 5:26-78, 2004.
7. B. Bloom, S. Istrail, and A. Meyer. Bisimulation can't be traced. Journal of the ACM, 42:232-268, 1995.
8. L. Caires and L. Cardelli. A spatial logic for concurrency (part I). Information and Computation, 186:194-235, 2003.
9. M. Fiore and S. Staton. A congruence rule format for name-passing process calculi from mathematical structural operational semantics. In Proc. LICS'06, pages 49-58. IEEE Computer Society Press, 2006. (Pubitemid 47130351)
10. M. P. Fiore and D. Turi. Semantics of name and value passing. In Proc. LICS'01, pages 93-104. IEEE Computer Society Press, 2001. (Pubitemid 32795621)
11. W. J. Fokkink, R. J. van Glabbeek, and P. de Wind. Compositionality of Hennessy-Milner logic through structural operational semantics. In Proc. FCT'03, volume 2751 of LNCS, pages 412-422. Springer, 2003. (Pubitemid 137636663)
12. R. J. v. Glabbeek. The linear time - branching time spectrum I. In J. A. Bergstra, A. Ponse, and S. Smolka, editors, Handbook of Process Algebra. Elsevier, 1999.
13. J. A. Goguen, J. W. Thatcher, et al. Initial algebra semantics and continuous algebras. Journal of the ACM, 24:68-95, 1977.
14. J. F. Groote, M. Mousavi, and M. A. Reniers. A hierarchy of SOS rule formats. In Proc. SOS'05, 2005, pages 3-25. Elsevier, 2005. (Pubitemid 43668752)
15. M. Hennessy and R. Milner. Algebraic laws for nondeter-minism and concurrency. Journal of the ACM, 32:137-161, 1985.
16. M. Kick. Rule formats for timed processes. In Proc. CMCIM'02, volume 68 of ENTCS, pages 12-31. Elsevier, 2002.
17. B. Klin. From bialgebraic semantics to congruence formats. In Proc. SOS 2004, volume 128 of ENTCS, pages 3-37. Elsevier, 2005. (Pubitemid 40573871)
18. B. Klin. Bialgebraic methods in structural operational semantics. In Proc. SOS 2006, ENTCS, 2007. To appear.
19. B. Klin. Coalgebraic modal logic beyond sets. In Proc. MFPS 2007, volume 173 of ENTCS, pages 177-201, 2007. (Pubitemid 46367801)
20. B. Klin and P. Sobocinski. Syntactic formats for free: An abstract approach to process equivalence. In Proc. CONCUR 2003, volume 2761 of LNCS, pages 72-86. Springer, 2003. (Pubitemid 137630510)
21. A. Kurz. Coalgebras and their logics. ACM SIGACT News, 37, 2006.
22. S. Mac Lane. Categories for the Working Mathematician. Springer, second edition, 1998.
23. R. Milner. Communication and Concurrency. Prentice Hall, 1988.
24. D. Pavlovic, M. Mislove, and J. B. Worrell. Testing semantics: connecting processes and process logics. In Proc. AMAST'05, volume 4019 of LNCS, pages 308-322. Springer, 2005. (Pubitemid 44072102)
25. G. D. Plotkin. A structural approach to operational semantics. DAIMI Report FN-19, Computer Science Department, Aarhus University, 1981.
26. J. J. M. M. Rutten. Universal coalgebra: a theory of systems. Theoretical Computer Science, 249:3-80, 2000.
27. L. Schröder. Expressivity of coalgebraic modal logic: the limits and beyond. In Proc. FOSSACS'05, volume 3441 of LNCS, pages 470-484, 2005.
28. A. Simpson. Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS. Journal of Logic and Algebraic Programming, 60-61:287-322, 2004.
29. D. Turi. Categorical modeling of structural operational rules: case studies. In Proc. CTCS'97, volume 1290 of LNCS, pages 127-146. Springer, 1997. (Pubitemid 127118705)
30. D. Turi and G. D. Plotkin. Towards a mathematical operational semantics. In Proc. LICS'97, pages 280-291. IEEE Computer Society Press, 1997.