research-article

A Process Algebra for Timed Systems

Authors:

T. ReganAuthors Info & Claims

Information and Computation, Volume 117, Issue 2

Pages 221 - 239

https://doi.org/10.1006/inco.1995.1041

Published: 01 March 1995 Publication History

Abstract

A standard process algebra is extended by a new action which is meant to denote idling until the next clock cycle. A semantic theory based on testing is developed for the new language. This is characterised in terms of barbs, a variety of ready traces and also characterised as the initial theory generated by a set of equations.

References

[1]

Abramsky, S. (1991), A domain equation for bisimulation. Inform, and Comput. 92 , 161-218.

[2]

Arun-Kumar, S., and Hennessy, M. (1992). An efficiency preorder for processes, Acta Informat. 29 , 737-760.

Digital Library

[3]

Baeten, J., and Bergstra, J. (1991), Real time process algebra. Formal Aspects Comput. Sci. 3 , 142-188.

[4]

Baeten, J., and Weijland, W. (1990), "Process Algebra," Cambridge Univ. Press, London/New York.

[5]

Baeten, J., and Weijland, W. (1990), "Applications of Process Algebra," Cambridge Univ. Press, London/New York.

[6]

Berry, G., and Cosserat, L. (1988), "The ESTEREL Synchronous Programming Language and Its Mathematical Semantics," Technical Report 842, INRIA, Sophia-Antipolis.

[7]

Burns, A., and Wellings, A. (1989), "Real-Time Systems and their Programming Languages," Addison-Wesley. Reading, MA.

[8]

Chen, L. (1991), "Decidability and completeness in Real-Time Processes," Technical Report, LFCS, Edinburgh.

[9]

Cleaveland, R., and Henessey, M. (1990), Priorities in process algebras, Inform, and Comput. 87 , 58-77.

[10]

Cohen, B., Pitt, D. H., and Woodcock, J. C. P. (1986), "The Importance of Time in the Specification of OST Protocols." Technical Report, NPL, London.

[11]

Davies, J., and Schneider, S. (1991), "An Introduction to Timed CSP." Technical Report. PRC. Oxford.

[12]

De Nicola, R. and Hennessy. M. (1984). Testing equivalence for processes. Theoret. Comput. Sci. 34 . 83-133.

[13]

Gert, R., and Boucher, A. (1986). A timed failures model for extended communication processes, in "Lecture Notes in Computer Science," Vol. 267, pp. 95-114, Springer-Verlag, Berlin/New York.

[14]

van Glabbeek, R. (1990), The linear time-branching time spectrum, in "Proceedings, CONCUR90," pp. 278-297, Lecture Notes in Computer Science. Vol. 458, Springer-Verlag, Berlin/ New York.

[15]

Groote. J. F. (1989), "Specification and Verification of Real Time Systems in ACP," Technical Report CS-R9015. CWI. Amsterdam. An extended abstract appeared in "Proceedings 10th International Symposium on Protocol Specification, Testing and Verification, Ottawa, 1990" (L. Logrippa, R. L. Probert, and H. Urel, Eds.), pp. 261-274.

[16]

Hennessy, M. (1981), A term model for synchronous processes. Inform, and Control 51 . 58-75.

[17]

Hennessy, M., (1983), Synchronous and asynchronous experiments on processes. Inform, and Control 59 , 36-83.

[18]

Hennessy, M. (1988), "Algebraic Theory of Processes." MIT Press, Cambridge. MA.

[19]

Hennessy, M., and Regan. T. (1990). "A Temporal Process Algebra." University of Sussex Computer Science Technical Report 2:90.

[20]

Hoare. C. A. R. (1985), "Communicating Sequential Processes," Prentice-Hall. Englewood Cliffs, NJ.

[21]

Hooman, J. J. M., and deRoever. W. P. (1989), Design and verification in real-time distributed computing: An introduction to compositional methods, in "Proceedings of the Ninth International Conference on Protocol Specification, Testing and Verification," North- Holland, Amsterdam.

[22]

Jeffrey. A. (1991). "Discrete Timed CSP," Technical Report PMG 79. Chalmers University of Technology, Sweden.

[23]

Jeffrey. A. (1991), "Timed Process Algebra ¿ Time × Process Algebra," Technical Report PMG 78, Chalmers University of Technology, Sweden.

[24]

Jeffrey. A., A linear time process algebra, in "CAV91."

[25]

Jeffrey. A. (1992). Translating timed process algebra into untimed process algebra, in "Proceedings, Formal Techniques in Real-Time and Fault-Tolerant Systems," Lecture Notes in Computer Science, Vol. 571, Springer-Verlag. Berlin/New York.

[26]

