Relevant bibliographies by topics / Abstract State Machine

Academic literature on the topic 'Abstract State Machine'

Author: Grafiati
Published: 10 December 2022
Last updated: 21 February 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Abstract State Machine.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Abstract State Machine"

1

Chiara, Maria Luisa Dalla, Roberto Giuntini, Giuseppe Sergioli, and Roberto Leporini. "Abstract quantum computing machines and quantum computational logics." International Journal of Quantum Information 14, no. 04 (June 2016): 1640019. http://dx.doi.org/10.1142/s0219749916400190.

Full text
Abstract:
Classical and quantum parallelism are deeply different, although it is sometimes claimed that quantum Turing machines are nothing but special examples of classical probabilistic machines. We introduce the concepts of deterministic state machine, classical probabilistic state machine and quantum state machine. On this basis, we discuss the question: To what extent can quantum state machines be simulated by classical probabilistic state machines? Each state machine is devoted to a single task determined by its program. Real computers, however, behave differently, being able to solve different kinds of problems. This capacity can be modeled, in the quantum case, by the mathematical notion of abstract quantum computing machine, whose different programs determine different quantum state machines. The computations of abstract quantum computing machines can be linguistically described by the formulas of a particular form of quantum logic, termed quantum computational logic.
APA, Harvard, Vancouver, ISO, and other styles
2

Németh, Zoltán, and Miklós Kuczmann. "State space modeling theory of induction machines." Pollack Periodica 15, no. 1 (April 2020): 124–35. http://dx.doi.org/10.1556/606.2020.15.1.12.

Full text
Abstract:
Abstract The paper discusses the theoretical background of the state space modeling of induction machines. The main goal is to present the necessary equations of the induction machine and the topic of the state space modeling. Although the induction machine is a highly non-linear system, LPV/qLPV model can be formulated from these equations.
APA, Harvard, Vancouver, ISO, and other styles
3

Oken, Barry, Asieh Ahani, Helane Wahbeh, Hooman Nezamfar, Meghan Miller, Deniz Erdogmus, and Elena Goodrich. "Signal Processing and Machine Learning of EEG and Respiration Changes During Mindfulness Meditation State." Journal of Alternative and Complementary Medicine 20, no. 5 (May 2014): A25. http://dx.doi.org/10.1089/acm.2014.5061.abstract.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hu, Zhonggang. "Research on the Properties of Lattice-Valued Finite State Machines in Computer Technology." Journal of Physics: Conference Series 2066, no. 1 (November 1, 2021): 012063. http://dx.doi.org/10.1088/1742-6596/2066/1/012063.

Full text
Abstract:
Abstract In this paper, we discuss some algebraic properties of Lattice valued finite state machine and prove that if there are homomorphic mapping satisfying certain conditions between two Lattice valued finite state machines, the first one is strongly connected (cycle), then then the second one is the same. And if the homomorphism is strongly homomorphic, one of the Lattice valued finite state machines is complete if and only if another Lattice valued finite state machine is complete. Discuss the completeness, strong connectivity, circulation and exchange capacity between the product of a Lattice valued finite state machine and the original Lattice valued finite state machine and get some results.
APA, Harvard, Vancouver, ISO, and other styles
5

Al-Fedaghi, Sabah. "Toward Understanding Dynamic Behavior in Abstract Machines." International Journal of Knowledge and Systems Science 8, no. 4 (October 2017): 54–72. http://dx.doi.org/10.4018/ijkss.2017100104.

Full text
Abstract:
This article proposes an abstract machine, known by the acronym FM, for modeling behavior currently described by finite state machines (SMs) in conjunction with related notions such as state and event. Although the SM concept was born more than 50 years ago and is widely applied in hardware design, the literature suggests it is not well understood despite its use in other application fields, especially in software system design. Several SM-based examples are remodeled in terms of the proposed machine, and they reveal a richer conception of the dynamic aspects of systems. FM enhances understanding of concepts in control modeling such as states, events, behavior, and control. The article exposes the limitations of unrefined SM features used in modeling software systems. It is suggested that FM be used as a modeling tool in the software system design process.
APA, Harvard, Vancouver, ISO, and other styles
6

