Process Algebras, Reasoning, And Validation

Abstract

Process algebras model concurrent systems, and hence permit system reasoning or validation of concurrent programs. These are bottom up paradigms that start from representation of each element of the system followed by representation of their interactions, i.e., their parallel processing and communication. The representation of agents as terms in an algebra enables derivation either alone or combined with other paradigms such as random variables, and hence process algebra adds its reasoning power. This paper presents these feats and complements with two possible implementations namely: line search, ant colony activation.