History-Deterministic Timed Automata Are Not Determinizable (English)
- New search for: Bose, Sougata
- New search for: Henzinger, Thomas A.
- New search for: Lehtinen, Karoliina
- New search for: Schewe, Sven
- New search for: Totzke, Patrick
- New search for: Lin, Anthony W.
- New search for: Zetzsche, Georg
- New search for: Potapov, Igor
- New search for: Bose, Sougata
- New search for: Henzinger, Thomas A.
- New search for: Lehtinen, Karoliina
- New search for: Schewe, Sven
- New search for: Totzke, Patrick
In:
Reachability Problems
: 16th International Conference, RP 2022, Kaiserslautern, Germany, October 17–21, 2022, Proceedings
;
Chapter: 5
;
67-76
;
2022
- Article/Chapter (Book) / Electronic Resource
-
Title:History-Deterministic Timed Automata Are Not Determinizable
-
Additional title:Lect.Notes Computer
-
Contributors:Lin, Anthony W. ( editor ) / Zetzsche, Georg ( editor ) / Potapov, Igor ( editor ) / Bose, Sougata ( author ) / Henzinger, Thomas A. ( author ) / Lehtinen, Karoliina ( author ) / Schewe, Sven ( author ) / Totzke, Patrick ( author )
-
Conference:International Conference on Reachability Problems ; 2022 ; Kaiserslautern, Germany
-
Published in:Reachability Problems : 16th International Conference, RP 2022, Kaiserslautern, Germany, October 17–21, 2022, Proceedings ; Chapter: 5 ; 67-76Lecture Notes in Computer Science ; 13608 ; 67-76
-
Publisher:
- New search for: Springer International Publishing
-
Place of publication:Cham
-
Publication date:2022-10-12
-
Size:10 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
SAT-Based Invariant Inference and Its Relation to Concept LearningFeldman, Yotam M. Y. / Shoham, Sharon et al. | 2022
- 2
-
Post’s Correspondence Problem: From Computer Science to AlgebraCiobanu, Laura et al. | 2022
- 3
-
The Past and Future of Embedded Finite Model TheoryBenedikt, Michael et al. | 2022
- 4
-
Linearization, Model Reduction and Reachability in Nonlinear odesBoreale, Michele / Collodi, Luisa et al. | 2022
- 5
-
History-Deterministic Timed Automata Are Not DeterminizableBose, Sougata / Henzinger, Thomas A. / Lehtinen, Karoliina / Schewe, Sven / Totzke, Patrick et al. | 2022
- 6
-
Unambiguity and Fewness for Nonuniform Families of Polynomial-Size Nondeterministic Finite AutomataYamakami, Tomoyuki et al. | 2022
- 7
-
The Stochastic Arrival ProblemWebster, Thomas et al. | 2022
- 8
-
On Higher-Order Reachability Games Vs May ReachabilityAsada, Kazuyuki / Katsura, Hiroyuki / Kobayashi, Naoki et al. | 2022
- 9
-
Coefficient Synthesis for Threshold AutomataBalasubramanian, A. R. et al. | 2022
- 10
-
Subsequences in Bounded Ranges: Matching and Analysis ProblemsKosche, Maria / Koß, Tore / Manea, Florin / Pak, Viktoriya et al. | 2022
- 11
-
Canonization of Reconfigurable PT Nets in MaudeCapra, Lorenzo et al. | 2022