<--- Back to Details
First PageDocument Content
Computer architecture / Computing / Software / Embedded operating systems / Finite automata / Finite-state machine / OSEK / Real-time operating system / Model checking / Kernel / Protection ring / Embedded system
Date: 2016-07-14 16:23:27
Computer architecture
Computing
Software
Embedded operating systems
Finite automata
Finite-state machine
OSEK
Real-time operating system
Model checking
Kernel
Protection ring
Embedded system

Back to the Roots: Implementing the RTOS as a Specialized State Machine Christian Dietrich, Martin Hoffmann, Daniel Lohmann Department of Computer Science 4 - Distributed Systems and Operating Systems Friedrich-Alexander

Add to Reading List

Source URL: www.mpi-sws.org

Download Document from Source Website

File Size: 1,20 MB

Share Document on Facebook

Similar Documents

Finite Horizon Analysis of Markov Automata Dissertation zur Erlangung des akademischen Grades des Doktors der Ingenieurwissenschaften (Dr.-Ing.) der Fakultät für Mathematik und Informatik der Universität des Saarlande

Finite Horizon Analysis of Markov Automata Dissertation zur Erlangung des akademischen Grades des Doktors der Ingenieurwissenschaften (Dr.-Ing.) der Fakultät für Mathematik und Informatik der Universität des Saarlande

DocID: 1xV8b - View Document

Determinism versus Nondeterminism in Two-Way Finite Automata Recent Results around the Sakoda and Sipser Question Giovanni Pighizzini Dipartimento di Informatica

Determinism versus Nondeterminism in Two-Way Finite Automata Recent Results around the Sakoda and Sipser Question Giovanni Pighizzini Dipartimento di Informatica

DocID: 1vnjH - View Document

Math. Appl), 105–122 DOI: maTWO-DIMENSIONAL JUMPING FINITE AUTOMATA S. JAMES IMMANUEL and D. G. THOMAS Abstract. In this paper, we extend a newly introduced concept called the jumping

Math. Appl), 105–122 DOI: maTWO-DIMENSIONAL JUMPING FINITE AUTOMATA S. JAMES IMMANUEL and D. G. THOMAS Abstract. In this paper, we extend a newly introduced concept called the jumping

DocID: 1uXmk - View Document

Simulating Unary Context-Free Grammars and Pushdown Automata with Finite Automata Giovanni Pighizzini Dipartimento di Informatica e Comunicazione Università degli Studi di Milano ITALY

Simulating Unary Context-Free Grammars and Pushdown Automata with Finite Automata Giovanni Pighizzini Dipartimento di Informatica e Comunicazione Università degli Studi di Milano ITALY

DocID: 1uOCl - View Document

Determinism versus Nondeterminism in Two-Way Finite Automata Recent Results around the Sakoda and Sipser Question Giovanni Pighizzini Dipartimento di Informatica

Determinism versus Nondeterminism in Two-Way Finite Automata Recent Results around the Sakoda and Sipser Question Giovanni Pighizzini Dipartimento di Informatica

DocID: 1uNif - View Document