Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Automat <Automatentheorie>"'
Autor:
Drabek, Christian
Vernetzte eingebettete Systeme sind heute allgegenwärtig. Um auch komplexere Dienste anbieten zu können, interagieren immer mehr Komponenten in einem System miteinander. Für die Qualität der entstehenden Applikation ist, neben der korrekten Funkt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::168d72d6fd46b84accc3b90f834d1469
Autor:
Stavros Konstantinidis
This book constitutes the thoroughly refereed papers of the 18th International Conference on Implementation and Application of Automata, CIAA 2013, held in Halifax, NS, Canada, in July 2013. The 25 revised full papers presented together with 3 invite
Autor:
Armbrust, Christopher
Since their invention in the 1980s, behaviour-based systems have become very popular among roboticists. Their component-based nature facilitates the distributed implementation of systems, fosters reuse, and allows for early testing and integration. H
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______651::5a37304c42295f4e694c9bf609c9ab97
https://kluedo.ub.uni-kl.de/files/4181/Christopher_Armbrust_-_Design_and_Verification_of_Behaviour-Based_Systems_Realising_Task_Sequences.pdf
https://kluedo.ub.uni-kl.de/files/4181/Christopher_Armbrust_-_Design_and_Verification_of_Behaviour-Based_Systems_Realising_Task_Sequences.pdf
Autor:
Joachim Funke
Publikováno v:
Thinking & Reasoning. 7:69-89
With the advent of computers in the experimental labs, dynamic systems have become a new tool for research on problem solving and decision making. A short review on this research is given and the main features of these systems (connectivity and dynam
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ff51af66df0e95b03942f77db6235014
https://doi.org/10.1080/13546780042000046
https://doi.org/10.1080/13546780042000046
Autor:
Kresic, Dario
Modell-basierte Testverfahren werden im Paradigma der Constraint-Programmierung angesehen. Demnach wird eine Spezifikation (in Form eines Zeitautomaten oder einer Komposition von Zeitautomaten) zunächst als ein Constraint-Programm kodiert. Durch die
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2091::05e25ca08c0196f343f4990ad066ad83
https://opus4.kobv.de/opus4-fau/frontdoor/index/index/docId/639
https://opus4.kobv.de/opus4-fau/frontdoor/index/index/docId/639
Autor:
Tischler, German
Parametric weighted finite automata (PWFA) are a multi-dimensional generalization of weighted finite automata. The expressiveness of PWFA contains the expressiveness of weighted finite automata as well as the expressiveness of affine iterated functio
Autor:
Tischler, German
Parametric weighted finite automata (PWFA) are a multi-dimensional generalization of weighted finite automata. The expressiveness of PWFA contains the expressiveness of weighted finite automata as well as the expressiveness of affine iterated functio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______713::64bb0620ac68327a26973b6b2b00273f
https://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/2411
https://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/2411
Autor:
Panek, Sebastian
Zugl.: Dortmund, Univ., Diss., 2007
Externí odkaz:
http://d-nb.info/98846490X/04