Located actions in process algebra with timing

Fundamenta Informaticae

Volumn 61, Issue 3-4, 2004, Pages 183-211

  Bergstra, Jan A ^a,c   Middelburg, Cornells A ^b  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Asynchronous communication; Continuous relative timing; Distributed systems; Maximal progress; Process algebra; Spatially located actions; State operator; Urgent actions

Indexed keywords

ADAPTIVE ALGORITHMS; ALGEBRA; DATA COMMUNICATION SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; MOBILE TELECOMMUNICATION SYSTEMS; NETWORK PROTOCOLS; TIMING CIRCUITS;

ASYNCHRONOUS COMMUNICATION; CONTINUOUS RELATIVE TIMING; DISTRIBUTED SYSTEMS; MAXIMAL PROGRESS; PROCESS ALGEBRA; SPATIALLY LOCATED ACTIONS; URGENT ACTIONS;

PROCESS CONTROL;

EID: 4043057128     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (24)

1. Aceto, L., Fokkink, W. J., Verhoef, C.: Structural Operational Semantics, in: Handbook of Process Algebra (J. A. Bergstra, A. Ponse, S. A. Smolka, Eds.), Elsevier, Amsterdam, 2001, 197-292.
2. Baeten, J. C. M., Bergstra, J. A.: Real Time Process Algebra, Formal Aspects of Computing, 3(2), 1991, 142-188.
3. Baeten, J. C. M., Bergstra, J. A.: Real Space Process Algebra, Formal Aspects of Computing, 5(6), 1993, 481-529.
4. Baeten, J. C. M., Bergstra, J. A., Reniers, M. A.: Discrete Time Process Algebra with Silent Step, in: Proof, Language and Interaction: Essays in Honour of Robin Milner (G. D. Plotkin, C. Stirling, M. Tofte, Eds.), MIT Press, Cambridge, MA, 2000, 535-569.
5. Baeten, J. C. M., Middelburg, C. A.: Process Algebra with Timing: Real Time and Discrete Time, in: Handbook of Process Algebra (J. A. Bergstra, A. Ponse, S. A. Smolka, Eds.), Elsevier, Amsterdam, 2001, 627-684.
6. Baeten, J. C. M., Middelburg, C. A.: Process Algebra with Timing, Monographs in Theoretical Computer Science, An EATCS Series, Springer-Verlag, Berlin, 2002.
7. Baeten, J. C. M., Middelburg, C. A., Reniers, M. A.: A New Equivalence for Processes with Timing - With an Application to Protocol Verification, Computer Science Report 02-10, Department of Mathematics and Computer Science, Eindhoven University of Technology, October 2002.
8. Baeten, J. C. M., Weijland, W. P.: Process Algebra, vol. 18 of Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, Cambridge, 1990.
9. Bergstra, J. A., Klop, J. W.: Process Algebra for Synchronous Communication, Information and Control, 60(1/3), 1984, 109-137.
10. Bergstra, J. A., Klop, J. W.: Verification of an Alternating Bit Protocol by Means of Process Algebra, Mathematical Methods of Specification and Synthesis of Software Systems (W. Bibel, K. P. Jantke, Eds.), 215, Springer-Verlag, 1986.
11. Bergstra, J. A., Middelburg, C. A.: Process Algebra for Hybrid Systems, Computer Science Report 03-06, Department of Mathematics and Computer Science, Eindhoven University of Technology, June 2003.
12. Chen, L.: An Interleaving Model for Real-Time Systems, Symposium on Logical Foundations of Computer Science (A. Nerode, M. Taitslin, Eds.), 620, Springer-Verlag, 1992.
13. Davies, J., et al.: Timed CSP: Theory and Practice, Real Time: Theory and Practice (J. W. de Bakker, C. Huizing, W. P. de Roever, G. Rozenberg, Eds.), 600, Springer-Verlag, 1992.
14. Hennessy, M., Regan, T.: A Process Algebra for Timed Systems, Information and Computation, 117, 1995, 221-239.
15. Middelburg, C. A.: Variable Binding Operators in Transition System Specifications, Journal of Logic and Algebraic Programming, 47(1), 2001, 15-45.
16. Middelburg, C. A.: Process Algebra with Nonstandard Timing, Fundamenta Informaticae, 53(1), 2002, 55-77.
17. Middelburg, C. A.: An Alternative Formulation of Operational Conservativity with Binding Terms, Journal of Logic and Algebraic Programming, 55(1/2), 2003, 1-19.
18. Middelburg, C. A.: Revisiting Timing in Process Algebra, Journal of Logic and Algebraic Programming, 54(1/2), 2003, 109-127.
19. Moller, F., Tofts, C.: A Temporal Calculus of Communicating Systems, CONCUR'90 (J. C. M. Baeten, J. W. Klop, Eds.), 458, Springer-Verlag, 1990.
20. Nicollin, X., Sifakis, J.: The Algebra of Timed Processes ATP: Theory and Application, Information and Computation, 114(1), 1994, 131-178.
21. Quemada, J., de Frutos, D., Azcorra, A.: TIC: A Timed Calculus, Formal Aspects of Computing, 5(3), 1993, 224-252.
22. Tanenbaum, A. S.: Computer Networks, Prentice-Hall, Englewood Cliffs, 1981.
23. Verhoef, C.: A Congruence Theorem for Structured Operational Semantics with Predicates and Negative Premises, Nordic Journal of Computing, 2(2), 1995, 274-302.
24. Wang Yi: Real-Time Behaviour of Asynchronous Agents, CONCUR'90 (J. C. M. Baeten, J. W. Klop, Eds.), 458, Springer-Verlag, 1990.