Abstract
We continue the work of Wong and Wonham on discrete-event observers, by specializing their algorithms for general causal reporter maps to natural projections. Unlike the former, a natural projection does not always admit a unique smallest extension to a natural observer. Instead there may exist several minimal extensions to the original observable event set. We show that the problem of finding such a minimal extension is NP-hard. However, we propose a polynomial-time algorithm that always finds some extension to a natural observer. While this is not guaranteed to be minimal, it is in practice often reasonably small.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
