Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Electronic digital computers --- Fault-tolerant computing --- Logic design --- Sequential machine theory --- Ordinateurs --- Tolérance aux fautes (informatique) --- Structure logique. --- Machines séquentielles, Théorie des. --- Design and construction --- Conception et construction. --- Tolérance aux fautes (informatique) --- Machines séquentielles, Théorie des.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

621.313 --- 621.377 --- 621.377 Delay devices. Electric information storage devices (stores) --- Delay devices. Electric information storage devices (stores) --- 621.313 Electric machines --- Electric machines --- Sequential machine theory --- Machines séquentielles, théorie des --- elektrotechniek --- elektrische machines --- Electrical engineering --- Machines séquentielles, Théorie des. --- SEQUENTIAL MACHINES --- FINITE AUTOMATA --- SEQUENTIAL CIRCUITS --- ELECTRICAL ENGINEERING --- BINARY MACHINES --- Monograph --- Sequential machine theory. --- Sequential circuits. --- Electrical engineering. --- Electric engineering --- Engineering --- Circuits, Sequential --- Sequential logic circuits --- Logic circuits --- Finite automata --- Finite state machines (Machine theory) --- Machine theory --- Electronic digital computers --- Machines séquentielles, Théorie des.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Parallelism or concurrency is one of the fundamental concepts in computer science. But in spite of its importance, theoretical methods to handle concurrency are not yet sufficiently developed. This volume presents a comprehensive study of Mazurkiewicz' trace theory from an algebraic-combinatorial point of view. This theory is recognized as an important tool for a rigorous mathematical treatment of concurrent systems. The volume covers several different research areas, and contains not only known results but also various new results published nowhere else. Chapter 1 introduces basic concepts. Chapter 2 gives a straight path to Ochmanski's characterization of recognizable trace languages and to Zielonka's theory of asynchronous automata. Chapter 3 applies the theory of traces to Petri nets. A kind of morphism between nets is introduced which generalizes the concept of synchronization. Chapter 4 provides a new bridge between the theory of string rewriting and formal power series. Chapter 5 is an introduction to a combinatorial theory of rewriting on traces which can be used as an abstract calculus for transforming concurrent processes.

Formal languages --- Formele talen --- Languages [Formal ] --- Langues formalisées --- Machines sequentielles [Theorie des ] --- Sequential machine theory --- Sequentiele machinetheorie --- Talen [Formele ] --- 681.3*F --- Finite automata --- Finite state machines (Machine theory) --- Machine theory --- Electronic digital computers --- Formalization (Linguistics) --- Language and languages --- Theory of computation --- 681.3*F Theory of computation --- Sequential machine theory. --- Formal languages. --- Information theory. --- Computer science. --- Logic design. --- Theory of Computation. --- Discrete Mathematics. --- Mathematical Logic and Formal Languages. --- Logics and Meanings of Programs. --- Programming Techniques. --- Programming Languages, Compilers, Interpreters. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Informatics --- Science --- Communication theory --- Communication --- Cybernetics