A true concurrency semantics for ET-LOTOS

被引：5
作者：
Bowman, H [1 ]
Katoen, JP [1 ]
机构：
[1] Univ Kent, Comp Lab, Canterbury CT2 7NF, Kent, England
来源：
1998 INTERNATIONAL CONFERENCE ON APPLICATION OF CONCURRENCY TO SYSTEM DESIGN, PROCEEDINGS | 1998年
关键词：
D O I：
10.1109/CSD.1998.657554
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
One of the central objectives of the LOTOS re-standardisation activity is to define an enhanced LOTOS language which supports real-time specification. The timed extension is based upon a timed LOTOS proposal ET-LOTOS. This paper defines a (branching-time) non-interleaving semantics for ET-LOTOS without data. As a denotational model a suitable timed extension of Langerak's bundle event structures is used. for guarded recursive processes me show the consistency between our non-interleaving semantics and the ET-LOTOS interleaving semantics. Since our semantical model does not have an explicit notion of the passage of time (as opposed to the interleaving semantics) we are able to handle unguarded recursion and Zeno-behaviours in a perspicuous way.
引用
收藏
页码：228 / 238
页数：11
相关论文
共 50 条
[41]   HIDING IN STREAM SEMANTICS OF UNIFORM CONCURRENCY [J].
MEYER, JJC ;
OLDEROG, ER .
ACTA INFORMATICA, 1990, 27 (05) :381-397
[42]   Formalizing the Concurrency Semantics of an LLVM Fragment [J].
Chakraborty, Soham ;
Vafeiadis, Viktor .
CGO'17: PROCEEDINGS OF THE 2017 INTERNATIONAL SYMPOSIUM ON CODE GENERATION AND OPTIMIZATION, 2017, :100-110
[43]   INITIAL ALGEBRA-SEMANTICS AND CONCURRENCY [J].
ZAMFIR, M .
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 298 :528-549
[44]   The Problem of Programming Language Concurrency Semantics [J].
Batty, Mark ;
Memarian, Kayvan ;
Nienhuis, Kyndylan ;
Pichon-Pharabod, Jean ;
Sewell, Peter .
PROGRAMMING LANGUAGES AND SYSTEMS, 2015, 9032 :283-307
[45]   WEAKEST PRECONDITION SEMANTICS FOR TIME AND CONCURRENCY [J].
SCHOLEFIELD, D ;
ZEDAN, HSM .
INFORMATION PROCESSING LETTERS, 1992, 43 (06) :301-308
[46]   RELATION-BASED SEMANTICS FOR CONCURRENCY [J].
BOUDRIGA, N ;
SLIMANI, Y ;
MILI, A .
INFORMATION SCIENCES, 1993, 75 (03) :223-252
[47]   Abstract Continuation Semantics for Asynchronous Concurrency [J].
Ciobanu, Gabriel ;
Todoran, Eneia Nicolae .
2017 19TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2017), 2017, :296-303
[48]   BUNDLE EVENT STRUCTURES - A NON-INTERLEAVING SEMANTICS FOR LOTOS [J].
LANGERAK, R .
IFIP TRANSACTIONS C-COMMUNICATION SYSTEMS, 1993, 10 :331-346
[49]   The true concurrency of differential interaction nets [J].
Mazza, Damiano .
MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2018, 28 (07) :1097-1125
[50]   True Concurrency of Deep Inference Proofs [J].
Kahramanogullari, Ozan .
LOGIC, LANGUAGE, INFORMATION, AND COMPUTATION, 2016, 9803 :249-264
12345