A Theory of Testing for Asynchronous Concurrent Systems

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.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2015

Author dc:creator

• Thati, Prasannaa

Contributors dc:contributor

• Agha, Gul A.

• Computer Science

Language dc:language

eng

Identifier

(MiAaPQ)AAI3101979

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/81630