30
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      CONCUR 2002 — Concurrency Theory 

      Why Is Simulation Harder than Bisimulation?

      other
      ,
      Springer Berlin Heidelberg

      Read this book at

      Buy book Bookmark
          There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references12

          • Record: found
          • Abstract: not found
          • Article: not found

          Algebra of communicating processes with abstraction

            Bookmark
            • Record: found
            • Abstract: not found
            • Book Chapter: not found

            Model Checking Lossy Vector Addition Systems

              Bookmark
              • Record: found
              • Abstract: not found
              • Book Chapter: not found

              On the Ehrenfeucht-Fraïssé game in theoretical computer science

                Bookmark

                Author and book information

                Book Chapter
                2002
                September 18 2002
                : 594-609
                10.1007/3-540-45694-5_39
                1c6190e1-00ba-4c08-8ae5-17c53e25a5c5
                History

                Comments

                Comment on this book

                Book chapters

                Similar content1,404

                Cited by3