2026-09-20T08:09:03Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/81630 2023-07-11 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Agha, Gul A. Thati, Prasannaa 2015-09-25T20:19:36Z 2015-09-25T20:19:36Z 10000-01-01 2003 2003 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. http://hdl.handle.net/2142/81630 (MiAaPQ)AAI3101979 eng Computer Science A Theory of Testing for Asynchronous Concurrent Systems text Computer Science Computer Science University of Illinois at Urbana-Champaign Dissertation Ph.D.