Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Büchi-Automat"'
Autor:
Vukadinović, Valentino
U ovom radu opisan je način na koji su se prikupili podaci, kako je napravljen sentiment nad njima te u konačnici model, tj. automat koji analizira i opisuje rast i pad cijene Bitcoin-a. Koriste se dvije vrste podataka, objave s društvene mreže T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______4131::7ed70335c295faab8824b01d196e6b87
https://repozitorij.fer.unizg.hr/islandora/object/fer:8120/datastream/PDF
https://repozitorij.fer.unizg.hr/islandora/object/fer:8120/datastream/PDF
This paper (1) summarizes the history of the RERS challenge for the analysis and verification of reactive systems, its profile and intentions, its relation to other competitions, and, in particular, its evolution due to the feedback of participants,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::181c4fd8729a8362dcef711d83a319b9
The verification problem for action logic programs with non-terminating behaviour is in general undecidable. In this paper, we consider a restricted setting in which the problem becomes decidable. On the one hand, we abstract from the actual executio
Externí odkaz:
https://tud.qucosa.de/id/qucosa%3A79513
https://tud.qucosa.de/api/qucosa%3A79513/attachment/ATT-0/
https://tud.qucosa.de/api/qucosa%3A79513/attachment/ATT-0/
Autor:
Lutz, Carsten, Walther, Dirk
Propositional dynamic logic (PDL) is one of the most succesful variants of modal logic. To make it even more useful for applications, many extensions of PDL have been considered in the literature. A very natural and useful such extension is with nega
Externí odkaz:
https://tud.qucosa.de/id/qucosa%3A79055
https://tud.qucosa.de/api/qucosa%3A79055/attachment/ATT-0/
https://tud.qucosa.de/api/qucosa%3A79055/attachment/ATT-0/
Autor:
Daniel Hausmann
Publikováno v:
Daniel Hausmann
The coalgebraic µ-calculus is an expressive logic that generalizes the modal µ-calculus by interpreting formulas over T-coalgebras rather than Kripke structures. Due to the presence of fixpoint operators, the semantics of µ-calculi is rather invol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e2a1b90de7e28cb3e3d6c84f111cd497
https://opus4.kobv.de/opus4-fau/files/9932/base.pdf
https://opus4.kobv.de/opus4-fau/files/9932/base.pdf
Autor:
Fritz, Carsten
We analyze simulation relations as heuristics for the simplification of omega-automata, i.e., of finite automata working on infinite strings. Our focus is on alternating omega-automata. We introduce direct, delayed, and fair simulation for alternatin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ab7b8dab1de6d9322efbeaadf9c6bdf7
http://macau.uni-kiel.de/receive/dissertation_diss_00001644
http://macau.uni-kiel.de/receive/dissertation_diss_00001644
Autor:
Olschewski, Jörg
Publikováno v:
Aachen : Publikationsserver der RWTH Aachen University VI, 117 S. : graph. Darst. (2013). = Aachen, Techn. Hochsch., Diss., 2013
The theory of two-player infinite games provides a framework for studying the controller synthesis problem in reactive system. This problem was solved for regular winning conditions for the first time by the fundamental Büchi-Landweber Theorem. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______791::e116035d5befb24cb7a3cc793e71748d
https://publications.rwth-aachen.de/record/229420
https://publications.rwth-aachen.de/record/229420
Autor:
Kufleitner, Manfred, Lauser, Alexander
We introduce partially ordered two-way Büchi automata over infinite words. As for finite words, the nondeterministic variant recognizes the fragment Sigma2 of first-order logic FO[
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9431dfa8d48f2bd0d38f8cf032b9f75e
http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-55082
http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-55082
Autor:
Dirk Walther, Carsten Lutz
Publikováno v:
Automated Reasoning ISBN: 9783540223450
IJCAR
Scopus-Elsevier
IJCAR
Scopus-Elsevier
Propositional dynamic logic (PDL) is one of the most succesful variants of modal logic. To make it even more useful for applications, many extensions of PDL have been considered in the literature. A very natural and useful such extension is with nega
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a958d86b3aa8bc8b16291a2c6de7c367
https://tud.qucosa.de/id/qucosa:79055
https://tud.qucosa.de/id/qucosa:79055