Deterministic pushdown automata as specifications for discrete event supervisory control in Isabelle
- Alternative title
-
Deterministische Kellerautomaten als Spezifikationen für ereignisdiskrete Überwachungsregelung in Isabelle
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Berlin, Technische Universität Berlin, Dissertation, 2019
- Keyword
-
Specifications
Robots
- Event
-
Veröffentlichung
- (where)
-
Berlin
- (who)
-
Technische Universität Berlin
- (when)
-
2019
- Creator
- Contributor
-
Nestmann, Uwe
Raisch, Jörg
Giese, Holger
Kammüller, Florian
- DOI
-
10.14279/depositonce-9332
- Handle
-
11303/10372
- URN
-
urn:nbn:de:101:1-2019122501030944190267
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:44 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
- Schneider, Sven
- Nestmann, Uwe
- Raisch, Jörg
- Giese, Holger
- Kammüller, Florian
- Technische Universität Berlin
Time of origin
- 2019
Other Objects (12)
Deterministic set automata
From Emerson-Lei automata to deterministic, limit-deterministic or good-for-MDP automata
From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata
From Emerson-Lei automata to deterministic, limit-deterministic or good-for-MDP automata
Correction to: From Emerson-Lei automata to deterministic, limit-deterministic or good-for-MDP automata
Minimization of Deterministic Fuzzy Tree Automata
Deterministic automata for extended regular expressions
Fault-tolerant control of deterministic input/output automata
Constructing Deterministic Parity Automata from Positive and Negative Examples
Constructing Deterministic Parity Automata from Positive and Negative Examples
Deterministic two-way one-head pushdown automata are very powerful
Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
Deterministic set automata
From Emerson-Lei automata to deterministic, limit-deterministic or good-for-MDP automata
From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata
From Emerson-Lei automata to deterministic, limit-deterministic or good-for-MDP automata
Correction to: From Emerson-Lei automata to deterministic, limit-deterministic or good-for-MDP automata
Minimization of Deterministic Fuzzy Tree Automata
Deterministic automata for extended regular expressions
Fault-tolerant control of deterministic input/output automata
Constructing Deterministic Parity Automata from Positive and Negative Examples
Constructing Deterministic Parity Automata from Positive and Negative Examples
Deterministic two-way one-head pushdown automata are very powerful
Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
Deterministic set automata
From Emerson-Lei automata to deterministic, limit-deterministic or good-for-MDP automata
From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata
From Emerson-Lei automata to deterministic, limit-deterministic or good-for-MDP automata
Correction to: From Emerson-Lei automata to deterministic, limit-deterministic or good-for-MDP automata
Minimization of Deterministic Fuzzy Tree Automata
Deterministic automata for extended regular expressions
Fault-tolerant control of deterministic input/output automata
Constructing Deterministic Parity Automata from Positive and Negative Examples
Constructing Deterministic Parity Automata from Positive and Negative Examples
Deterministic two-way one-head pushdown automata are very powerful