Abstract
Event structures are a prominent noninterleaving model for concurrency. Real-time event structures associate a set of time instants to events, modelling absolute time constraints, and to causal dependencies, modelling relative delays between causally dependent events. We introduce this novel temporal model and show how it can be used to provide a denotational semantics to a real-time variant of a process algebra akin to LOTOS. This formalism includes a timed-action prefix which constrains the occurrence time of actions, a timeout and watchdog (i.e., timed interrupt) operator. An event-based operational semantics for this formalism is presented that is shown to be consistent with the denotational semantics. As an example we use an infinite buffer with time constraints on the message latency and the rates of accepting and producing data.
The work in this paper is partially funded by C.N.R. — Progetto Bilaterale: Estensioni probabilistich e temporali dell'algebra di processi LOTOS basate su strutture di eventi, per la specifica e analisi quantitative di sistemi distribuiti, by C.N.R. — Progetto Coordinato: Strumenti per la specifica e verifica di proprieta' critiche di sistemi concorrenti e distribuiti.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. Aceto & D. Murphy. On the ill-timed but well-caused. In E. Best, ed, Concur' 93, LNCS 715: 97–111. Springer-Verlag, 1993.
R. Alur & D.L. Dill. A theory of timed automata. Th. Comp. Sci., 126:183–235, 1994.
J.C.M. Baeten & J.A. Bergstra. Real time process algebra. Formal Aspects of Computing, 3(2):142–188, 1991.
T. Bolognesi & E. Brinksma. Introduction to the ISO specification language LO-TOS. Computer Networks and ISDN Systems, 14:25–59, 1987.
G. Boudol & I. Castellani. Flow models of distributed computations: three equivalent semantics for CCS. Inf. & Comp., 114: 247–314, 1994.
E. Brinksma, J.-P. Katoen, R. Langerak & D. Latella. Performance analysis and true concurrency semantics. In T. Rus & C. Rattray, eds, Theories and Experiences for Real-Time System Development, pp. 309–337. World Scientific, 1994.
R.T. Casley, R.F. Crew, J. Meseguer & V.R. Pratt. Temporal structures. Mathematical Structures in Computer Science, 1(2):179–213, 1991.
J.W. de Bakker, W.-P. de Roever & G. Rozenberg, eds. Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354. Springer-Verlag, 1989.
M. Diaz & R. Groz, eds. Formal Description Techniques V. North-Holland, 1993.
C. Fidge. A constraint-oriented real-time process calculus. In [9], pp. 363–378.
R. Gorrieri, M. Roccetti & E. Stancampiano. A theory of processes with durational actions. Th. Comp. Sci., 140:73–94, 1995.
J. Gunawardena. A dynamic approach to timed behaviour. In B. Jonsson & J. Parrow, eds, Concur' 94: Concurrency Theory, LNCS 836: 178–193. Springer-Verlag, 1994.
W. Janssen, M. Poel, Q. Wu & J. Zwiers. Layering of real-time distributed processes. In H. Langmaack, W.-P. de Roever & J. Vytopil, Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863: 393–417. Springer-Verlag, 1994.
J.-P. Katoen. Quantitative and Qualitative Extensions of Event Structures. PhD thesis, University of Twente, 1996.
J.-P. Katoen, R. Langerak & D. Latella. Modelling systems by probabilistic process algebra: An event structures approach. In R.L. Tenney, P.D. Amer & M.Ü. Uyar, eds, Formal Description Techniques VI, pp. 253–268. North-Holland, 1994.
J.-P. Katoen, D. Latella, R. Langerak, E. Brinksma & T. Bolognesi. A consistent causality-based view on a timed process algebra. In A. Cornell & D. Ionescu, eds, Proc. 3rd Amast Workshop on Real-Time System Development, pp. 212–227, 1996.
R. Langerak. Bundle event structures: a non-interleaving semantics for LOTOS. In [9], pp. 331–346.
A. Maggiolo-Schettini & J. Winkowski. Towards an algebra for timed behaviours. Th. Comp. Sci., 103:335–363, 1992.
A. Mazurkiewicz. Basic notions of trace theory. In [8], pp. 285–363.
D.V.J. Murphy. Time and duration in noninterleaving concurrency. Fund. Inf., 19:403–416, 1993.
X. Nicollin & J. Sifakis. An overview and synthesis on timed process algebras. In J.W. de Bakker et. al, eds, Real-Time: Theory in Practice, LNCS 600: 526–548. Springer-Verlag, 1992.
G.M. Pinna & A. Poigné. On the nature of events: another perspective in concurrency. Th. Comp. Sci., 138(2):425–454, 1995.
G.D. Plotkin. A structural approach to operational semantics. Tech. Rep. DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
V.R. Pratt. Modeling concurrency with partial orders. Int. J. of Parallel Programming, 15(1):33–71, 1986.
J. Quemada, D. de Frutos & A. Azcorra. TIC: A Timed Calculus. Formal Aspects of Computing, 5:224–252, 1993.
D.A. Schmidt. Denotational Semantics: a methodology for language development. Allyn & Bacon, 1986.
G. Winskel. An introduction to event structures. In [8], pp. 364–397.
J.J. Zic. Time-constrained buffer specifications in CSP+T and timed CSP. ACM Transactions on Programming Languages and Systems, 16(6):1661–1674, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Katoen, J.P., Langerak, R., Latella, D., Brinksma, E. (1996). On specifying real-time systems in a causality-based setting. In: Jonsson, B., Parrow, J. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 1996. Lecture Notes in Computer Science, vol 1135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61648-9_52
Download citation
DOI: https://doi.org/10.1007/3-540-61648-9_52
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61648-1
Online ISBN: 978-3-540-70653-3
eBook Packages: Springer Book Archive