Suharsih, Ririn, and Firas Atqiya. "Penerapan Konsep Finite State Automata (FSA) pada Aplikasi Simulasi Vending Machine Yoghurt Walagri." Edsence: Jurnal Pendidikan Multimedia 1, no. 2 (December 13, 2019): 71–78. http://dx.doi.org/10.17509/edsence.v1i2.21778.

Full text
Abstract:
Language theory and automata is a theory that related to abstract machines which in there is Finite State Automata. FSA can be implemented in design of a vending machine. Vending machines in Indonesia operate mostly with products such as canned drinks, plastic bottles, coffee, snacks, and tickets. This research discuss about simulating application design of Walagri Yoghurt vending machine, a yoghurt produced by Biotechnology Departement at the University of Muhammadiyah Bandung, based on the implementation of Finite State Automata. The conclusion obtained in this study is that Finite State Automata can be used as a basic logic for making vending machine simulations.
APA, Harvard, Vancouver, ISO, and other styles
7

Susanto, Susanto, Venny Yulianty, Bobby Suryo Prakoso, Suwanda Suwanda, Windu Gata, and Kresna Ramanda. "Desain Finite State Automata Untuk Merancang Vending Automata Logam Mulia." BINA INSANI ICT JOURNAL 8, no. 2 (December 13, 2021): 113. http://dx.doi.org/10.51211/biict.v8i2.1572.

Full text
Abstract:
Abstrak: Menabung logam mulia merupakan investasi yang dianggap safe haven, ditengah era modern saat ini menabung logam mulia dapat dilakukan dengan cara dicicil, sedangkan yang menjadi masalahnya adalah kekhawatiran ketika fisik logam mulia tidak dapat ditarik fisiknya yang membuat potensi fraud atau investasi bodong yang sedang marak saat ini, untuk mengatasi masalah itu penjualan logam mulia dapat dikembangkan menjadi lebih menarik dengan vending machine, untuk memperdalam pemahaman mengenai salah satu model komputasi yang mendasar dan pengenalan Internet of Things (IoT), desain vending machine ini akan menggunakan metode finite state automata (FSA). Dengan desain finite state automata, penelitian ini telah menghasilkan desain vending machine logam mulia berbasis Internet of Things (IoT) dari cara login ke vending machine sampai fisik logam mulia dapat diterima. Produk penjualan logam mulia dengan menggunakan vending machine ini diharapkan dapat menjangkau masyarakat lebih luas untuk berinvestasi, khususnya logam mulia. Kata kunci: Internet of Things, logam mulia, vending machine Abstract: Saving gold is an investment that is considered a safe haven, in the midst of today's modern era saving gold can be done in installments, while the problem is the concern when the physical gold cannot be physically withdrawn which creates the potential for fraud or fraudulent investments that are currently rampant. to overcome this problem the sale of precious metals can be developed to be more attractive with vending machines, to deepen understanding of one of the fundamental computing models and the introduction of the Internet of Things (IoT), this vending machine design will use the finite state automata (FSA) method. With the design of finite state automata (FSA), this research has resulted in the design of a gold vending machine based on the Internet of Things (IoT) from how to login to the vending machine until the gold is physically acceptable. The product selling gold using vending machines is expected to reach a wider audience to invest, especially gold. Keywords: Internet of Things, precious metals, vending machine
APA, Harvard, Vancouver, ISO, and other styles
8

Schüssler, Max. "Machine learning with nonlinear state space models." at - Automatisierungstechnik 70, no. 11 (October 27, 2022): 1027–28. http://dx.doi.org/10.1515/auto-2022-0089.

Full text
Abstract:
Abstract In this dissertation, a novel class of model structures and associated training algorithms for building data-driven nonlinear state space models is developed. The new identification procedure with the resulting model is called local model state space network (LMSSN). Furthermore, recurrent neural networks (RNNs) and their similarities to nonlinear state space models are elaborated on. The overall outstanding performance of the LMSSN is demonstrated on various applications.
APA, Harvard, Vancouver, ISO, and other styles
9

MORALES, JOSÉ F., MANUEL CARRO, and MANUEL HERMENEGILDO. "Description and Optimization of Abstract Machines in a Dialect of Prolog." Theory and Practice of Logic Programming 16, no. 1 (January 5, 2015): 1–58. http://dx.doi.org/10.1017/s1471068414000672.

