{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/22816"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/22816","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Supporting flexible, extensible task descriptions in and among tasks","abstract":"This thesis describes and formalizes Obligations, a model and prototype implementation that supports a continuum of task definitions from unspecified to well specified with dynamic movement of instances along this continuum. When little is known about a task, a simple request can be created that has only a textual description of the goal. If a lot of detail can be predicted about a task's sub-activities and their relationships, templates can be created that define the task's flow. Regardless of the amount of predefined structure, obligations can be modified to add detail, alter the projected path, remove unneeded steps, and align the obligation with the current circumstances.","abstract_html":"This thesis describes and formalizes Obligations, a model and prototype implementation that supports a continuum of task definitions from unspecified to well specified with dynamic movement of instances along this continuum. When little is known about a task, a simple request can be created that has only a textual description of the goal. If a lot of detail can be predicted about a task's sub-activities and their relationships, templates can be created that define the task's flow. Regardless of the amount of predefined structure, obligations can be modified to add detail, alter the projected path, remove unneeded steps, and align the obligation with the current circumstances.","abstract_has_math":false,"creators":["Bogia, Douglas Paul"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Kaplan, Simon M."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-07T13:52:26Z","date_published":"2011-05-07T13:52:26Z","updated_at":"2026-07-22T22:25:20Z","subjects":["Engineering, System Science","Computer Science"],"languages":["eng"],"rights":["Copyright 1995 Bogia, Douglas Paul"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9624294","(UMI)AAI9624294"],"render_values":[{"text":"AAI9624294","href":null,"code":true},{"text":"(UMI)AAI9624294","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/22816","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Kaplan, Simon M."]},{"key":"dc:creator","label":"Author","values":["Bogia, Douglas Paul"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T13:52:26Z","10000-01-01","1995"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Engineering, System Science","Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 1995 Bogia, Douglas Paul"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9624294","(UMI)AAI9624294","http://hdl.handle.net/2142/22816"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["This thesis describes and formalizes Obligations, a model and prototype implementation that supports a continuum of task definitions from unspecified to well specified with dynamic movement of instances along this continuum. When little is known about a task, a simple request can be created that has only a textual description of the goal. If a lot of detail can be predicted about a task's sub-activities and their relationships, templates can be created that define the task's flow. Regardless of the amount of predefined structure, obligations can be modified to add detail, alter the projected path, remove unneeded steps, and align the obligation with the current circumstances.","Our model uses multiple inheritance of templates and an overhead transparency metaphor to construct a network of tasks. Global templates (transparencies) define how a task is expected to proceed while local templates capture changes made to a single instance and not shared with other similar tasks. When an obligation's templates are stacked together, they create a composite view of the network. Templates are treated as meta-objects. Modifications to either the global or local templates can change the network by replacing the current template with a newly upgraded template. This type of replacement can be encoded into surrogates which automatically execute the replacements to keep the obligation up-to-date. Of course, when dynamic changes are allowed, there is the possibility of errors. The Obligation system has built in error detection schemes that determine if network construction is invalid and, when errors occur, alerts the participants and disallows execution of the network portions that are in error.","In addition, since webs of interdependencies evolve among tasks in a fashion which is sometimes predictable, but often completely ad hoc, Obligations allow users to specify requests that span among collaborative contexts. When relationships are predictable, task specifications can be written that automatically spawn an obligation. When the obligation completes, the task is notified and can execute appropriate actions. When relationships are ad hoc, users are able to connect two or more tasks together, by hand, using an obligation. These bridging obligations can be used to migrate commands and to traverse into other collaborative contexts.","Made available in DSpace on 2011-05-07T13:52:26Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9624294.pdf: 15371546 bytes, checksum: 37df6c8b7bb40b6902022fb18e569d31 (MD5) Previous issue date: 1995","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T15:00:11Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:28:28-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"]},{"key":"dc:title","label":"Title","values":["Supporting flexible, extensible task descriptions in and among tasks"]}]}],"canonical_facts":{"dc:contributor":["Kaplan, Simon M."],"dc:creator":["Bogia, Douglas Paul"],"dc:date":["2011-05-07T13:52:26Z","10000-01-01","1995"],"dc:description":["This thesis describes and formalizes Obligations, a model and prototype implementation that supports a continuum of task definitions from unspecified to well specified with dynamic movement of instances along this continuum. When little is known about a task, a simple request can be created that has only a textual description of the goal. If a lot of detail can be predicted about a task's sub-activities and their relationships, templates can be created that define the task's flow. Regardless of the amount of predefined structure, obligations can be modified to add detail, alter the projected path, remove unneeded steps, and align the obligation with the current circumstances.","Our model uses multiple inheritance of templates and an overhead transparency metaphor to construct a network of tasks. Global templates (transparencies) define how a task is expected to proceed while local templates capture changes made to a single instance and not shared with other similar tasks. When an obligation's templates are stacked together, they create a composite view of the network. Templates are treated as meta-objects. Modifications to either the global or local templates can change the network by replacing the current template with a newly upgraded template. This type of replacement can be encoded into surrogates which automatically execute the replacements to keep the obligation up-to-date. Of course, when dynamic changes are allowed, there is the possibility of errors. The Obligation system has built in error detection schemes that determine if network construction is invalid and, when errors occur, alerts the participants and disallows execution of the network portions that are in error.","In addition, since webs of interdependencies evolve among tasks in a fashion which is sometimes predictable, but often completely ad hoc, Obligations allow users to specify requests that span among collaborative contexts. When relationships are predictable, task specifications can be written that automatically spawn an obligation. When the obligation completes, the task is notified and can execute appropriate actions. When relationships are ad hoc, users are able to connect two or more tasks together, by hand, using an obligation. These bridging obligations can be used to migrate commands and to traverse into other collaborative contexts.","Made available in DSpace on 2011-05-07T13:52:26Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9624294.pdf: 15371546 bytes, checksum: 37df6c8b7bb40b6902022fb18e569d31 (MD5) Previous issue date: 1995","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T15:00:11Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:28:28-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"],"dc:identifier":["AAI9624294","(UMI)AAI9624294","http://hdl.handle.net/2142/22816"],"dc:language":["eng"],"dc:rights":["Copyright 1995 Bogia, Douglas Paul"],"dc:subject":["Engineering, System Science","Computer Science"],"dc:title":["Supporting flexible, extensible task descriptions in and among tasks"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:20Z"}