Referenced Items are not available for this document.
This paper presents a specific class of incremental computations adapted for re-evaluation of logic functions in discrete-event systems. Algorithms are divided onto two parts: a dynamic part, which runs online and computes response for an event, and a pre-computation, which prepares the internal data model for a coming event. The common property of the algorithms is their complexity, bounded rather by some function of the number of changed variables than the total number of the function's arguments
Published in:
Control '98. UKACC International Conference on (Conf. Publ. No. 455)
(Volume:1
)
Date of Conference: 1-4 Sep 1998
- Page(s):
- 853 - 858 vol.1
- Meeting Date :
- 01 Sep 1998-04 Sep 1998
- ISSN :
- 0537-9989
- Print ISBN:
- 0-85296-708-X
- INSPEC Accession Number:
- 6208766
- Conference Location :
- Swansea
- Digital Object Identifier :
- 10.1049/cp:19980340
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