Full text
Abstract:
AbstractIn order to achieve competitive performance, abstract machines for Prolog and related languages end up being large and intricate, and incorporate sophisticated optimizations, both at the design and at the implementation levels. At the same time, efficiency considerations make it necessary to use low-level languages in their implementation. This makes them laborious to code, optimize, and, especially, maintain and extend. Writing the abstract machine (and ancillary code) in a higher-level language can help tame this inherent complexity. We show how the semantics of most basic components of an efficient virtual machine for Prolog can be described using (a variant of) Prolog. These descriptions are then compiled to C and assembled to build a complete bytecode emulator. Thanks to the high-level of the language used and its closeness to Prolog, the abstract machine description can be manipulated using standard Prolog compilation and optimization techniques with relative ease. We also show how, by applying program transformations selectively, we obtain abstract machine implementations whose performance can match and even exceed that of state-of-the-art, highly-tuned, hand-crafted emulators.
APA, Harvard, Vancouver, ISO, and other styles
10

Пенкин, Юрий Михайлович, and Алина Александровна Федосеева. "СТРУКТУРНЫЕ КОНЕЧНЫЕ АВТОМАТЫ В ВИДЕ ТЕНЗОРОВ ТРЕТЬЕГО РАНГА ТИПА СУДОКУ." RADIOELECTRONIC AND COMPUTER SYSTEMS, no. 4 (December 25, 2019): 79–87. http://dx.doi.org/10.32620/reks.2019.4.09.

Full text
Abstract:
The construction concept and general principles of the operation of a new kind of finite state machine are presented, for which the input and output elements are panels of square matrices, and the transitions between their states are determined by numerical tensors of the third rank. In this case, the structure of the tensors is specified in the form of cubic grids, in whose cells' natural numbers are located according to the principle of Sudoku construction. An algorithm for constructing such tensors of arbitrary size is indicated. The structures of tensors constructed using ranked sets of natural numbers are defined as standard. It is shown that the possibility of determining Sudoku type tensors using a one-dimensional parameter is basic for the manifestation of their functional self-similarity. The property of additive conservation of the structure of numerical tensors of the third rank to the requirements of Sudoku is formulated as a theorem. It is proved that the tensor obtained by summing an arbitrary tensor structure and a constant, taking into account the introduced cyclic ranking rule, satisfies the general requirements of Sudoku. The problems of abstract and structural synthesis of finite state machine based on the analyzed tensor structures are considered. In this case, the task of abstract synthesis has traditionally been defined as the creation of a mathematical model of an automaton, and the task of structural synthesis is just the development of its functional logical scheme. Based on the ambiguity of the function of the output of the finite state machine, the possibility of the simultaneous use of several different output alphabets is substantiated. The modes of functioning of the minimal finite state machine of the proposed type are described by the example of an initial state machine with a distinguished standard initial state. In the general case, it is shown that the finite state machines defined on the group of these requirements can be attributed to generalized first-order finite-state machines (or Mealy machines) with a multi-valued output. The features of network applications of structural automata are presented. Variants of possible applications of the considered finite state machines are analyzed.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Abstract State Machine"

1

Angrand, Pierre-Yves. "Contributions à l'étude de la dérivation des expressions rationnelles et à l'étude des systèmes de numération abstraits." Phd thesis, Télécom ParisTech, 2012. http://pastel.archives-ouvertes.fr/pastel-00850633.

Full text
Abstract:
Les travaux de cette thèse s'inscrivent dans la théorie des automates et des langages formels. ils peuvent se diviser en deux parties qui donnent également deux visions différentes de manipuler les langages dans la théorie des automates. La première partie s'intéresse à la notion de dérivation des expressions qui permet de faire passer le formalisme des quotients de langages au niveau des expressions rationnelles. en particulier cette thèse étudie les termes dérivés cassés d'une expression rationnelle. ces termes dérivés cassés permettent, sous certaines circonstances, et à l'aide d'autres opérations, une réversibilité de la transformation d'un automate en une expression rationnelle. Dans la seconde partie, la théorie des automates est utilisée pour traiter des problèmes sur les systèmes de numération. les systèmes de numération représentent des nombres par des mots. il est possible d'utiliser des automates et des transducteurs afin d'être capable de 'compter' sur un langage rationnel représentant les entiers. plus précisément ces automates sont étudiés pour le cas des systèmes de numération abstraits qui associent à chaque entier un mot d'un langage rationnel, ordonné par l'ordre radiciel. dans un tel système, la fonction qui permet de calculer le mot suivant est une fonction co-séquentielle par morceaux, c'est-à-dire qu'il suffit de lire deux fois le mot d'entrée de la droite vers la gauche pour qu'une machine calcule son image.
APA, Harvard, Vancouver, ISO, and other styles
2

