On the Difficulties of Concurrent-System Design, Illustrated with a 2×2 Switch Case Study

  • Authors:
  • Edgar G. Daylight;Sandeep K. Shukla

  • Affiliations:
  • a.k.a. Karel Van Oudheusden, Institute of Logic, Language, and Computation, University of Amsterdam, The Netherlands;Department of Electrical & Computer Engineering, Virginia Tech., USA

  • Venue:
  • FM '09 Proceedings of the 2nd World Congress on Formal Methods
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

While various specification languages for concurrent-system design exist today, it is often not clear which specification language is more suitable than another for a particular case study. To address this problem, we study four different specification languages for the same 2×2 Switch case study: TLA + , Bluespec, Statecharts, and the Algebra of Communicating Processes (ACP). By slightly altering the design intent of the Switch, we obtain more complicated behaviors of the Switch. For each design intent, we investigate how each specification, in each of the specification languages, captures the corresponding behavior. By using three different criteria, we judge each specification and specification language. For our case study, however, all four specification languages perform poorly in at least two criteria! Hence, this paper illustrates, on a seemingly simple case study, some of the prevailing difficulties of concurrent-system design.