Modelling concurrency with tabular expressions

被引：0

作者：

Yang, YW ^{[1
]}

Janicki, R ^{[1
]}

机构：

[1] McMaster Univ, Dept Comp & Software, Hamilton, ON L8S 4K1, Canada

来源：

SERP'04: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING RESEARCH AND PRACTICE, VOLS 1 AND 2 | 2004年

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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], and all of the processes in the system are composed to a global finite state automata to model the concurrent system. Tabular expressions are used to specify all automata involved.

引用

页码：455 / 461

页数：7

共 15 条

[1]

Borger E., 2003, Abstract State Machines. A method for High-level System Design and Analysis, V1st

[2]

GECSEG F, 1986, PRODUCTS AUTOMATA

[3]

HENINGER KL, 1978, 3876 NRL US NAV RES

[4] On a formal semantics of tabular expressions [J].

Janicki, R ;

Khedri, R .

SCIENCE OF COMPUTER PROGRAMMING, 2001, 39 (2-3) :189-213

[5]

JANICKI R, 1995, PROC INT CONF SOFTW, P231, DOI 10.1145/225014.225036

[6] STRUCTURE OF CONCURRENCY [J].

JANICKI, R ;

KOUTNY, M .

THEORETICAL COMPUTER SCIENCE, 1993, 112 (01) :5-52

[7]

Janicki R, 1997, ADV COMP SCI, P184

[8]

JANICKI R, 2002, P SERP 02 INT C SOFT, P434

[9]

LAMPORT L, 1993, 119 SRC DEC SYST RES

[10]

PARNAS DL, 1991, NUCL SAFETY, V32, P189

← 1 2 →