Nanchen, Stanislas. "Verifying abstract state machines /." Zürich : ETH, 2007. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=17489.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Winter, Kirsten. "Model checking abstract state machines." [S.l.] : [s.n.], 2001. http://deposit.ddb.de/cgi-bin/dokserv?idn=963050001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Murrell, Stephen. "State transition specifications of abstract machines." Thesis, University of Oxford, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.235081.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Schmid, Joachim. "Refinement and implementation techniques for Abstract State Machines." Ulm : Universität Ulm, Fakultät für Informatik, 2002. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB9967024.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

BONFANTI, Silvia (ORCID:0000-0001-9679-4551). "Rigorous Model-based Development of Programmable Electronic Medical Systems (PEMS): from Requirements to Code." Doctoral thesis, Università degli studi di Bergamo, 2017. http://hdl.handle.net/10446/77230.

Full text
Abstract:
Programmable Electronic Medical Systems (PEMS) are safety-critical system. They have effects on people health and, in case of malfunctions, they can seriously compromise human safety. For this reason, the software installed on these devices must be guaranteed through rigorous processes to assure safety and reliability. Moreover, correct operation of a medical device depends upon the controlling software, whose development should adhere to certification standards. The rigorous process presented in this thesis is based on the Abstract State Machines (ASMs) formal method, a mathematically based technique for the specification, analysis and development of software systems. The ASM formal approach proposes an incremental life cycle model for software development based on model refinement. It covers the main software engineering activities (specification, validation, verification, conformance checking), and it is supported by a wide range of tools which are part of the Asmeta (ASM mETAmodeling) framework. In this thesis, the ASM development approach and its supporting Asmeta framework are used to propose a rigorous development process for PEMS. The final goal is to provide a process able to guarantee the development of correct and controllable systems in a correct and controllable way. The definition of this process has leaded to some improvements of the method, mainly regarding the textual and graphical notations, and the automatic code generation from models. A new rigorous notation, Unified Syntax for Abstract State Machine (UASM), has been defined to provide a stable language kernel for ASMs. Formal models are not widely used in practice, since they are considered difficult to develop and understand. For this reason, we here make a proposal of a tool for a graphical representation of ASM models in order to increase the readability. Moreover, we have devised a methodology to generate the desired source code from ASM models. The tool automatically translates the formal specification into the target code (C++ for Arduino in the present case) and it keeps true the system behavior and the properties verified during validation and verification. The hemodialysis machine and the stereoacuity test are used as real case studies to show the applicability and effectiveness of the ASM-based development process in the area of PEMS.
APA, Harvard, Vancouver, ISO, and other styles
7

Schmid, Joachim [Verfasser]. "Refinement and implementation techniques for Abstract State Machines / Joachim Schmid." Ulm : Universität Ulm. Fakultät für Informatik, 2002. http://d-nb.info/1015323995/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Patel, Hiren Dhanji. "Ingredients for Successful System Level Automation & Design Methodology." Diss., Virginia Tech, 2007. http://hdl.handle.net/10919/26825.

Full text
Abstract:
This dissertation addresses the problem of making system level design (SLD) methodology based on SystemC more useful to the complex embedded system design community by presenting a number of ingredients currently absent in the existing SLD methodologies and frameworks. The complexity of embedded systems have been increasing at a rapid rate due to proliferation of desired functionality of such systems (e.g., cell phones, game consoles, hand-held devices, etc., are providing more features every few months), and the device technology still riding the curve predicted by Moore's law. Design methodology is shifting slowly towards system level design (also called electronic system level (ESL)). A number of SLD languages and supporting frameworks are being proposed. SystemC is positioned as being one of the dominant SLD languages. The various design automation tool vendors are proposing frameworks for supporting SystemC-based design methodologies. We believe that compared to the necessity and potential of ESL, the success of the frameworks have been limited due to lack of support for a number of facilities and features in the languages and tool environments. This dissertation proposes, formulates, and provides proof of concept demonstrations of a number of ingredients that we have identified as essential for efficient and productive use of SystemC-based tools and techniques. These are heterogeneity in the form of multiple models of computation, behavioral hierarchy in addition to structural hierarchy, model-driven validation for SystemC designs and a service-oriented tool integration environment. In particular, we define syntactic extensions to the SystemC language, semantic modifications, and simulation algorithms, precise semantics for model based validation etc. For each of these we provide reference implementation for further experimentation on the utility of these extensions.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
9

