Processes with infinite liveness requirements

被引:0
作者
Guerra, Helia [1 ]
Costa, Jose Felix [2 ,3 ]
机构
[1] Univ Azores, Dept Math, Ctr Appl Math & Informat Technol, P-9501801 Ponta Delgada, Portugal
[2] Univ Tecn Lisboa, Inst Super Tecn, Dept Math, P-1049001 Lisbon, Portugal
[3] Univ Lisbon, Ctr Matemat & Aplicacoes Fundamentais, P-1699 Lisbon, Portugal
来源
JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING | 2013年 / 82卷 / 3-4期
关键词
Process algebra; Liveness; Denotational semantics; Operational semantics;
D O I
10.1016/j.jlap.2013.03.001
中图分类号
学科分类号
摘要
In this paper we develop a deterministic process algebra for describing and reasoning about liveness requirements of infinite behaviour systems beyond the ones usually captured by non-deterministic process models. These liveness requirements refer to the capability of processes to engage spontaneously in some actions and to wait passively for the triggering of other actions by other processes. A semantic theory based on three equivalent semantic domains (denotational, operational, and axiomatic) is developed for the language of process terms. (C) 2013 Elsevier Inc. All rights reserved.
引用
收藏
页码:137 / 161
页数:25
相关论文
共 33 条
[1]  
[Anonymous], 2001, INTRO AUTOMATA THEOR
[2]  
[Anonymous], 1992, TEMPORAL LOGIC REACT, DOI DOI 10.1007/978-1-4612-0931-7
[3]  
[Anonymous], 1989, CWI-Quarterly
[4]  
[Anonymous], 1990, HDB THEORETICAL COMP
[5]  
[Anonymous], 1987, PODC
[6]  
[Anonymous], 2000, Introduction to Process Algebra
[7]  
Baete J. C. M., 2004, 0402 CSR TU EINDH DE
[8]  
Baeten J.C.M., 1990, Cambridge Tracts in Theoretical Computer Science, V18
[9]  
Broy Manfred., 2001, Handbook of Process Algebra, P101
[10]  
Costa F., 1995, Formal Aspects of Computing, V7, P18, DOI 10.1007/BF01214621