Abstract
In this paper we address the problem of safely replacing components of a real-time system, especially with faster ones. We isolate a class of real-time processes we call the nonpre-emptive processes. These processes can be related by their speed (relative efficiency) as well as their relative degrees of nondeterminism. A process algebra of nonpreemptive processes, N-CCS, is presented that includes a language that expresses exactly the nonpre-emptive processes, testing preorders, and sound and complete axiomatizations of the preorders for finite N-CCS. The utility of this framework is demonstrated by an example.
This work was supported by AFOSR grants F49620-93-1-0169 and F49620-93-1-0616
Currently on leave from Johns Hopkins
Preview
Unable to display preview. Download preview PDF.
References
D. Austry and G. Boudol. Algèbre de processus et synchronisations. Theoretical Computer Science, 30:91–131, 1984.
L. Aceto, B. Bloom, and F. Vaandrager. Turning SOS Rules into Equations. In Proc. of Seventh Annual IEEE Symposium on Logic in Computer Science, pages 113–124, 1992.
L. Aceto, B. Bloom, and Frits Vaandrager. Turning SOS rules into Equations. Technical Report CS-R9218, Center for Mathematics and Computer Science, June 1992.
S. Arun-Kumar and M. Hennessy. An Efficiency Preorder for Processes. Technical Report 5/90, Department of Computing Science, University of Sussex, July 1990.
J.C.M. Baeten and J.A. Bergstra. Real Time Process Algebra. Technical report, CWI, 1989.
S.D. Bookes, C.A.R. Hoare, and A.W. Roscoe. A Theory of Communicating Sequential Processes. Journal of the ACM, 31(3):560–599, July 1984.
L. Cardelli. Real Time Agents. In Proc. of Ninth Colloquium in Automata, Languages and Programming, pages 94–106, 1982.
R. Cleaveland and A. Zwarico. A Theory of Testing for Real-Time. In Proceedings of the Sixth Symposium on Logic in Computer Science, 1991.
R. Cleaveland and A. Zwarico. A Theory of Testing for Real-Time. Technical report, Department of Computer Science, Johns Hopkins University, 1993.
R. DeNicola. Extensional Equivalences for Transition Systems. Acta Informatica, 24:211–237, 1987.
R. Gerth and A. Boucher. A Timed Failure Semantics for Extended Communicating Processes. In Proceedings of ICALP '87, LNCS 267, 1987.
R. Gerber and I. Lee. CCSR: A Calculus for Communicating Shared Resources. In Proceedings, CONCUR '90, Lecture Notes in Computer Science 458. Springer-Verlag, 1990.
M.C.B. Hennessy. Algebraic Theory of Processes. MIT Press, Boston, 1988.
C. Huizing, R. Gerth, and W.P. de Roever. Full Abstraction of a Denotational Semantics for Real-time Concurrency. In POPL87, pages 223–237, 1987.
C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, London, 1985.
M. Hennessy and T. Regan. A Temporal Process Algebra. Technical Report 2/90, Department of Computing Science, University of Sussex, April 1990.
G. Jones. A Timed Model for Communicating Processes. PhD thesis, Oxford University, 1982.
R. Koymans, R.K. Shyamasundar, W.P. de Roever, R. Gerth, and S. Arun-Kumar. Compositional Semantics for Real-Time Distributed Computing. In Logic of Programs Workshop '85, LNCS 193, 1985.
R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267–310, 1983.
G.J. Milne. CIRCAL and the Representation of Communication, Concurrency, and Time. ACM Transactions on Programming Languages and Systems, 7(2):270–298, April 1985.
R. Milner. Communication and Concurrency. Prentice Hall, 1989.
Faron Moller and Chris Tofts. Relating Processes with Respect to Speed. In Proceedings, CONCUR'91, Lecture Notes in Computer Science 527. Springer-Verlag, 1991.
R. De Nicola and M.C.B. Hennessy. Testing Equivalences for Processes. Theoretical Computer Science, 34:83–133, 1983.
Xavier Nicollin, Jean-Luc Richier, Joseph Sifakis, and Jacques Voiron. ATP: An Algebra for Timed Processes. In Proceedings of the IFIP TC 2 Working Conference on Programming Concepts and Methods Principles of Programming Languages, pages 402–429, April 1990.
G.M. Reed and A.W. Roscoe. Metric Spaces as Models for Real-Time Concurrency. In Proceedings of Math. Found. of Computer Science, LNCS 298, 1987.
A. Zwarico. Timed Acceptance: An Algebra of Time Dependent Computing. PhD thesis, Department of Computer and Information Science, University of Pennsylvania, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leonard, E.I., Zwarico, A.E. (1995). An algebraic framework for developing and maintaining real-time systems. In: Alagar, V.S., Nivat, M. (eds) Algebraic Methodology and Software Technology. AMAST 1995. Lecture Notes in Computer Science, vol 936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60043-4_63
Download citation
DOI: https://doi.org/10.1007/3-540-60043-4_63
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60043-5
Online ISBN: 978-3-540-49410-2
eBook Packages: Springer Book Archive