Menar, Martin von Löwis of. "Formale Semantik des Datentypmodells von SDL-2000." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2003. http://dx.doi.org/10.18452/15005.

Full text
Abstract:
Mit der aktuellen Überarbeitung der Sprache SDL (Specification and Description Language) der ITU-T wurde die semantische Fundierung der formalen Definition dieser Sprache vollständig überarbeitet; die formale Definition basiert nun auf dem Kalkül der Abstract State Machines (ASMs). Ebenfalls neu definiert wurde das um objekt-orientierte Konzepte erweiterte Datentypsystem. Damit musste eine formale semantische Fundierung für diese neuen Konzepte gefunden werden. Der bisher verwendete Kalkül ACT.ONE sollte nicht mehr verwendet werden, da er schwer verwendbar, nicht implementierbar und nicht auf Objektsysteme erweiterbar ist. In der vorliegenden Arbeit werden die Prinzipien einer formalen Sprachdefinition dargelegt und die Umsetzung dieser Prinzipien für die Sprache SDL-2000 vorgestellt. Dabei wird erläutert, dass eine konsistente Sprachdefinition nur dadurch erreicht werden konnte, dass die Definition der formalen Semantik der Sprache parallel mit der Entwicklung der informalen Definition erfolgte. Dabei deckt die formale Sprachdefinition alle Aspekte der Sprache ab: Syn-tax, statische Semantik und dynamische Semantik. Am Beispiel der Datentypsemantik wird erläutert, wie jeder dieser Aspekte informal beschrieben und dann formalisiert wurde. Von zentraler Rolle für die Anwendbarkeit der formalen Semantikdefinition in der Praxis ist der Einsatz von Werkzeugen. Die Arbeit erläutert, wie aus der formalen Sprachdefinition voll-automatisch ein Werkzeug generiert wurde, das die Sprache SDL implementiert, und wie die durch die Umsetzung der formalen Semantikdefinition in ein Werkzeug Fehler in dieser Definition aufgedeckt und behoben werden konnten.
With the latest revision of ITU-T SDL (Specification and Description Language), the semantic foundations of the formal language definition were completely revised; the formal definition is now based on the calculus of Abstract State Machines (ASMs). In addition, the data type system of SDL was revised, as object-oriented concepts were added. As a result, a new semantical foundation for these new concepts had to be defined. The ACT.ONE calculus that had been used so far was not suitable as a foundation any more, as it is hard to use, unimplementable and not extensible for the object oriented features. In this thesis, we elaborate the principles of a formal language definition, and the realisation of these principles in SDL-2000. We explains that a consistent language definition can only be achieved by developing the formal semantics definition in parallel with the development of the informal definition. The formal language definition covers all aspects of the language: syntax, static semantics, and dynamic semantics. Using the data type semantics as an example, we show how each of these aspects is informally described, and then formalized. For the applicability of the formal semantics definition for practitioners, usage of tools plays a central role. We explain how we transform the formal language definition fully automatically into a tool that implements the language SDL. We also explain how creating the tool allowed us to uncover and correct errors in the informal definition.
APA, Harvard, Vancouver, ISO, and other styles
10

Aspen, Said. "Determining the feasibility of automatically translating SMILE to a Java framework." Thesis, Linköping University, Department of Computer and Information Science, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-15789.

Full text
Abstract:

 

MTsim (Mobile Traffic Simulator) is an Ericsson AB internal software application that is part of 2Gsim. It is used to simulate elements of a GSM (Global System for Mobile communications) network for feature testing and automated testing. It is written in the programming language TSS Language, also known as SMILE which is a proprietary Ericsson programming language. SMILE is based on the principles of state matrix programming which in essence means that each program is on its own a finite state machine. The language is old and was originally intended as a macro language for smaller test programs, not for applications the size of MTsim.

It is of interest to evaluate the feasibility of performing an automatic conversion of applications written in SMILE, with special interest in converting MTsim, to a Java framework since Java has many advantages compared to SMILE. Java, as a language, is well suited for larger applications, there are numerous well supported tools and there is a much wider spread competence than there is for SMILE.

