Abstract
In recent years a large number of process languages with time have been developed as more realistic formalisms for description and reasoning about concurrent systems. We propose a uniform framework, based on the ordered structural operational semantics (SOS) approach, for extending arbitrary process languages with discrete time. The generality of our framework allows the user to select the most suitable timed process language for a task in hand. This is possible because the user can choose any operators, whether they are standard or new application-specific operators, provided that they preserve a version of weak bisimulation and all processes in the considered language satisfy the time determinacy property. We also propose several constraints on ordered SOS rules for the operators such that some other properties, which reflect the nature of time passage, are satisfied.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S. Abramsky. Observation equivalence as a testing equivalence. Theoretical Computer Science, 53:225–241, 1987.
L. Aceto, B. Bloom, and F.W. Vaandrager. Turning SOS rules into equations. Information and Computation, 111:1–52, 1994.
J.C.M Baeten and J.A. Bergstra. Real time process algebra. Formal Aspects of Computing, 3:142–188, 1991.
J.C.M Baeten and J.A. Bergstra. Discrete time process algebra. Formal Aspects of Computing, 8:188–208, 1996.
B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can't be traced. Journal of ACM, 42(1):232–268, 1995.
B. Bloom. Structural operational semantics for weak bisimulations. Theoretical Computer Science, 146:27–68, 1995.
J.C.M Baeten and W.P Weijland. Process Algebra, volume 18. Cambridge Tracts in Theoretical Computer Science, 1990.
J.F. Groote. Specification and verification of real time systems in ACP. In L. Logrippo, L.R. Probert, and H. Ural, editors, Proceedings of PSTV'90, Ottawa, 1990.
M. Hennessy. Timed process algebras: A tutorial. Technical Report 2/93, Dept. of Computer Science, University of Sussex, 1993.
C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
M. Hennessy and T. Regan. A process algebra for timed systems. Information and Computation, 117:221–239, 1995.
A. Jeffrey. A linear time process algebra. In K.G. Larsen and A. Skou, editors, Proceedings of CAV'91, Aalborg, 1991. Springer-Verlag. LNCS 575.
L. Léonard and G. Leduc. An introduction to ET-LOTOS for the description of time-sensitive systems. Computer Networks and ISDN Systems, 29(3):271–292, 1997.
R. Milner. A modal characterisation of observable machine behaviours. In G. Astesiano and C. Böhm, editors, CAAP 81, Berlin, 1981. Springer-Verlag. LNCS 112.
R. Milner. Communication and Concurrency. Prentice Hall, 1989.
F. Moller and C. Tofts. A temporal calculus of communicating systems. In J.C.M. Baeten and J.W. Klop, editors, Proceedings of CONCUR'90, Amsterdam, 1990. Springer-Verlag. LNCS 458.
F. Moller and C. Tofts. Relating processes with respect to speed. In J.C.M. Baeten and J.F. Groote, editors, Proceedings of CONCUR'91, Amsterdam, 1991. Springer-Verlag. LNCS 527.
X. Nicollin, J.-L. Richier, J. Sifakis, and J. Voiron. ATP: an algebra for timed processes. In Proceedings of the IFIP TC2 Working Conference on Programming Concepts and Methods, Sea of Galilea, 1990.
X. Nicollin and J. Sifakis. An overview and synthesis on timed process algebras. In K.G. Larsen and A. Skou, editors, Proceedings of CAV'91, Aalborg, 1991. Springer-Verlag. LNCS 575.
X. Nicollin and J. Sifakis. The algebra of timed processes, ATP: Theory and application. Information and Computation, 114:131–178, 1994.
G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, 1981.
I.C.C. Phillips and I. Ulidowski. Stable and timed formats for process algebra. Technical Report, Imperial College, 1995.
G.M. Reed and A.W. Roscoe. A timed model for communicating sequential processes. Theoretical Computer Science, 58:249–261, 1988.
S. A. Schneider. An operational semantics for timed CSP. Information and Computation, 116:193–213, 1995.
I. Ulidowski. Local Testing and Implementable Concurrent Processes. PhD thesis, Imperial College, University of London, 1994.
I. Ulidowski. Finite axiom systems for testing preorder and De Simone process languages. In M. Wirsing and M. Nivat, editors, Proceedings of AMAST'96, München, 1996. Springer. LNCS 1101.
I. Ulidowski and I.C.C. Phillips. Formats of ordered SOS rules with silent actions. In M. Bidoit and M. Dauchet, editors, Proceedings of TAPSOFT'97, Lille, 1997. Springer. LNCS 1214.
I. Ulidowski and S. Yuen. Towards general timed process languages. Available at http://www.kurims.kyoto-u.ac.jp/∼irek/.
R.J. van Glabbeek and W.P. Weijland. Branching time and abstraction in bisimulation semantics. In G.X. Ritter, editor, Information Processing 89, pages 613–618. Elsevier Science Publishers, 1989. To appear in JACM.
D. Walker. Bisimulation and divergence. Information and Computation, 85(2):202–241, 1990.
Y. Wang. A Calculus of Real Time Systems. PhD thesis, Chalmers University of Technology, Göteborg, 1991.
W.P. Weijland. Synchrony and Asynchrony in Process Algebra. PhD thesis, University of Amsterdam, 1989.
ISO/IEC JTC1/SC21 WG7. Working Draft on Enhancements to LOTOS. ftp://ftp.dit.upm.es/pub/lotos/elotos/Working.Docs/cd.ps, 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ulidowski, I., Yuen, S. (1997). Extending process languages with time. In: Johnson, M. (eds) Algebraic Methodology and Software Technology. AMAST 1997. Lecture Notes in Computer Science, vol 1349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000494
Download citation
DOI: https://doi.org/10.1007/BFb0000494
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63888-9
Online ISBN: 978-3-540-69661-2
eBook Packages: Springer Book Archive