Inhaltsverzeichnis
Auswahl der wissenschaftlichen Literatur zum Thema „MSO logic“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "MSO logic" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "MSO logic"
D'agostino, Giovanna, und Marco Hollenberg. „Logical questions concerning the μ-calculus: Interpolation, Lyndon and Łoś-Tarski“. Journal of Symbolic Logic 65, Nr. 1 (März 2000): 310–32. http://dx.doi.org/10.2307/2586539.
Der volle Inhalt der QuelleAbdul-Adheem, Wameedh Riyadh. „Design and simulation of a normalized fuzzy logic controller for the quadruple-tank process“. Indonesian Journal of Electrical Engineering and Computer Science 18, Nr. 1 (01.04.2020): 227. http://dx.doi.org/10.11591/ijeecs.v18.i1.pp227-234.
Der volle Inhalt der QuelleCARTON, OLIVIER, THOMAS COLCOMBET und GABRIELE PUPPIS. „AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS“. Journal of Symbolic Logic 83, Nr. 3 (September 2018): 1147–89. http://dx.doi.org/10.1017/jsl.2018.7.
Der volle Inhalt der QuelleJeandel, Emmanuel, und Guillaume Theyssier. „Subshifts as models for MSO logic“. Information and Computation 225 (April 2013): 1–15. http://dx.doi.org/10.1016/j.ic.2013.01.003.
Der volle Inhalt der QuelleDroste, Manfred, und Vitaly Perevoshchikov. „Multi-weighted Automata and MSO Logic“. Theory of Computing Systems 59, Nr. 2 (27.10.2015): 231–61. http://dx.doi.org/10.1007/s00224-015-9658-9.
Der volle Inhalt der QuelleCalvanese, Diego, Giuseppe De Giacomo, Maurizio Lenzerini und Moshe Vardi. „Node Selection Query Languages for Trees“. Proceedings of the AAAI Conference on Artificial Intelligence 24, Nr. 1 (03.07.2010): 279–84. http://dx.doi.org/10.1609/aaai.v24i1.7598.
Der volle Inhalt der QuelleGastin, Paul, Amaldev Manuel und R. Govind. „Reversible Regular Languages: Logical and Algebraic Characterisations“. Fundamenta Informaticae 180, Nr. 4 (30.06.2021): 333–50. http://dx.doi.org/10.3233/fi-2021-2045.
Der volle Inhalt der QuelleEcheverría, Martin. „Experiencing Political Advertising Through Social Media Logic: A Qualitative Inquiry“. Media and Communication 11, Nr. 2 (16.05.2023): 127–36. http://dx.doi.org/10.17645/mac.v11i2.6412.
Der volle Inhalt der QuelleVazquez Gonzalez, Jose Luis, Juan Barrios Aviles, Alfredo Rosado Muñoz und Ruben Alejos Palomares. „An Industrial Automation Course: Common Infrastructure for Physical, Virtual and Remote Laboratories for PLC Programming“. International Journal of Online Engineering (iJOE) 14, Nr. 08 (30.08.2018): 4. http://dx.doi.org/10.3991/ijoe.v14i08.8758.
Der volle Inhalt der QuelleAttia, Hussain. „Fuzzy Logic Controller Effectiveness Evaluation through Comparative Memberships for Photovoltaic Maximum Power Point Tracking Function“. International Journal of Power Electronics and Drive Systems (IJPEDS) 9, Nr. 3 (01.09.2018): 1147. http://dx.doi.org/10.11591/ijpeds.v9.i3.pp1147-1156.
Der volle Inhalt der QuelleDissertationen zum Thema "MSO logic"
Baschenis, Félix. „Minimizing resources for regular word transductions“. Thesis, Bordeaux, 2017. http://www.theses.fr/2017BORD0810/document.
Der volle Inhalt der QuelleThe goal of this thesis was to study definability questionsabout finite-state transducers and in particular two-waytransducers. It is known that two-way transducers cover a larger classof transductions than one-way transducers. Then the first question wetackled is the one-way definability problem: is it possible torealize a given two-way transduction by a one-way transducer? Thisproblem was shown to be decidable for functionaltransducers (we also show as a side result that one-way definability becomes undecidable for non-functional transducers) but the decision procedure had non-elementary complexity.We proposed a characterization of one-way definability thatallows us to decide it in double-exponential space, and provide anequivalent one-way transducer of triple-exponential size. We firststudied this question for a restricted class, namely sweepingtransducers, for which the decision procedure and the construction ofthe one-way transducer take one less exponential. For suchtransducers, our procedure is optimal in the sense that we have shownthat there exists a family of functions that are one-way definable andfor which an equivalent one-way transducer requires doubly exponentialsize.The study of sweeping transducers raised other definability questions: Is a given transducer equivalent to some sweeping transducer? And to some sweeping transducer that performs at most k passes? We showed that those questions are decidable and the decision procedure, as well as the equivalent transducer, have the same complexity as in the one-way case. Moreover, as we have shown that there exists a bound on the number of passes required to realize a transduction by a sweeping transducer, we managed to obtain a procedure to minimize the number of passes of a sweeping transducer.Finally we tried to characterize sweeping transducers in other models for regular transductions such as Streaming String transducers (SST) and MSO transductions. As we obtained an equivalence between the number of passes of a sweeping transducer and the number of registers of the equivalent SST we provided a minimization procedure for the number of registers of a large class of SST's. To conclude, our work allowed us to provide a good overall understanding of the definability questions between the models for regular transductions and in particular regarding the resources, whether it is the number of passes (and of course one-way definability is crucial in that aspect) or the number of registers
Götze, Doreen. „Weighted Unranked Tree Automata over Tree Valuation Monoids“. Doctoral thesis, Universitätsbibliothek Leipzig, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-221154.
Der volle Inhalt der QuelleSuresh, Amrita. „Formal Verification of Communicating Automata“. Electronic Thesis or Diss., université Paris-Saclay, 2022. http://www.theses.fr/2022UPASG092.
Der volle Inhalt der QuelleDistributed systems involve processes that run independently and communicate asynchronously. While they capture a wide range of use cases and are hence, ubiquitous in our world, it is also particularly difficult to ensure their correctness. In this thesis, we model such systems using mathematical and logical formulation, and try to algorithmically verify them. In particular, we focus on FIFO (First In First Out) machines, with one or more finite-state machines communicating via unbounded reliable FIFO buffers.As most verification problems are known to be undecidable for FIFO machines, we focus on various subclasses and approximations of the model. The first model we consider are branch-well structured transition systems (branch-WSTS), a class which strictly includes the well-known class of WSTS. We study the problems of boundedness and termination for such systems, and demonstrate some examples of them. We also define another class of systems where the monotony condition is relaxed and show that a variant of the coverability problem is decidable under effectivity conditions.We then study the restriction of input-boundedness on FIFO machines, and show that rational reachability and various other properties are decidable for FIFO machines under the input-bounded restriction. In doing so, we answer a long standing open question regarding the reachability for input-bounded FIFO machines. We also derive some complexity bounds by considering the simplest case, a FIFO machine with a single channel.Another restriction that we study is synchronizability in communicating systems. In particular, we study this notion for MSCs (Message Sequence Charts), which is a model to represent executions of a communicating system. We show that if any set of MSCs can satisfy two properties, namely MSO (Monadic Second-order Logic) definability and bounded (special-)tree width, then synchronizability is decidable. Moreover, reachability and model-checking are also decidable within this framework. We also unify some classes from the literature using this framework, and for some other classes, show their undecidability
Mohan, Ashwin. „A fuzzy controller developed in RSLogix 5000 using ladder logic and function blocks implemented on a Control Logix PLC /“. free to MU campus, to others for purchase, 2004. http://wwwlib.umi.com/cr/mo/fullcit?p1420941.
Der volle Inhalt der QuelleSrinivasan, Venkataramanujam. „Gigahertz-Range Multiplier Architectures Using MOS Current Mode Logic (MCML)“. Thesis, Virginia Tech, 2003. http://hdl.handle.net/10919/9643.
Der volle Inhalt der QuelleMaster of Science
Maestro, Izquierdo Marcos. „Analysis of the Resistive Switching phenomenon in MOS devices for memory and logic applications“. Doctoral thesis, Universitat Autònoma de Barcelona, 2017. http://hdl.handle.net/10803/405453.
Der volle Inhalt der QuelleIn general, the continuous evolution, and improvement, of the technology has led to face new emerging challenges. Regarding the electronic field, one of the most relevant has been the Moore’s law which postulates “the number of transistors in a dense integrated circuit doubles approximately every two years”. To accomplish this postulate, the solution has been reducing the device dimensions. However, in last decades, physical limitations have been reached since device dimensions are in the atomic range. Moreover, problems originated from the device scaling such as short channel effects in MOSFETs have been observed. Consequently, the focus of the scientific community has turned into the exploration of alternative device materials and structures or different phenomena that would overcome the different issues owing to the scaling. Concerning alternative phenomena, one of the most relevant has been the Resistive Switching (RS) phenomenon which has shown promising features to be implemented in many applications. This phenomenon is based on the capability of a dielectric layer to change its resistance (or conductivity) between two or more values, which show a non-volatile behavior, under the action of an electric field. Overall, these characteristics makes this phenomenon very suitable and promising for its application in digital logic where a new paradigm of computation based on this phenomenon is emerging, in the development of artificial neural networks emulating the behavior of the neuron part known as synapse, and in memory like the next generation of non-volatile memories. However, despite the great efforts of the scientific community in last half a century, there are several hot topics such as the deeper RS understanding, the analysis of reliability issues affecting RS behavior or the investigation on new applications of RS based devices in which much more work must be done. In this way, the goal of this thesis has been focused on increasing the RS phenomenon knowledge and studying its feasibility for different applications. Hence, RS phenomenon has been study both at device level, to analyze the phenomenon itself, and at circuit level, to analyze its application in memory and digital fields. Initially, the phenomenon has been experimentally studied on MOSFET transistors analyzing the effect on the dielectric resistance change of the voltage polarity applied to provoke RS. Furthermore, due to the localized character of the phenomenon, the different current contributions involved in the conduction through the dielectric and the control of those current contributions have been analyzed. Then, RS has been studied on memristors with a dielectric layer based on HfO2. Here, the phenomenon has been studied applying fast voltage ramps to provoke the resistance changes to analyze the influence of the voltage ramp speed on the RS parameters. In addition, enhanced experimental setups and characterization methods have been proposed to analyze the RTN associated to RS. In addition, memristors with a SiO-based dielectric layer have been investigated as memory and selector devices by performing different DC and pulsed analysis to corroborate the feasibility of such devices for these applications. Finally, the application of memristors in digital field have been performed. Memristors have been used as the main element to design logic gates, specifically, to implement material implication-based (IMPLY) and NAND gates. Then, the experimental demonstration of both memristor-based logic gates (IMPLY and NAND) performance has been carried out. In addition, the transient behavior of memristors involved in the IMPLY gate have been experimentally studied in order to analyze what happens to memristors during the operation.
Khordoc, Karim. „A MOS switch-level simulator with delay calculation /“. Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=65461.
Der volle Inhalt der QuelleKirawanich, Phumin. „Fuzzy logic control for an active power line conditioner /“. free to MU campus, to others for purchase, 2002. http://wwwlib.umi.com/cr/mo/fullcit?p3060114.
Der volle Inhalt der QuelleLee, Hoon-Kyeu. „An automatic test pattern generation in the logic gate level circuits and MOS transistor circuits at Ohio University“. Ohio : Ohio University, 1986. http://www.ohiolink.edu/etd/view.cgi?ohiou1183139647.
Der volle Inhalt der QuelleRamirez, Carlos. „Meso-machining of miniature space system components“. To access this resource online via ProQuest Dissertations and Theses @ UTEP, 2007. http://0-proquest.umi.com.lib.utep.edu/login?COPT=REJTPTU0YmImSU5UPTAmVkVSPTI=&clientId=2515.
Der volle Inhalt der QuelleBücher zum Thema "MSO logic"
Warskel, Glynn. Models and logic of MOS circuits. Cambridge: University of Cambridge, Computer Laboratory, 1986.
Den vollen Inhalt der Quelle findenCorporation, Toshiba. L-MOS (logic MOS) TC4S/TC7S/TC3W/TC4W/TC7W series: Data book. Tokyo: Toshiba Corporation, 1993.
Den vollen Inhalt der Quelle findenGraham, A. C. Later Mohist logic, ethics, and science. Hong Kong: Chinese University Press, Chinese University of Hong Kong, 2003.
Den vollen Inhalt der Quelle findenBadel, Stéphane, Can Baltaci, Alessandro Cevrero und Yusuf Leblebici. Design Automation for Differential MOS Current-Mode Logic Circuits. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-319-91307-0.
Der volle Inhalt der QuelleCheng, Stephen Shao-chung. MOS digital electronics. Singapore: World Scientific, 1987.
Den vollen Inhalt der Quelle findenAlioto, Massimo, und Gaetano Palumbo. Model and Design of Bipolar and MOS Current-Mode Logic. Boston, MA: Springer US, 2005. http://dx.doi.org/10.1007/1-4020-2888-1.
Der volle Inhalt der QuelleInstruments, Texas. High-speed CMOS logic data book: Silicon-gate Complementary MOS. (s.l.): Texas Instruments, 1987.
Den vollen Inhalt der Quelle findenThe worlds of possibility: Modal realism and the semantics of modal logic. Oxford: Clarendon Press, 1998.
Den vollen Inhalt der Quelle findenTshad ma sde bdun mdo daṅ bcas paʼi gzuṅ lugs rgya mtshor ʼjug paʼi gru gziṅs. [Lhasa]: Bod-ljoṅs mi dmaṅs dpe skrun khaṅ, 1988.
Den vollen Inhalt der Quelle findenTenzin, Wangyal, Hrsg. Unbounded wholeness: Dzogchen, Bon, and the logic of the nonconceptual. New York, N.Y: Oxford University Press, 2006.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "MSO logic"
Antonopoulos, Timos, und Anuj Dawar. „Separating Graph Logic from MSO“. In Foundations of Software Science and Computational Structures, 63–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-00596-1_6.
Der volle Inhalt der QuelleFaella, Marco, und Gennaro Parlato. „Reasoning About Data Trees Using CHCs“. In Computer Aided Verification, 249–71. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-13188-2_13.
Der volle Inhalt der QuelleDawar, Anuj, und Luc Segoufin. „Capturing MSO with One Quantifier“. In Fields of Logic and Computation II, 142–52. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23534-9_8.
Der volle Inhalt der QuelleDroste, Manfred, und Vitaly Perevoshchikov. „Multi-weighted Automata and MSO Logic“. In Computer Science – Theory and Applications, 418–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38536-0_36.
Der volle Inhalt der QuelleTörmä, Ilkka. „Subshifts, MSO Logic, and Collapsing Hierarchies“. In Advanced Information Systems Engineering, 111–22. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44602-7_10.
Der volle Inhalt der QuelleKaiser, Łukasz. „Cardinality Quantifiers in MSO on Trees“. In Logic and Games on Automatic Structures, 95–107. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22807-0_7.
Der volle Inhalt der QuelleSkrzypczak, Michał. „Connecting Decidability and Complexity for MSO Logic“. In Developments in Language Theory, 75–79. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-62809-7_4.
Der volle Inhalt der QuelleMorawietz, Frank, und Tom Cornell. „The MSO Logic-Automaton Connection in Linguistics“. In Logical Aspects of Computational Linguistics, 112–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48975-4_6.
Der volle Inhalt der QuelleKaiser, Łukasz. „Cardinality Quantifiers in MSO on Linear Orders“. In Logic and Games on Automatic Structures, 79–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22807-0_6.
Der volle Inhalt der Quellede Oliveira Oliveira, Mateus. „Causality in Bounded Petri Nets is MSO Definable“. In Logic, Language, Information, and Computation, 200–214. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-52921-8_13.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "MSO logic"
Riba, Colin. „Forcing MSO on Infinite Words in Weak MSO“. In 2013 Twenty-Eighth Annual IEEE/ACM Symposium on Logic in Computer Science (LICS 2013). IEEE, 2013. http://dx.doi.org/10.1109/lics.2013.51.
Der volle Inhalt der QuelleCarreiro, Facundo, Alessandro Facchini, Yde Venema und Fabio Zanasi. „Weak MSO“. In CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2603088.2603101.
Der volle Inhalt der QuelleBojanczyk, Mikolaj, Edon Kelmendi und Michal Skrzypczak. „MSO+∇ is undecidable“. In 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2019. http://dx.doi.org/10.1109/lics.2019.8785892.
Der volle Inhalt der QuelleNiewerth, Matthias. „MSO Queries on Trees“. In LICS '18: 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3209108.3209144.
Der volle Inhalt der QuelleLosemann, Katja, und Wim Martens. „MSO queries on trees“. In CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2603088.2603137.
Der volle Inhalt der QuelleDas, Anupam, und Colin Riba. „A Complete Axiomatization of MSO on Infinite Trees“. In 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2015. http://dx.doi.org/10.1109/lics.2015.44.
Der volle Inhalt der QuelleMontanari, Angelo, und Gabriele Puppis. „A Contraction Method to Decide MSO Theories of Deterministic Trees“. In 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007). IEEE, 2007. http://dx.doi.org/10.1109/lics.2007.6.
Der volle Inhalt der QuelleLi, Y., D. H. Kim, A. Kostrzewski und George Eichmann. „Optoelectronic content addressable memory-based modified signed digit arithmetic“. In OSA Annual Meeting. Washington, D.C.: Optica Publishing Group, 1989. http://dx.doi.org/10.1364/oam.1989.tumm3.
Der volle Inhalt der QuelleLimqueco, Johnson Chan, und Saburo Muroga. „Logic optimization of MOS networks“. In the 28th conference. New York, New York, USA: ACM Press, 1991. http://dx.doi.org/10.1145/127601.127713.
Der volle Inhalt der QuelleFlannery, David L., L. Maugh Vail und Steven C. Gustafson. „Circulating Packet Threshold Logic To Implement Msd Logic Modules“. In 30th Annual Technical Symposium, herausgegeben von William J. Miceli. SPIE, 1986. http://dx.doi.org/10.1117/12.976271.
Der volle Inhalt der QuelleBerichte der Organisationen zum Thema "MSO logic"
Küsters, Ralf, und Ralf Molitor. Computing Most Specific Concepts in Description Logics with Existential Restrictions. Aachen University of Technology, 2000. http://dx.doi.org/10.25368/2022.108.
Der volle Inhalt der QuelleBaader, Franz. A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL. Technische Universität Dresden, 2004. http://dx.doi.org/10.25368/2022.139.
Der volle Inhalt der QuellePeñaloza, Rafael, und Anni-Yasmin Turhan. Completion-based computation of most specific concepts with limited role-depth for EL and Prob-EL⁰¹. Technische Universität Dresden, 2010. http://dx.doi.org/10.25368/2022.176.
Der volle Inhalt der QuelleZarrieß, Benjamin, und Anni-Yasmin Turhan. Most Specific Generalizations w.r.t. General EL-TBoxes. Technische Universität Dresden, 2013. http://dx.doi.org/10.25368/2022.196.
Der volle Inhalt der QuelleDistel, Felix. Model-based Most Specific Concepts in Description Logics with Value Restrictions. Technische Universität Dresden, 2008. http://dx.doi.org/10.25368/2022.167.
Der volle Inhalt der Quelle