It is clear that in order to do a full conversion of a SMILE program to a Java framework two applications must be implemented. First a Java framework, which acts as a run time environment, must be designed which can host the translated programs. The other part is an actual translator which takes a SMILE program as input and ouputs a translated Java program. A more sophisticated framework is preferred since it makes the actual translated programs more light weight and easy to read which means higher degree of maintainability.

There are different ways to implement state machines in Java but the most flexible and versatile is to implement it as a black-box framework in an object oriented way where the framework has sophisticated mechanisms for message and event handling which is central to any state machine framework.

The translation for SMILE can easily be done by using a AST (abstract syntax tree) representation, which is a full representation of the SMILE program in tree-form. The AST is obtained from an intermediate state of the SMILE program compiler.

 

APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Abstract State Machine"

1

Glausch, A. Distributed abstract state machines and their expressive power. Berlin: Humblot-Universität zu Berlin, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Glausch, A. On the expressive power of unbounded-nondeterministic abstract state machines. Berlin: Humboldt-Universität zu Berlin, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

ASM 2004 (2004 Wittenberg, Saxony-Anhalt, Germany). Abstract state machines 2004: Advances in theory and practice : 11th international workshop, ASM 2004, Lutherstadt Wittenberg, Germany, May 24-28, 2004 : proceedings. Berlin: Springer, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Börger, Egon, and Robert Stärk. Abstract State Machines. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-642-18216-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Börger, Egon, Angelo Gargantini, and Elvinia Riccobene, eds. Abstract State Machines 2003. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-36498-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Börger, Egon, Michael Butler, Jonathan P. Bowen, and Paul Boca, eds. Abstract State Machines, B and Z. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-87603-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gurevich, Yuri, Philipp W. Kutter, Martin Odersky, and Lothar Thiele, eds. Abstract State Machines - Theory and Applications. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44518-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Frappier, Marc, Uwe Glässer, Sarfraz Khurshid, Régine Laleau, and Steve Reeves, eds. Abstract State Machines, Alloy, B and Z. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11811-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Reisig, Wolfgang. Abstract state machines for the classroom: The basics. Berlin: Professoren des Institutes für Informatik, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Derrick, John, John Fitzgerald, Stefania Gnesi, Sarfraz Khurshid, Michael Leuschel, Steve Reeves, and Elvinia Riccobene, eds. Abstract State Machines, Alloy, B, VDM, and Z. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30885-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Abstract State Machine"

1

Stärk, Robert F., Joachim Schmid, and Egon Börger. "Abstract State Machines." In Java and the Java Virtual Machine, 15–28. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-642-59495-3_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Yaghoubi Shahir, Hamed, Roozbeh Farahbod, and Uwe Glässer. "Refactoring Abstract State Machine Models." In Abstract State Machines, Alloy, B, VDM, and Z, 345–48. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30885-7_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dobrowolski, Grzegorz. "Programming an Agent as Abstract State Machine." In Multi-Agent Systems and Applications IV, 173–82. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11559221_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Reynolds, Mark C. "Lightweight Modeling of Java Virtual Machine Security Constraints." In Abstract State Machines, Alloy, B and Z, 146–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11811-1_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lerchner, Harald. "An Abstract State Machine Interpreter for S-BPM." In S-BPM in the Wild, 219–33. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-17542-3_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zenzaro, Simone, Vincenzo Gervasi, and Jacopo Soldani. "WebASM: An Abstract State Machine Execution Environment for the Web." In Lecture Notes in Computer Science, 216–21. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-43652-3_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Covino, Emanuele, and Giovanni Pani. "Analysis of Mobile Networks’ Protocols Based on Abstract State Machine." In Logic, Computation and Rigorous Methods, 187–98. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-76020-5_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bonfanti, Silvia, Angelo Gargantini, and Atif Mashkoor. "Validation of Transformation from Abstract State Machine Models to C++ Code." In Testing Software and Systems, 17–32. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-99927-2_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Paulweber, Philipp, Emmanuel Pescosta, and Uwe Zdun. "Structuring the State and Behavior of ASMs: Introducing a Trait-Based Construct for Abstract State Machine Languages." In Rigorous State-Based Methods, 237–43. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-48077-6_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

