Conference
Modelling concurrency with tabular expressions
Abstract
Tabular expressions (Parnas et al) [3, 11, 8, 6] are a software specification technique that becomes increasingly popular in software industry. The current state of the technique is restricted to sequential systems only. In this paper we show how concurrency can be treated in some systematic way in the framework of automata and tabular expressions. Each sequential process is viewed as a Finitely Defined Automaton with Interpreted States [5], …
Authors
Yang Y; Janicki R
Volume
2
Pagination
pp. 455-461
Publication Date
December 1, 2004
Conference proceedings
Proceedings of the International Conference on Software Engineering Research and Practice Serp 04