34
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Undecidable problems in unreliable computations

      Theoretical Computer Science
      Elsevier BV

      Read this article at

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

          Abstract

          Related collections

          Most cited references22

          • Record: found
          • Abstract: not found
          • Conference Proceedings: not found

          The temporal logic of programs

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

            Results on the propositional μ-calculus

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

              Algebraic laws for nondeterminism and concurrency

                Bookmark

                Author and article information

                Journal
                Theoretical Computer Science
                Theoretical Computer Science
                Elsevier BV
                03043975
                March 2003
                March 2003
                : 297
                : 1-3
                : 337-354
                Article
                10.1016/S0304-3975(02)00646-1
                124dbf1f-a386-417c-bbfb-6d8dcd1bd88a
                © 2003

                http://www.elsevier.com/tdm/userlicense/1.0/

                History

                Comments

                Comment on this article