De Felice, Fabio, Alessandro Bianchi, and Fabio Abbattista. "Modelling Multimodal 3D Virtual Environments with Asynchronous Multi-Agent Abstract State Machine." In Knowledge-Based and Intelligent Information and Engineering Systems, 249–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23851-2_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Abstract State Machine"

1

Börger, Egon, and Albert Fleischmann. "Abstract state machine nets." In S-BPM ONE '15: 7th International Conference on Subject-Oriented Business Process Management. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2723839.2723840.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Guha, Dipnarayan, Jun Kyun Choi, and Qonita Muhammad Shahab. "Abstract state machine based next generation IPv6 network." In Proceedings. ITCC 2005 International Conference on Information Technology: Coding and Computing. IEEE, 2005. http://dx.doi.org/10.1109/itcc.2005.56.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Wagner, Gerd. "An abstract state machine semantics for discrete event simulation." In 2017 Winter Simulation Conference (WSC). IEEE, 2017. http://dx.doi.org/10.1109/wsc.2017.8247830.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kirchberg, Markus. "Abstract State Machine Models for Basic Service-Oriented Architectures." In 2008 IEEE Asia-Pacific Services Computing Conference (APSCC). IEEE, 2008. http://dx.doi.org/10.1109/apscc.2008.21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Yang, Zhibin, Kai Hu, Dianfu Ma, Lei Pi, and Jean-Paul Bodeveix. "Formal semantics and verification of AADL modes in Timed Abstract State Machine." In 2010 International Conference on Progress in Informatics and Computing (PIC). IEEE, 2010. http://dx.doi.org/10.1109/pic.2010.5687996.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sasaki, Hisashi. "A formal semantics for Verilog-VHDL simulation interoperability by abstract state machine." In the conference. New York, New York, USA: ACM Press, 1999. http://dx.doi.org/10.1145/307418.307520.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Raihan, Mohammad, and Mohammad Zulkernine. "AsmLSec: An Extension of Abstract State Machine Language for Attack Scenario Specification." In The Second International Conference on Availability, Reliability and Security (ARES'07). IEEE, 2007. http://dx.doi.org/10.1109/ares.2007.45.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kim, Eunseob, Huitaek Yun, Martin Byung-Guk Jun, Kyunghyun Kim, and Suk Won Cha. "Multiple Sound Sensors And Fusion In Modern CNN-Based Machine State Prediction." In ASME 2021 16th International Manufacturing Science and Engineering Conference. American Society of Mechanical Engineers, 2021. http://dx.doi.org/10.1115/msec2021-64036.

Full text
Abstract:
Abstract In the new era of manufacturing with Industry 4.0, Smart Manufacturing (SM) is growing in popularity as a potential for the factory of the future. A critical component of SM is effective machine monitoring. Legacy machines indirect monitoring using Internet of Things (IoT) sensors are preferred instead of modifying hardware directly. Machine tools are composed of rotary components, resulting in machine tools emitting acoustic and vibratory signals. However, sound data cannot easily function as a direct representation for machine status due to its noise, variable time course, and irregular sampling. In this paper, we attempt to bridge this gap through machine learning techniques and auditory monitoring of auxiliary components (i.e., coolant, chip conveyor, and mist collector) as well as the main spindle running state of machine tools. Multi-label classification and Convolutional Neural Network (CNN) were utilized to train models for monitoring machine tools from the sound features. An external microphone and three internal sound sensors were attached to both mill and lathe machines. As a sound feature, Mel-frequency cepstrum (MFCC) features were extracted. The classification task performance was compared between each sensor location and early sensor fusion. The results showed that the sensor fusion approach resulted in the highest F1 score on both machine system.
APA, Harvard, Vancouver, ISO, and other styles
9

Kubovy, Jan, Dagmar Auer, Josef Kung, and Mariam Rady. "Transition between Different Abstraction Levels in an Abstract State Machine (ASM) Ground Model." In 2013 24th International Workshop on Database and Expert Systems Applications (DEXA). IEEE, 2013. http://dx.doi.org/10.1109/dexa.2013.29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Savage, Jesus, Rodrigo Savage, Marco Morales-Aguirre, and Angel Kuri-Morales. "Adaptive FPGA-based robotics state machine architecture derived with genetic algorithms (abstract only)." In the ACM/SIGDA international symposium. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2145694.2145746.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Abstract State Machine' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography