36
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Book Chapter: not found

      Branching-Time Model Checking of Parametric One-Counter Automata

      other

      Read this book at

      Publisher
      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 references17

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

          Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines

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

            Definability and decision problems in arithmetic

            In this paper, we are concerned with the arithmetical definability of certain notions of integers and rationals in terms of other notions. The results derived will be applied to obtain a negative solution of corresponding decision problems.
              Bookmark
              • Record: found
              • Abstract: not found
              • Book Chapter: not found

              Multiple counters automata, safety analysis and presburger arithmetic

                Bookmark

                Author and book information

                Book Chapter
                2012
                : 406-420
                10.1007/978-3-642-28729-9_27
                a433b973-4444-47ca-9ba6-5ffd58beced1
                History

                Comments

                Comment on this book

                Book chapters

                Similar content3,375

                Cited by4