Joseph, M. (1989), Time and real-time in programs, in "FST & TCS 9. Bangalore," Lecture Notes in Computer Science, Vol. 405. Springer-Verlag. Berlin/New York.

[27]

Klusener, A. S. (1991), Completeness in real time process algebra, in "CONCUR 91," pp. 96-110. Lecture Notes in Computer Science, Vol. 527, Springer-Verlag, Berlin/New York.

[28]

Knuth, D. (1975), "Fundamental Algorithms," Addison-Wesley. Reading, MA.

[29]

Langerak, R. (1989), A testing theory for LOTOS using deadlock detection, in "Proceedings of the Ninth International Conference on Protocol Specification. Testing and Verification," North-Holland. Amsterdam.

[30]

Milner, R. (1983), Calculi for synchrony and asynchrony. Theoret. Comput. Sci. 267-310.

[31]

Milner, R. (1989). "Calculus for Communication and Concurrency." Prentice-Hall. London.

[32]

Milner, R. (1990), Operational and algebraic semantics of concurrent processes, in "Handbook of Theoretical Computer Science," North-Holland, Amsterdam.

[33]

Moller, F., and Tofts, C. (1990), A Temporal Calculus of Communicating Systems, in "Proceedings of CONCUR 90," pp. 401-415. Lecture Notes in Computer Science, Vol. 458, Springer-Verlag, Berlin/New York.

[34]

Moller, F., and Tofts. (1991), "Relating Processes With Respect To Speed." Technical Report, LFCS. Edinburgh.

[35]

Moller, F., and Tofts, C. (1991), Relating processes with respect to speed, in "CONCUR9I." pp. 424-438, Lecture Notes in Computer Science, Vol. 527. Springer-Verlag, Berlin/ New York.

[36]

Murphy, D. V. J. (1990). "Time. Casuality. and Concurrency," Ph.D. Thesis, University of Glasgow. CSC 90/R32. 1990.

[37]

Nicollin, X., and Sifakis, J. (1994), The algebra of timed processes, ATP: Theory and application. Inform, and Comput. 114 , 131-178.

[38]

Phillips, I. (1987), Refusal Testing, Theoret. Comput. Sci. 50 , 241-284.

Digital Library

[39]

Phillips. I. (1988), "CCS With Broadcast Stability," Draft Technical Report, Imperial College.

[40]

Pneuli, A. (1985). Linear and branching structures in the semantics and logics of reactive systems, pp. 15-32, Lecture Notes in Computer Science, Vol. 194. Springer-Verlag, Berlin/ New York.

[41]

Quemada. J. Azcorra, A., and Frutos. D. (1989). "TIC: A Timed Calculus for LOTOS," Technical Report, Madrid.

[42]

Reed, G. M. (1988). "A Hierarchy of Domains for Real Time Distributed Computing," Technical Report. Oxford.

[43]

Regan, T. (1991), "Process Algebras for Real-Time Systems," Ph.D. Thesis, University of Sussex.

[44]

Reed, G. M., and Roscoe, A. (1986). A timed model for communicating sequential processes, pp. 314-323. Lecture Notes in Computer Science, Vol. 226. Springer-Verlag, Berlin/ New York.

[45]

Rudkin, S., and Smith, C. R., (1988), "A Temporal Enhancement for LOTOS," British Telecom R and T.

[46]

Schmidt, D. A., (1986), "Denotational Semantics." Allyn & Bacon, Needham Heights, MA.

[47]

Schneider, S. A. (1990). "Correctness and Communication of Real-Time Systems," Ph.D. Thesis. PRG, University of Oxford.

[48]

Schneider, S. A. (1995). An operational semantics for timed CSP. Inform, and Comput. 116 , 193-213.

[49]

Steggles, P. (1988), "A Suggestion for a New Temporal LOTOS Semantics," Technical Report. GEC.

[50]

Winskel, G. (1985), "A Complete Proof System for SCCS with Modal Assertions," Technical Report, Cambridge.

[51]

Yi, W. (1990), Real-time behavior of asynchronous agents, in "Lecture Notes in Computer Science." Vol, 458, pp. 502-520, Springer-Verlag, Berlin/New York.

[52]

Yi. W. (1991), "A Calculus of Real Time Systems," Ph.D. Thesis, Chalmers University.

[53]

Zedan, H. (Ed.) (1989), "Real-Time Systems Theory and Applications," North-Holland, Amsterdam.

Cited By

