Extending LOTOS with Time: True Concurrency Perspective

Bowman, Howard and Derrick, John (1997) Extending LOTOS with Time: True Concurrency Perspective. In: Bertran, Miquel and Rus, Teodor, eds. Transformation-Based Reactive Systems Development. Lecture Notes in Computer Science, 1231. Springer-Verlag pp. 382-399. ISBN 3-540-63010-4 . (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

The full text of this publication is not available from this repository. (Contact us about this Publication)
Official URL


An ongoing restandardisation activity is currently extending the OSI specification language LOTOS with quantitative time. We give an alternative perspective on this activity. We highlight a very simple but expressive timed LOTOS enhancement which is based on time intervals. The main point at which we depart from the standard approach to extending LOTOS with time, is that we employ a true concurrency semantics. We present a semantics based on time extended bundle event structures. We give a full semantics for relating our timed LOTOS to timed bundle event structures. A fixed point theory is defined and finally, we describe how urgency can be supported in the language.

Item Type: Conference or workshop item (Paper)
Uncontrolled keywords: LOTOS, True Concurrency, Real-time, Process Algebra
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 26 Jul 2009 12:53
Last Modified: 12 May 2014 14:51
Resource URI: https://kar.kent.ac.uk/id/eprint/21500 (The current URI for this page, for reference purposes)
  • Depositors only (login required):


Downloads per month over past year