Test environment running 7.6.6

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Diagnosers and diagnosability of succinct transition systems

Date

Authors

Rintanen, Jussi

Publisher

Carnegie Mellon University

Abstract

Reasoning about the knowledge of an agent is an important problem in many areas of AI. For example in diagnosis a basic question about a system is whether it is possible to diagnose it, that is, whether it is always possible to know whether a faulty behav

Keywords

Keywords: Decision problems; Diagnosability; Number of state; On-line diagnosis; Polynomial-time; PSPACE-complete; System representation; Transition system; Artificial intelligence; Polynomial approximation; Automata theory

URI

http://hdl.handle.net/1885/29220

Collections

Open Access Research

Source

Proceedings of the International Joint Conference on Artificial Intelligence

Type

Conference paper

Restricted until

2037-12-31

Downloads

File

Description

01_Rintanen_Diagnosers_and_diagnosability_2007.pdf (233.08 KB)

02_Rintanen_Diagnosers_and_diagnosability_2007.pdf (43.92 KB)

03_Rintanen_Diagnosers_and_diagnosability_2007.pdf (25.91 KB)

04_Rintanen_Diagnosers_and_diagnosability_2007.pdf (347.09 KB)