Информатика и вычислительная техника
  • формат pdf
  • размер 690.8 КБ
  • добавлен 01 ноября 2011 г.
Kaynar D.K., Lynch N., Segala R., Vaandrage F. The Theory of Timed I-O Automata
Издательство Morgan & Claypool, 2006, -114 pp.

This monograph presents the timed input/output automaton (TIOA) modeling framework, a basic mathematical framework to support description and analysis of timed (computing) systems. Timed systems are systems in which desirable correctness or performance properties of the system depend on the timing of events, not just on the order of their occurrence. Timed systems are employed in a wide range of domains including communications, embedded systems, real-time operating systems, and automated control. Many applications involving timed systems have strong safety, reliability, and predictability requirements, which makes it important to have methods for systematic design of systems and rigorous analysis of timing-dependent behavior.
An important feature of the TIOA framework is its support for decomposing timed system descriptions. In particular, the framework includes a notion of exteal behavior for a TIOA, which captures its discrete interactions with its environment. The framework also defines what it means for one TIOA to implement another, based on an inclusion relationship between their exteal behavior sets, and defines notions of simulations, which provide sufficient conditions for demonstrating implementation relationships. The framework includes a composition operation for TIOAs, which respects exteal behavior, and a notion of receptiveness, which implies that a TIOA does not block the passage of time.

Introduction
Mathematical Preliminaries
Describing Timed System Behavior
Timed Automata
Operations on Timed Automata
Timed I/O Automata
Operations on Timed I/O Automata
Conclusions and FutureWork
Похожие разделы
Смотрите также

Bowman H., Gomez R. Concurrency Theory. Calculi and Automata for Modelling Untimed and Timed Concurrent Systems

  • формат pdf
  • размер 1.79 МБ
  • добавлен 03 января 2012 г.
Издательство Springer, 2006, -444 pp. In the world we live in concurrency is the norm. For example, the human body is a massively concurrent system, comprising a huge number of cells, all simultaneously evolving and independently engaging in their individual biological processing. In addition, in the biological world, truly sequential systems rarely arise. However, they are more common when manmade artefacts are considered. In particular, comput...

D?m?si P., Nehaniv C.L. Algebraic Theory of Automata Networks. An Introduction

  • формат pdf
  • размер 13.64 МБ
  • добавлен 03 января 2012 г.
Издательство Springer, 2005, -268 pp. An automata network is a collection of automata connected together according to a directed graph D. The vertices of D are considered as automata and the edges indicate the existence of communication links. Thus D has no parallel edges. Each automaton can change its state at discrete time steps as a local transition function of the states and a global input, and synchronous action of the local state transitio...

Ginzburg A. Algebraic Theory of Automata

  • формат djvu
  • размер 1.89 МБ
  • добавлен 01 ноября 2011 г.
Издательство Academic Press, 1968, -173 pp. This monograph is intended to provide a graduate student and a newcomer to the field with ideas, methods, and results of algebraic theory of automata ; nevertheless, people working in the area may find the book useful, too, especially the chapters about regular expressions and the decomposition theory of Krohn and Rhodes. The book can serve as a text for a one-semester course in Automata Theory. The...

Kobrinskii N.E., Trakhtenbrot B.A. Introduction to the Theory of Finite Automata

  • формат djvu
  • размер 2.09 МБ
  • добавлен 01 ноября 2011 г.
Издательство North Holland, 1963, -342 pp. In recent years, intensive work has been in progress at a number of centres to develop and apply various automatic digital systems for information processing. Such systems form the basis of digital computers, various control devices operating to a specified algorithm, and of models which simulate the activity of a living organism (termed robots). These automata take the form of independent special-purpo...

Lawson M.V. Finite Automata

  • формат pdf
  • размер 5.93 МБ
  • добавлен 27 декабря 2011 г.
Издательство CRC Press, 2004, -326 pp. The theory of finite automata is the mathematical theory of a simple class of algorithms that are important in computer science. Algorithms are recipes that tell us how to solve problems; the rules we learn in school for adding, subtracting, multiplying and dividing numbers are good examples of algorithms. Although algorithms have always been important in mathematics, mathematicians did not spell out precis...

Mikolajczak B. Algebraic and structural automata theory

  • формат djvu
  • размер 2.16 МБ
  • добавлен 01 ноября 2011 г.
Издательство North Holland, 1991, -424 pp. The subject of research in automata theory is a design of mathematical models describing methods of information transformation in digital systems. Automata theory is especially concerned with abstract models of systems working by means of discrete signals, known as digital signals. Special emphasis has been put on digital computers, digital systems of control for technological processes, and digital sys...

Pin J.E. (ed.) Formal Properties of Finite Automata and Applications

  • формат djvu
  • размер 2.38 МБ
  • добавлен 01 ноября 2011 г.
Издательство Springer, 1989, -268 pp. The subject of the sixteenth School is the theory of finite automata and its applications. However two important parts of this theory are not treated in this volume, because they were already the subject of two earlier Spring Schools : "Automata on infinite words" (Spring School 1984) and "Automata Networks" (Spring School 1986). The proceedings have been divided into three sections. The first section is de...

Salomaa A., Wood D., Yu S. (eds.) A Half-Century of Automata Theory. Сelebration and Inspiration

  • формат djvu
  • размер 608.85 КБ
  • добавлен 01 ноября 2011 г.
Издательство World Scientific Publishing, 2001, -164 pp. In the past half century, automata theory has been established as one of the most important foundations of computer science, and its applications have spread to almost all areas of computer science. Research in automata theory and related areas has also reached a crucial point where researchers are searching for new directions. To celebrate the achievements in automata theory in the past h...

Shallit J. A Second Course in Formal Languages and Automata Theory

  • формат pdf
  • размер 1.36 МБ
  • добавлен 14 октября 2011 г.
Издательство Cambridge University Press, 2008, -254 pp. Intended for graduate students and advanced undergraduates in computer science, A Second Course in Formal Languages and Automata Theory treats topics in the theory of computation not usually covered in a first course. After a review of basic concepts, the book covers combinatorics on words, regular languages, context-free languages, parsing and recognition, Turing machines, and other langua...

Xavier S.P.E. Theory of Automata Formal Languages and Computation

  • формат pdf
  • размер 1.89 МБ
  • добавлен 01 ноября 2011 г.
Издательство New Age International, 2005, -360 pp. This book deals with a fascinating and important subject which has the fundamentals of computer hardware, software and some of their applications. This book is intended as an introductory graduate text in computer science theory. I have taken care to present the material very clearly and interestingly. As an introductory subject to computer science, this book has been written with major stress o...