Literatura científica selecionada sobre o tema "Ω-automata"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Ω-automata".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Ω-automata"
Krithivasan, Kamala, K. Sharda e Sandeep V. Varma. "Distributed ω-Automata". International Journal of Foundations of Computer Science 14, n.º 04 (agosto de 2003): 681–98. http://dx.doi.org/10.1142/s0129054103001959.
Texto completo da fonteBaier, Christel, Marcus Grösser e Nathalie Bertrand. "Probabilistic ω-automata". Journal of the ACM 59, n.º 1 (fevereiro de 2012): 1–52. http://dx.doi.org/10.1145/2108242.2108243.
Texto completo da fonteKrithivasan, Kamala, e K. Sharda. "Fuzzy ω-automata". Information Sciences 138, n.º 1-4 (outubro de 2001): 257–81. http://dx.doi.org/10.1016/s0020-0255(01)00150-5.
Texto completo da fonteCARNINO, VINCENT, e SYLVAIN LOMBARDY. "FACTORIZATIONS AND UNIVERSAL AUTOMATON OF OMEGA LANGUAGES". International Journal of Foundations of Computer Science 25, n.º 08 (dezembro de 2014): 1111–25. http://dx.doi.org/10.1142/s0129054114400279.
Texto completo da fonteLindsay, Peter A. "On alternating ω-automata". Journal of Computer and System Sciences 36, n.º 1 (fevereiro de 1988): 16–24. http://dx.doi.org/10.1016/0022-0000(88)90018-9.
Texto completo da fonteKUPFERMAN, ORNA, GILA MORGENSTERN e ANIELLO MURANO. "TYPENESS FOR ω-REGULAR AUTOMATA". International Journal of Foundations of Computer Science 17, n.º 04 (agosto de 2006): 869–83. http://dx.doi.org/10.1142/s0129054106004157.
Texto completo da fonteEngelfriet, Joost, e Hendrik Jan Hoogeboom. "X-automata on ω-words". Theoretical Computer Science 110, n.º 1 (março de 1993): 1–51. http://dx.doi.org/10.1016/0304-3975(93)90349-x.
Texto completo da fonteChen, Zhe. "On the Generative Power of ω-Grammars and ω-Automata". Fundamenta Informaticae 111, n.º 2 (2011): 119–45. http://dx.doi.org/10.3233/fi-2011-557.
Texto completo da fonteLöding, Christof, e Max Philip Stachon. "On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words". Fundamenta Informaticae 189, n.º 1 (7 de julho de 2023): 69–91. http://dx.doi.org/10.3233/fi-222152.
Texto completo da fonteLa Torre, Salvatore, e Margherita Napoli. "Finite automata on timed ω-trees". Theoretical Computer Science 293, n.º 3 (fevereiro de 2003): 479–505. http://dx.doi.org/10.1016/s0304-3975(02)00611-4.
Texto completo da fonteTeses / dissertações sobre o assunto "Ω-automata"
Renkin, Florian. "Transformations d’ω-automates pour la synthèse de systèmes réactifs". Electronic Thesis or Diss., Sorbonne université, 2022. http://www.theses.fr/2022SORUS227.
Texto completo da fonteSynthesis aims to produce a correct system from specifications. One approach to solve this problem is to translate the specification into a parity game whose winning strategy encodes the system. In this thesis we will show two methods to produce parity automata. The first is based on improving and combining new or existing procedures. The second is an algorithm from Casares et al. providing a guarantee of optimal results. In a second step, we will show how we reduce the obtained system. Two types of reductions will be discussed. The first allows to obtain an optimal result but not the second which privileges the processing time. The third part will describe optimizations that can be used for certain classes of specifications
Sickert, Salomon [Verfasser], Estaun Francisco Javier [Akademischer Betreuer] Esparza, Estaun Francisco Javier [Gutachter] Esparza e Orna [Gutachter] Kupferman. "A Unified Translation of Linear Temporal Logic to ω-Automata / Salomon Sickert ; Gutachter: Francisco Javier Esparza Estaun, Orna Kupferman ; Betreuer: Francisco Javier Esparza Estaun". München : Universitätsbibliothek der TU München, 2019. http://d-nb.info/119416305X/34.
Texto completo da fontePezzotti, Simone. "DFT-MD simulations and theoretical SFG spectroscopy to characterize H-Bonded networks at aqueous interfaces : from hydrophobic to hydrophilic environments Structural definition of the BIL and DL: a new universal methodology to rationalize non-linear χ(2)(ω) SFG signals at charged interfaces, including χ(3)(ω) contributions What the Diffuse Layer (DL) Reveals in Non-Linear SFG Spectroscopy 2D H-Bond Network as the Topmost Skin to the Air-Water Interface Combining ab-initio and classical molecular dynamics simulations to unravel the structure of the 2D-HB-network at the air-water interface 2D-HB-Network at the air-water interface: A structural and dynamical characterization by means of ab initio and classical molecular dynamics simulations Spectroscopic BIL-SFG Invariance Hides the Chaotropic Effect of Protons at the Air-Water Interface Molecular hydrophobicity at a macroscopically hydrophilic surface Graph theory for automatic structural recognition in molecular dynamics simulations DFT-MD of the (110)-Co3O4 cobalt oxide semiconductor in contact with liquid water, preliminary chemical and physical insights into the electrochemical environment". Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLE008.
Texto completo da fonteImproving our knowledge on water H-Bonded networks formed in the special environment offered by an interface is pivotal for our understanding of many natural phenomena and technological applications. To reveal the interfacial water arrangement, techniques able to provide detailed microscopic information selectively for the interfacial layer are required. In the present thesis work, we have hence investigated aqueous interfaces at the molecular level, by coupling theoretical modeling from DFT-MD simulations with SFG & THz-IR spectroscopies. By developing new investigation protocols/tools, coupling DFT-MD simulations and SFG spectroscopy, in particular for the more complex rationalization of charged interfaces, we have provided a global comprehension of the effect of various interfacial conditions (hydrophilicity, pH, ionic strength) on the HB-Network formed in the interfacial layer (BIL), on its spectroscopic signatures and on its impact on physico-chemical properties. We have shown for the first time that, in sufficiently hydrophobic conditions, BIL interfacial water creates special 2-Dimensional HB-Networks, experimentally revealed by one specific THz-IR marker band. Such 2D-network dictates HBs and orientational dynamics of interfacial water, surface potential, surface acidity, water surface tension and thermodynamics of hydration of hydrophobic solutes. Such "horizontal ordering” of water at hydrophobic interfaces is found opposite to the “vertical ordering” of water at hydrophilic interfaces, while coexistence of the two orders leads to disordered interfacial water in intermediate hydrophilic/hydrophobic conditions. Both DFT-MD and SFG further revealed how ions & pH conditions alter these BIL-water orders
Segelken, Marc [Verfasser]. "Abstraktion und Gegenbeispiel-gelenkte Konstruktion von ω-Automaten [Omega-Automaten] zur Verifikation Schritt-diskreter linearer hybrider Systeme / von Marc Segelken". 2008. http://d-nb.info/989268985/34.
Texto completo da fonteCapítulos de livros sobre o assunto "Ω-automata"
Farwer, Berndt. "ω-Automata". In Lecture Notes in Computer Science, 3–21. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-36387-4_1.
Texto completo da fonteWilke, Thomas, e Sven Schewe. "ω-Automata". In Handbook of Automata Theory, 189–234. Zuerich, Switzerland: European Mathematical Society Publishing House, 2021. http://dx.doi.org/10.4171/automata-1/6.
Texto completo da fonteVilla, Tiziano, Nina Yevtushenko, Robert K. Brayton, Alan Mishchenko, Alexandre Petrenko e Alberto Sangiovanni-Vincentelli. "Equations Over ω-Automata". In The Unknown Component Problem, 73–84. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-68759-9_4.
Texto completo da fonteCasares, Antonio, Alexandre Duret-Lutz, Klara J. Meyer, Florian Renkin e Salomon Sickert. "Practical Applications of the Alternating Cycle Decomposition". In Tools and Algorithms for the Construction and Analysis of Systems, 99–117. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99527-0_6.
Texto completo da fonteAlmagor, Shaull, Yoram Hirshfeld e Orna Kupferman. "Promptness in ω-Regular Automata". In Automated Technology for Verification and Analysis, 22–36. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15643-4_4.
Texto completo da fonteYen, Hsu-Chun. "Fair Control of ω-Automata". In Discrete Event Systems, 355–62. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4493-7_37.
Texto completo da fonteKupferman, Orna, Gila Morgenstern e Aniello Murano. "Typeness for ω-Regular Automata". In Automated Technology for Verification and Analysis, 324–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30476-0_27.
Texto completo da fonteKrishnan, Sriram C., Anuj Puri e Robert K. Brayton. "Structural complexity of ω-automata". In STACS 95, 143–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-59042-0_69.
Texto completo da fonteBoker, Udi, Karoliina Lehtinen e Salomon Sickert. "On the Translation of Automata to Linear Temporal Logic". In Lecture Notes in Computer Science, 140–60. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99253-8_8.
Texto completo da fontePeng, Wuxu, e S. Purushothaman. "Empty stack Pushdown ω-tree automata". In CAAP '92, 248–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-55251-0_14.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Ω-automata"
Safra, S., e M. Y. Vardi. "On ω-automata and temporal logic". In the twenty-first annual ACM symposium. New York, New York, USA: ACM Press, 1989. http://dx.doi.org/10.1145/73007.73019.
Texto completo da fonteLehtinen, Karoliina, e Martin Zimmermann. "Good-for-games ω-Pushdown Automata". In LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3373718.3394737.
Texto completo da fonteLiu, Ying, e Hede Ma. "Pattern recognition using ω-orbit finite automata". In Visual Communications, '91, Boston, MA, editado por Kou-Hu Tzou e Toshio Koga. SPIE, 1991. http://dx.doi.org/10.1117/12.50318.
Texto completo da fonteBouyer, Patricia, Antonio Casares, Mickael Randour e Pierre Vandenhove. "Half-Positional Objectives Recognized by Deterministic Büchi Automata (Extended Abstract)". In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/713.
Texto completo da fonteSafra, Shmuel. "Exponential determinization for ω-automata with strong-fairness acceptance condition (extended abstract)". In the twenty-fourth annual ACM symposium. New York, New York, USA: ACM Press, 1992. http://dx.doi.org/10.1145/129712.129739.
Texto completo da fonteLabai, Nadia, Magdalena Ortiz e Mantas Šimkus. "An ExpTime Upper Bound for ALC with Integers". In 17th International Conference on Principles of Knowledge Representation and Reasoning {KR-2020}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/kr.2020/61.
Texto completo da fonteCatania, Giuseppe, e Giovanni Naldi. "Blade Modeling of an Axial Flow Fan Under Vibration Constraints: An Experimental and Analytical Investigation". In ASME 2002 Engineering Technology Conference on Energy. ASMEDC, 2002. http://dx.doi.org/10.1115/etce2002/struc-29043.
Texto completo da fonteSpall, Robert E., e Wenbin Yu. "Imbedded Dual-Number Automatic Differentiation to Support CFD Analysis". In ASME 2012 Fluids Engineering Division Summer Meeting collocated with the ASME 2012 Heat Transfer Summer Conference and the ASME 2012 10th International Conference on Nanochannels, Microchannels, and Minichannels. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/fedsm2012-72043.
Texto completo da fonteCheng, X., A. Batta, H. Y. Chen e N. I. Tak. "Turbulent Heat Transfer to Heavy Liquid Metals in Circular Tubes". In ASME 2004 Heat Transfer/Fluids Engineering Summer Conference. ASMEDC, 2004. http://dx.doi.org/10.1115/ht-fed2004-56562.
Texto completo da fonteBriones, Alejandro M., e Brent A. Rankin. "Development of an Open-Source Autonomous CFD Meta-Modeling Environment for Small-Scale Combustor Optimization – Part II". In ASME Turbo Expo 2022: Turbomachinery Technical Conference and Exposition. American Society of Mechanical Engineers, 2022. http://dx.doi.org/10.1115/gt2022-78586.
Texto completo da fonte