- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Theory of computing systems(65), H. 8, S.1211-1242
- DOI
-
10.1007/s00224-021-10031-2
- URN
-
urn:nbn:de:101:1-2022032803073573999961
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:20 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Köcher, Chris
- TU Ilmenau
Time of origin
- 2021
Other Objects (12)
Reachability Problems on Reliable and Lossy Queue Automata
Timed Automata Relaxation for Reachability
Modern aspects of classical automata theory : finite automata, biautomata, and lossy compression
Rational, recognizable, and aperiodic sets in the partially lossy queue monoid
Maximizing Reachability Probabilities in Rectangular Automata with Random Clocks
Maximizing reachability probabilities in rectangular automata with random events
Reachability analysis of reversal-bounded automata on series–parallel graphs
The descriptional power of queue automata of constant length
Reachability in Two-Parametric Timed Automata with one Parameter is EXPSPACE-Complete
A model template for reachability-based containment checking of imprecise observations in timed automata
Modeling and verifying the FlexRay physical layer protocol with reachability checking of timed automata
Reachability switching games
Reachability Problems on Reliable and Lossy Queue Automata
Timed Automata Relaxation for Reachability
Modern aspects of classical automata theory : finite automata, biautomata, and lossy compression
Rational, recognizable, and aperiodic sets in the partially lossy queue monoid
Maximizing Reachability Probabilities in Rectangular Automata with Random Clocks
Maximizing reachability probabilities in rectangular automata with random events
Reachability analysis of reversal-bounded automata on series–parallel graphs
The descriptional power of queue automata of constant length
Reachability in Two-Parametric Timed Automata with one Parameter is EXPSPACE-Complete
A model template for reachability-based containment checking of imprecise observations in timed automata
Modeling and verifying the FlexRay physical layer protocol with reachability checking of timed automata
Reachability switching games
Reachability Problems on Reliable and Lossy Queue Automata
Timed Automata Relaxation for Reachability
Modern aspects of classical automata theory : finite automata, biautomata, and lossy compression
Rational, recognizable, and aperiodic sets in the partially lossy queue monoid
Maximizing Reachability Probabilities in Rectangular Automata with Random Clocks
Maximizing reachability probabilities in rectangular automata with random events
Reachability analysis of reversal-bounded automata on series–parallel graphs
The descriptional power of queue automata of constant length
Reachability in Two-Parametric Timed Automata with one Parameter is EXPSPACE-Complete
A model template for reachability-based containment checking of imprecise observations in timed automata
Modeling and verifying the FlexRay physical layer protocol with reachability checking of timed automata