{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/132709"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/132709","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Reasoning under partial observability in heterogeneous networked systems","abstract":"Networked systems are collections of interconnected devices and software components that communicate to provide coordinated functionality, such as sensing, control, data processing, and access enforcement. Many everyday services rely on such systems, including building automation, cloud applications, industrial monitoring, and connected medical or sensor devices. In these systems, overall behavior is shaped by configuration choices, such as access rules, control logic, and communication settings, and by how these choices interact across components. Small configuration mistakes or unintended rule interactions can therefore lead to serious safety or security problems. These systems are often assembled from components developed independently and are not always fully observable during operation, which makes it difficult to determine whether the system as a whole behaves correctly and safely. This thesis addresses the problem of reasoning about correctness, safety, and redundancy in configured networked systems under uncertainty. It argues that this problem can be addressed by introducing a common, easy-to-use semantic layer into which heterogeneous configurations can be compiled, and which explicitly supports the representation of incomplete information. Such a semantic layer enables sound, system-wide reasoning over the set of possible behaviors consistent with what is known about the system. To realize this approach, the thesis leverages conditional tables, a database-inspired representation for incomplete information. Conditional tables provide a unifying symbolic abstraction for modeling heterogeneous data and control logic while explicitly encoding uncertainty. Within this framework, properties such as safety, policy compliance, and reachability can be expressed as declarative queries and evaluated soundly under partial observability. The same representation supports semantic minimization, allowing complex systems to be reduced to smaller models that preserve behaviors of interest. A prototype implementation demonstrates that conditional-table–based reasoning is practical and scales to realistic networked scenarios under typical deployment sizes.","abstract_html":"Networked systems are collections of interconnected devices and software components that communicate to provide coordinated functionality, such as sensing, control, data processing, and access enforcement. Many everyday services rely on such systems, including building automation, cloud applications, industrial monitoring, and connected medical or sensor devices. In these systems, overall behavior is shaped by configuration choices, such as access rules, control logic, and communication settings, and by how these choices interact across components. Small configuration mistakes or unintended rule interactions can therefore lead to serious safety or security problems. These systems are often assembled from components developed independently and are not always fully observable during operation, which makes it difficult to determine whether the system as a whole behaves correctly and safely. This thesis addresses the problem of reasoning about correctness, safety, and redundancy in configured networked systems under uncertainty. It argues that this problem can be addressed by introducing a common, easy-to-use semantic layer into which heterogeneous configurations can be compiled, and which explicitly supports the representation of incomplete information. Such a semantic layer enables sound, system-wide reasoning over the set of possible behaviors consistent with what is known about the system. To realize this approach, the thesis leverages conditional tables, a database-inspired representation for incomplete information. Conditional tables provide a unifying symbolic abstraction for modeling heterogeneous data and control logic while explicitly encoding uncertainty. Within this framework, properties such as safety, policy compliance, and reachability can be expressed as declarative queries and evaluated soundly under partial observability. The same representation supports semantic minimization, allowing complex systems to be reduced to smaller models that preserve behaviors of interest. A prototype implementation demonstrates that conditional-table–based reasoning is practical and scales to realistic networked scenarios under typical deployment sizes.","abstract_has_math":false,"creators":["Anwar, Mubashir"],"institution":"University of Illinois Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Caesar, Matthew"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2025,"date_issued":"2025-12","date_published":"2025-12","updated_at":"2026-07-22T22:25:07Z","subjects":["Heterogeneous networked systems","Reasoning under uncertainty","Declarative verification"],"languages":["en"],"rights":["Copyright 2025 Mubashir Anwar"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/2142/132709","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Caesar, Matthew"]},{"key":"dc:creator","label":"Author","values":["Anwar, Mubashir"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2025-12","2025-12-11"]},{"key":"dc:type","label":"Dc Type","values":["text","Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Heterogeneous networked systems","Reasoning under uncertainty","Declarative verification"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2025 Mubashir Anwar"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://hdl.handle.net/2142/132709"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Networked systems are collections of interconnected devices and software components that communicate to provide coordinated functionality, such as sensing, control, data processing, and access enforcement. Many everyday services rely on such systems, including building automation, cloud applications, industrial monitoring, and connected medical or sensor devices. In these systems, overall behavior is shaped by configuration choices, such as access rules, control logic, and communication settings, and by how these choices interact across components. Small configuration mistakes or unintended rule interactions can therefore lead to serious safety or security problems. These systems are often assembled from components developed independently and are not always fully observable during operation, which makes it difficult to determine whether the system as a whole behaves correctly and safely. This thesis addresses the problem of reasoning about correctness, safety, and redundancy in configured networked systems under uncertainty. It argues that this problem can be addressed by introducing a common, easy-to-use semantic layer into which heterogeneous configurations can be compiled, and which explicitly supports the representation of incomplete information. Such a semantic layer enables sound, system-wide reasoning over the set of possible behaviors consistent with what is known about the system. To realize this approach, the thesis leverages conditional tables, a database-inspired representation for incomplete information. Conditional tables provide a unifying symbolic abstraction for modeling heterogeneous data and control logic while explicitly encoding uncertainty. Within this framework, properties such as safety, policy compliance, and reachability can be expressed as declarative queries and evaluated soundly under partial observability. The same representation supports semantic minimization, allowing complex systems to be reduced to smaller models that preserve behaviors of interest. A prototype implementation demonstrates that conditional-table–based reasoning is practical and scales to realistic networked scenarios under typical deployment sizes.","Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2027-12-01","The student, Mubashir Anwar, accepted the attached license on 2025-12-11 at 11:02.","The student, Mubashir Anwar, submitted this Thesis for approval on 2025-12-11 at 11:02.","This Thesis was approved for publication on 2025-12-11 at 11:53.","DSpace SAF Submission Ingestion Package generated from Vireo submission #23134 on 2026-02-19 at 18:46:56"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Reasoning under partial observability in heterogeneous networked systems"]}]}],"canonical_facts":{"dc:contributor":["Caesar, Matthew"],"dc:creator":["Anwar, Mubashir"],"dc:date":["2025-12","2025-12-11"],"dc:description":["Networked systems are collections of interconnected devices and software components that communicate to provide coordinated functionality, such as sensing, control, data processing, and access enforcement. Many everyday services rely on such systems, including building automation, cloud applications, industrial monitoring, and connected medical or sensor devices. In these systems, overall behavior is shaped by configuration choices, such as access rules, control logic, and communication settings, and by how these choices interact across components. Small configuration mistakes or unintended rule interactions can therefore lead to serious safety or security problems. These systems are often assembled from components developed independently and are not always fully observable during operation, which makes it difficult to determine whether the system as a whole behaves correctly and safely. This thesis addresses the problem of reasoning about correctness, safety, and redundancy in configured networked systems under uncertainty. It argues that this problem can be addressed by introducing a common, easy-to-use semantic layer into which heterogeneous configurations can be compiled, and which explicitly supports the representation of incomplete information. Such a semantic layer enables sound, system-wide reasoning over the set of possible behaviors consistent with what is known about the system. To realize this approach, the thesis leverages conditional tables, a database-inspired representation for incomplete information. Conditional tables provide a unifying symbolic abstraction for modeling heterogeneous data and control logic while explicitly encoding uncertainty. Within this framework, properties such as safety, policy compliance, and reachability can be expressed as declarative queries and evaluated soundly under partial observability. The same representation supports semantic minimization, allowing complex systems to be reduced to smaller models that preserve behaviors of interest. A prototype implementation demonstrates that conditional-table–based reasoning is practical and scales to realistic networked scenarios under typical deployment sizes.","Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2027-12-01","The student, Mubashir Anwar, accepted the attached license on 2025-12-11 at 11:02.","The student, Mubashir Anwar, submitted this Thesis for approval on 2025-12-11 at 11:02.","This Thesis was approved for publication on 2025-12-11 at 11:53.","DSpace SAF Submission Ingestion Package generated from Vireo submission #23134 on 2026-02-19 at 18:46:56"],"dc:format":["application/pdf"],"dc:identifier":["https://hdl.handle.net/2142/132709"],"dc:language":["en"],"dc:rights":["Copyright 2025 Mubashir Anwar"],"dc:subject":["Heterogeneous networked systems","Reasoning under uncertainty","Declarative verification"],"dc:title":["Reasoning under partial observability in heterogeneous networked systems"],"dc:type":["text","Thesis"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:07Z"}