pickabook books with huge discounts for everyone
pickabook books with huge discounts for everyone
Visit our new collection website www.collectionsforschool.co.uk
     
Email: Subscribe to news & offers:
Need assistance? Log In/Register


Item Details
Title: THE THEORY OF TIMED I/O AUTOMATA
By: Dilsun Kaynar, Nancy A. Lynch, Roberto Segala
Format: Paperback

List price: £40.95


We believe that this item is permanently unavailable, and so we cannot source it.

ISBN 10: 1608450023
ISBN 13: 9781608450022
Publisher: MORGAN & CLAYPOOL PUBLISHERS
Pub. date: 15 November, 2010
Edition: 2nd Revised edition
Series: Synthesis Lectures on Distributed Computing Theory
Pages: 137
Description: Presents the Timed Input/Output Automaton (TIOA) modelling framework, a basic mathematical framework to support description and analysis of timed (computing) systems. Timed systems are employed in a wide range of domains including communications, embedded systems, real-time operating systems, and automated control.
Synopsis: 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 make it important to have methods for systematic design of systems and rigorous analysis of timing-dependent behavior. The TIOA framework also supports description and analysis of timed distributed algorithms -- distributed algorithms whose correctness and performance depend on the relative speeds of processors, accuracy of local clocks, or communication delay bounds. Such algorithms arise, for example, in traditional and wireless communications, networks of mobile devices, and shared-memory multiprocessors.The need to prove rigorous theoretical results about timed distributed algorithms makes it important to have a suitable mathematical foundation. An important feature of the TIOA framework is its support for decomposing timed system descriptions. In particular, the framework includes a notion of external behavior for a timed I/O automaton, 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 external 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 external behavior, and a notion of receptiveness, which implies that a TIOA does not block the passage of time. The TIOA framework also defines the notion of a property and what it means for a property to be a safety or a liveness property. It includes results that capture common proof methods for showing that automata satisfy properties.
Illustrations: black & white illustrations
Publication: US
Imprint: Morgan & Claypool Publishers
Returns: Non-returnable
Some other items by this author:
ALGORITHMIC FOUNDATIONS OF COMMUNICATION IN RADIO NETWORKS (PB)
ATOMIC TRANSACTIONS (HB)
ATOMIC TRANSACTIONS: IN CONCURRENT AND DISTRIBUTED SYSTEMS
COMMUNICATION AND AGREEMENT ABSTRACTIONS FOR FAULT-TOLERANT ASYNCHRONOUS DISTRIBUTED SYSTEMS (PB)
COOPERATIVE TASK-ORIENTED COMPUTING (PB)
DISTRIBUTED ALGORITHMS (HB)
DISTRIBUTED ALGORITHMS (PB)
DISTRIBUTED COMPUTING (PB)
FAULT-TOLERANT AGREEMENT IN SYNCHRONOUS MESSAGE-PASSING SYSTEMS (PB)
HYBRID SYSTEMS, COMPUTATION AND CONTROL (PB)
K-SET CONSENSUS AND THE CONSENSUS HIERARCHY (PB)
KNOWLEDGE IN DISTRIBUTED SYSTEMS (PB)
LINK REVERSAL ALGORITHMS (PB)
LOWER BOUNDS FOR DISTRIBUTED COMPUTING (PB)
PRINCIPLES OF TRANSACTIONAL MEMORY (PB)
PROCESS ALGEBRA AND PROBABILISTIC METHODS: PERFORMANCE MODELING AND VERIFICATION (PB)
RANDOMIZED SMOOTHING NETWORKS (PB)
REDUCTIONS AND SIMULATIONS IN DISTRIBUTED COMPUTING (PB)
STUDY GUIDE AND POWER NOTES (PB)
STUDY GUIDE AND POWERNOTES FOR FINANCIAL ACCOUNTING (PB)
THE THEORY OF TIMED I/O AUTOMATA
THE THEORY OF TIMED I/O AUTOMATA (PB)
THE THEORY OF TIMED I/O AUTOMATA, SECOND EDITION
THEORY OF TIMED I/O AUTOMATA, SECOND EDITION

TOP SELLERS IN THIS CATEGORY
OCR AS and A Level Computer Science (Paperback)
PG Online Limited
Our Price : £32.30
more details
BTEC First in I&CT Revision Workbook (Paperback)
By:
Pearson Education Limited
Our Price : £5.54
more details
Algorithms to Live By (Paperback)
HarperCollins Publishers
Our Price : £8.02
more details
Revise BTEC National Computing Revision Workbook (Paperback)
By:
Pearson Education Limited
Our Price : £20.34
more details
A Gentle Introduction to Effective Computing in Quantitative Research (Hardback)
MIT Press Ltd
Our Price : £38.40
more details
BROWSE FOR BOOKS IN RELATED CATEGORIES
 COMPUTING AND INFORMATION TECHNOLOGY
 general theory of computing


Information provided by www.pickabook.co.uk
SHOPPING BASKET
  
Your basket is empty
  Total Items: 0
 






Early Learning
Little Worried Caterpillar (PB) Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
add to basket

Early Learning
add to basket

Picture Book
All the Things We Carry PB What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
add to basket