36
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Automata, Languages and Programming 

      Decidability and Complexity Results for Timed Automata via Channel Machines

      other

      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 references15

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

          What's Decidable about Hybrid Automata?

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

            Well-structured transition systems everywhere!

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

              Real-Time Logics: Complexity and Expressiveness

                Bookmark

                Author and book information

                Book Chapter
                2005
                : 1089-1101
                10.1007/11523468_88
                f78dee75-c274-48e8-bed2-03315845b4c4
                History

                Comments

                Comment on this book

                Book chapters

                Similar content5,163

                Cited by8