Zhang TSharma UKapritsos M(2023)Performal: Formal Verification of Latency Properties for Distributed SystemsProceedings of the ACM on Programming Languages10.1145/35912357:PLDI(368-393)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591235
Bernardo MMezzina C(2023)Causal Reversibility for Timed Process Calculi with Lazy/Eager Durationless Actions and Time AdditivityFormal Modeling and Analysis of Timed Systems10.1007/978-3-031-42626-1_2(15-32)Online publication date: 19-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-42626-1_2
Lanotte RMerro MMunteanu A(2022)Industrial Control Systems Security via Runtime EnforcementACM Transactions on Privacy and Security10.1145/354657926:1(1-41)Online publication date: 9-Nov-2022
https://dl.acm.org/doi/10.1145/3546579
Show More Cited By

Index Terms

A Process Algebra for Timed Systems

Recommendations

Process algebra for hybrid systems
Process algebra

We propose a process algebra obtained by extending a combination of the process algebra with continuous relative timing from Baeten and Middelburg (Process Algebra with Timing, Springer, Berlin, 2002, Chapter 4), and the process algebra with ...
Forgetting the time in timed process algebra: timeless behaviour in a timestamped world
FMOODS'10/FORTE'10: Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems

In this paper, we propose the notion of partial time abstraction for timed process algebras, which introduces the possibility to abstract away parts of the timing of system behaviour. Adding this notion leads to so-called partially timed process ...
Construction of quotient BCI(BCK)-algebra via a fuzzy ideal

The present paper gives a new construction of a quotient BCI(BCK)- algebra X/µ by a fuzzy ideal µ in X and establishes the Fuzzy Homomorphism Fundamental Theorem. We show that if µ is a fuzzy ideal (closed fuzzy ideal) of X. then X/µ is a commutative (...

Comments

Information & Contributors

Information

Published In

cover image Information and Computation

Information and Computation Volume 117, Issue 2

March 1995

132 pages

ISSN:0890-5401

Editor:
Albert R. Meyer
Massachusetts Institute of Technology, Cambridge

Issue’s Table of Contents

Copyright © Academic Press.

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 March 1995

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

81
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhang TSharma UKapritsos M(2023)Performal: Formal Verification of Latency Properties for Distributed SystemsProceedings of the ACM on Programming Languages10.1145/35912357:PLDI(368-393)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591235
Bernardo MMezzina C(2023)Causal Reversibility for Timed Process Calculi with Lazy/Eager Durationless Actions and Time AdditivityFormal Modeling and Analysis of Timed Systems10.1007/978-3-031-42626-1_2(15-32)Online publication date: 19-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-42626-1_2
Lanotte RMerro MMunteanu A(2022)Industrial Control Systems Security via Runtime EnforcementACM Transactions on Privacy and Security10.1145/354657926:1(1-41)Online publication date: 9-Nov-2022
https://dl.acm.org/doi/10.1145/3546579
Nweke LWeldehawaryat GWolthusen S(2022)Corrigendum to Threat Modelling of Cyber-Physical Systems Using an Applied π-CalculusInternational Journal of Critical Infrastructure Protection10.1016/j.ijcip.2021.10050636:COnline publication date: 1-Mar-2022
https://dl.acm.org/doi/10.1016/j.ijcip.2021.100506
Gigante NMicheli AMontanari AScala E(2022)Decidability and complexity of action-based temporal planning over dense timeArtificial Intelligence10.1016/j.artint.2022.103686307:COnline publication date: 1-Jun-2022
https://dl.acm.org/doi/10.1016/j.artint.2022.103686
Baxter JRibeiro PCavalcanti A(2022)Sound reasoning in tock-CSPActa Informatica10.1007/s00236-020-00394-359:1(125-162)Online publication date: 1-Feb-2022
https://dl.acm.org/doi/10.1007/s00236-020-00394-3
Bocchi LLanese IMezzina CYuen S(2022)The Reversible Temporal Process LanguageFormal Techniques for Distributed Objects, Components, and Systems10.1007/978-3-031-08679-3_3(31-49)Online publication date: 13-Jun-2022
https://dl.acm.org/doi/10.1007/978-3-031-08679-3_3
Bocchi LLange JThompson SVoinea A(2022)A Model of Actors and Grey FailuresCoordination Models and Languages10.1007/978-3-031-08143-9_9(140-158)Online publication date: 13-Jun-2022
https://dl.acm.org/doi/10.1007/978-3-031-08143-9_9
Lanotte RMerro MMunteanu A(2021)A process calculus approach to detection and mitigation of PLC malwareTheoretical Computer Science10.1016/j.tcs.2021.08.021890:C(125-146)Online publication date: 12-Oct-2021
https://dl.acm.org/doi/10.1016/j.tcs.2021.08.021
Lanotte RMerro MMunteanu AViganò L(2020)A Formal Approach to Physics-based Attacks in Cyber-physical SystemsACM Transactions on Privacy and Security10.1145/337327023:1(1-41)Online publication date: 5-Feb-2020
https://dl.acm.org/doi/10.1145/3373270
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents