Untanglings: a novel approach to analyzing concurrent systems. (November 2015)

• Record Type: Journal Article
• Authors: Polyvyanyy, Artem; La Rosa, Marcello; Ouyang, Chun; Hofstede, Arthur
• Is Part Of: Formal aspects of computing. Volume 27:Number 5(2015)
• Page Start: 753
• Page End: 788
• Publication Date: 2015-11
• Subjects: Concurrency -- Concurrent systems -- Analysis -- Untanglings -- Representative untanglings; Computer science -- Periodicals; 004.05
• DOI: 10.1007/s00165-014-0329-4
• Languages: English
• ISSNs: 0934-5043

Abstract

Abstract Substantial research efforts have been expended to deal with the complexity of concurrent systems that is inherent to their analysis, e.g., works that tackle the well-known state space explosion problem. Approaches differ in the classes of properties that they are able to suitably check and this is largely a result of the way they balance the trade-off between analysis time and space employed to describe a concurrent system. One interesting class of properties is concerned with behavioral characteristics. These properties are conveniently expressed in terms of computations, orruns, in concurrent systems. This article introduces the theory ofuntanglings that exploits a particular representation of a collection of runs in a concurrent system. It is shown that a representative untangling of a bounded concurrent system can be constructed that captures all and only the behavior of the system. Representative untanglings strike a unique balance between time and space, yet provide a single model for the convenient extraction of various behavioral properties. Performance measurements in terms of construction time and size of representative untanglings with respect to the original specifications of concurrent systems, conducted on a collection of models from practice, confirm the scalability of the approach. Finally, this article demonstrates practical benefits of using representative untanglings when checking various behavioral properties of concurrent systems.