References

  1. L. Aceto, A. Ingólfsdóttir & J. Sack (2009): Characteristic Formulae for Fixed-Point Semantics: A General Framework. In: Proceedings 16th International Workshop on Expressiveness in Concurrency, EXPRESS 2009, Electronic Proceedings in Theoretical Computer Science 8, pp. 1–15, doi:10.4204/EPTCS.8.1.
  2. P. Baldan & S. Crafa (2010): A Logic for True Concurrency. In: Proceedings of 21st International Conference on Concurrency Theory, CONCUR 2010, Lecture Notes in Computer Science 6269. Springer-Verlag, pp. 147–161, doi:10.1007/978-3-642-15375-4_11.
  3. M.A. Bednarczyk (1991): Hereditary history preserving bisimulations or what is the power of the future perfect in program logics. Technical Report. Institute of Computer Science, Polish Academy of Sciences, Gdańsk.
  4. G. Boudol & I. Castellani (1987): On the semantics of concurrency: partial orders and transition systems. In: Proceedings of TAPSOFT'87, Lecture Notes in Computer Science 249. Springer-Verlag, pp. 123–137, doi:10.1007/3-540-17660-8_52.
  5. F. Cherief (1992): Back and forth bisimulations on prime event structures. In: Proceedings of PARLE '92, Lecture Notes in Computer Science 605. Springer-Verlag, pp. 843–858, doi:10.1007/3-540-55599-4_128.
  6. R. De Nicola, U. Montanari & F. Vaandrager (1990): Back and forth bisimulations. In: Proceedings of CONCUR '90, Theories of Concurrency: Unification and Extension, Lecture Notes in Computer Science 458. Springer-Verlag, pp. 152–165, doi:10.1007/BFb0039058.
  7. R. De Nicola & F. Vaandrager (1990): Three Logics for Branching Bisimulation (Extended Abstract). In: Proceedings, Fifth Annual IEEE Symposium on Logic in Computer Science. IEEE, Computer Society Press, pp. 118–129.
  8. P. Degano, R. De Nicola & U. Montanari (1987): Observational equivalences for concurrency models. In: M. Wirsing: Formal Descriptions of Programming Concepts – III, Proceedings of the 3rd IFIP WG 2.2 Conference. North-Holland, pp. 105–129.
  9. S.B. Fröschle (1999): Decidability of Plain and Hereditary History-Preserving Bisimilarity for BPP. In: Proceedings of Express'99, Electronic Notes in Theoretical Computer Science 27. Elsevier, doi:10.1016/S1571-0661(05)80297-X.
  10. S.B. Fröschle (2005): Composition and Decomposition in True-Concurrency. In: Foundations of Software Science and Computational Structures, 8th International Conference, FOSSACS 2005, Lecture Notes in Computer Science 3441. Springer-Verlag, pp. 333–347, doi:10.1007/978-3-540-31982-5_21.
  11. S.B. Fröschle & S. Lasota (2005): Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP. In: CONCUR 2005, Lecture Notes in Computer Science 3653. Springer-Verlag, pp. 263–277, doi:10.1007/11539452_22.
  12. R.J. van Glabbeek & U. Goltz (2001): Refinement of actions and equivalence notions for concurrent systems. Acta Informatica 37(4/5), pp. 229–327, doi:10.1007/s002360000041.
  13. R.J. van Glabbeek & G.D. Plotkin (1995): Configuration structures. In: Proceedings of 10th Annual IEEE Symposium on Logic in Computer Science, LICS 1995. IEEE Computer Society Press, pp. 199–209, doi:10.1109/LICS.1995.523257.
  14. R.J. van Glabbeek & G.D. Plotkin (2009): Configuration structures, event structures and Petri nets. Theoretical Computer Science 410(41), pp. 4111–4159, doi:10.1016/j.tcs.2009.06.014.
  15. U. Goltz, R. Kuiper & W. Penczek (1992): Propositional temporal logics and equivalences. In: Proceedings of 3rd International Conference on Concurrency Theory, CONCUR 1992, Lecture Notes in Computer Science 630. Springer-Verlag, pp. 222–236, doi:10.1007/BFb0084794.
  16. S. Graf & J. Sifakis (1986): A Modal Characterization of Observational Congruence on Finite Terms of CCS. Information and Control 68(1-3), pp. 125–145, doi:10.1016/S0019-9958(86)80031-6.
  17. J. Gutierrez (2009): Logics and Bisimulation Games for Concurrency, Causality and Conflict. In: Proceedings of the 12th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 09, Lecture Notes in Computer Science 5504. Springer-Verlag, pp. 48–62, doi:10.1007/978-3-642-00596-1_5.
  18. J. Gutierrez & J.C. Bradfield (2009): Model-Checking Games for Fixpoint Logics with Partial Order Models. In: Proceedings of the 20th International Conference on Concurrency Theory, CONCUR 2009, Lecture Notes in Computer Science 5710. Springer-Verlag, pp. 354–368, doi:10.1007/978-3-642-04081-8_24.
  19. M.C.B. Hennessy & R. Milner (1985): Algebraic laws for nondeterminism and concurrency. Journal of the Association for Computing Machinery 32(1), pp. 137–161, doi:10.1145/2455.2460.
  20. M.C.B. Hennessy & C. Stirling (1985): The power of the future perfect in program logics. Infomation and Control 67, pp. 23–52, doi:10.1016/S0019-9958(85)80025-5.
  21. A. Joyal, M. Nielsen & G. Winskel (1996): Bisimulation from Open Maps. Information and Computation 127(2), pp. 164–185, doi:10.1006/inco.1996.0057.
  22. M. Jurdzinski, M. Nielsen & J. Srba (2003): Undecidability of domino games and hhp-bisimilarity. Information and Computation 184(2), pp. 343–368, doi:10.1016/S0890-5401(03)00064-6.
  23. F. Laroussinie, S. Pinchinat & Ph. Schnoebelen (1995): Translations between modal logics of reactive systems. Theoretical Computer Science 140(1), pp. 53–71, doi:10.1016/0304-3975(94)00204-V.
  24. F. Laroussinie & Ph. Schnoebelen (1995): A hierarchy of temporal logics with past. Theoretical Computer Science 148, pp. 303–324, doi:10.1016/0304-3975(95)00035-U.
  25. M. Mukund & P.S. Thiagarajan (1992): A logical characterization of well branching event structures. Theoretical Computer Science 96(1), pp. 35–72, doi:10.1016/0304-3975(92)90181-E.
  26. R. De Nicola & G.L. Ferrari (1990): Observational Logics and Concurrency Models. In: FSTTCS, Lecture Notes in Computer Science 472. Springer-Verlag, pp. 301–315, doi:10.1007/3-540-53487-3_53.
  27. M. Nielsen & C. Clausen (1994): Bisimulation for Models in Concurrency. In: Proceedings of 5th International Conference on Concurrency Theory, CONCUR'94, Lecture Notes in Computer Science 836. Springer-Verlag, pp. 385–400, doi:10.1007/BFb0015021.
  28. M. Nielsen & C. Clausen (1994): Bisimulation, games, and logic. In: Results and Trends in Theoretical Computer Science, Lecture Notes in Computer Science 812. Springer-Verlag, pp. 289–306, doi:10.1007/3-540-58131-6_54.
  29. M. Nielsen & C. Clausen (1995): Games and logics for a noninterleaving bisimulation. Nordic Journal of Computing 2(2), pp. 221–249.
  30. W. Penczek (1995): Branching time and partial order in temporal logics. In: Time and Logic: A Computational Approach. UCL Press Ltd., pp. 179–228.
  31. I.C.C. Phillips & I. Ulidowski (2011): A Hierarchy of Reverse Bisimulations on Stable Configuration Structures. Mathematical Structures in Computer Science. Available at http://www.doc.ic.ac.uk/~iccp/papers/hierarchymscs.pdf. To appear..
  32. S. Pinchinat, F. Laroussinie & Ph. Schnoebelen (1994): Logical characterizations of truly concurrent bisimulation. Technical Report 114. Grenoble.
  33. L. Pomello (1986): Some equivalence notions for concurrent systems – An overview. In: Advances in Petri Nets 1985, Lecture Notes in Computer Science 222. Springer-Verlag, pp. 381–400, doi:10.1007/BFb0016222.
  34. A. Rabinovich & B.A. Trakhtenbrot (1988): Behavior structures and nets. Fundamenta Informaticae 11(4), pp. 357–403.
  35. B. Steffen & A. Ingólfsdóttir (1994): Characteristic Formulae for Processes with Divergence. Information and Computation 110(1), pp. 149–163, doi:10.1006/inco.1994.1028.
  36. G. Winskel (1987): Event structures. In: Advances in Petri Nets 1986, Lecture Notes in Computer Science 255. Springer-Verlag, pp. 325–392, doi:10.1007/3-540-17906-2_31.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org