{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81630"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81630","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"A Theory of Testing for Asynchronous Concurrent Systems","abstract":"The central idea behind our proof techniques for testing equivalence is to obtain semantic characterizations of the equivalence that do away with universal quantification over contexts. Using these characterizations one can thus establish an equivalence by simply comparing the semantic mappings of the given processes in an abstract domain instead of accounting for their interactions with all possible contexts of use. We use these semantic characterizations to obtain both complete axiomatizations of the equivalence and decision procedures for it over restricted classes of processes. We have also implemented some of the variants of pi-calculus and the proof techniques we have developed for establishing equivalences over them.","abstract_html":"The central idea behind our proof techniques for testing equivalence is to obtain semantic characterizations of the equivalence that do away with universal quantification over contexts. Using these characterizations one can thus establish an equivalence by simply comparing the semantic mappings of the given processes in an abstract domain instead of accounting for their interactions with all possible contexts of use. We use these semantic characterizations to obtain both complete axiomatizations of the equivalence and decision procedures for it over restricted classes of processes. We have also implemented some of the variants of pi-calculus and the proof techniques we have developed for establishing equivalences over them.","abstract_has_math":false,"creators":["Thati, Prasannaa"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Agha, Gul A."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:19:36Z","date_published":"2015-09-25T20:19:36Z","updated_at":"2026-07-22T22:26:16Z","subjects":["Computer Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3101979"],"render_values":[{"text":"(MiAaPQ)AAI3101979","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81630","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Agha, Gul A."]},{"key":"dc:creator","label":"Author","values":["Thati, Prasannaa"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:19:36Z","10000-01-01","2003"]},{"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":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/81630","(MiAaPQ)AAI3101979"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The central idea behind our proof techniques for testing equivalence is to obtain semantic characterizations of the equivalence that do away with universal quantification over contexts. Using these characterizations one can thus establish an equivalence by simply comparing the semantic mappings of the given processes in an abstract domain instead of accounting for their interactions with all possible contexts of use. We use these semantic characterizations to obtain both complete axiomatizations of the equivalence and decision procedures for it over restricted classes of processes. We have also implemented some of the variants of pi-calculus and the proof techniques we have developed for establishing equivalences over them.","Made available in DSpace on 2015-09-25T20:19:36Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3101979.pdf: 7183113 bytes, checksum: 584f4e147e30e52655f0332cbbc240f3 (MD5) Previous issue date: 2003","Embargo set by: Seth Robbins for item 82911 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","173 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2003."]},{"key":"dc:title","label":"Title","values":["A Theory of Testing for Asynchronous Concurrent Systems"]}]}],"canonical_facts":{"dc:contributor":["Agha, Gul A."],"dc:creator":["Thati, Prasannaa"],"dc:date":["2015-09-25T20:19:36Z","10000-01-01","2003"],"dc:description":["The central idea behind our proof techniques for testing equivalence is to obtain semantic characterizations of the equivalence that do away with universal quantification over contexts. Using these characterizations one can thus establish an equivalence by simply comparing the semantic mappings of the given processes in an abstract domain instead of accounting for their interactions with all possible contexts of use. We use these semantic characterizations to obtain both complete axiomatizations of the equivalence and decision procedures for it over restricted classes of processes. We have also implemented some of the variants of pi-calculus and the proof techniques we have developed for establishing equivalences over them.","Made available in DSpace on 2015-09-25T20:19:36Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3101979.pdf: 7183113 bytes, checksum: 584f4e147e30e52655f0332cbbc240f3 (MD5) Previous issue date: 2003","Embargo set by: Seth Robbins for item 82911 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","173 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2003."],"dc:identifier":["http://hdl.handle.net/2142/81630","(MiAaPQ)AAI3101979"],"dc:language":["eng"],"dc:subject":["Computer Science"],"dc:title":["A Theory of Testing for Asynchronous Concurrent Systems"],"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:26:16Z"}