A process algebra of communicating shared resources with dense time and priorities

Theoretical Computer Science

Volumn 189, Issue 1-2, 1997, Pages 179-219

  Brémond Grégoire, Patrice ^a   Lee, Insup ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL LINGUISTICS; COMPUTER SIMULATION; CONSTRAINT THEORY; FORMAL LOGIC; MATHEMATICAL OPERATORS; REAL TIME SYSTEMS;

ALGEBRA OF COMMUNICATING SHARED RESOURCES (ACSR);

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0031356362     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00229-0     Document Type: Article

References (58)

1. M. Abadi and L. Lamport, An old-fashioned recepi for real time, in: Proc. REX Workshop on Real Time: Theory and Practice, Lecture Notes in Computer Science, Vol. 600 (Springer, Berlin, 1991).
2. L. Aceto, B. Bloom and F. Vaandrager, Turning SOS rules into equations, Tech. Report CS-R9218, CWI, Amsterdam, The Netherlands, 1992.
3. R. Alur, Techniques for automatic verification of real-time systems, Ph.D. Thesis, Stanford University, 1991.
4. R. Alur and D. Dill, Automata for modeling real-time systems, in: Proc. 17th ICALP, Lecture Notes in Computer Science, Vol. 443 (Springer, Berlin, 1990) 322-335.
5. R. Alur and T. Henzinger, A really temporal logic, in: Proc. 30th IEEE FOCS, 1989.
6. R. Alur and T. Henzinger, Real-time logics: complexity and expressiveness, in: Proc. IEEE Symp. on Logic in Computer Science, 1990.
7. J. Baeten, J. Bergstra and J. Klop, Syntax and defining equations for an interrupt mechanism in process algebra, Fund. Inform. IX (1986) 127-168.
8. J. Baeten, J. Bergstra and J. Klop, Ready-trace semantics for concrete process algebra with a priority operator, Comput. J. 30 (1987) 498-506.
9. J.C.M. Baeten and J.A. Bergstra, Real time process algebra, Tech. Report CS-R9053, Centre for Mathematics and Computer Science, Amsterdam, Netherlands, 1990.
10. H. Ben-Abdallah, I. Lee and J.Y. Choi, A graphical language with formal semantics for the specification and analysis of real-time systems, in: Proc. IEEE Real-Time Systems Symp., December 1995.
11. J.A. Bergstra and J.W. Klop, Algebra of communicating processes, Tech. Report CS-R8420, Centre for Mathematics and Computer Science, Amsterdam, Netherlands, 1984.
12. J.A. Bergstra and J.W. Klop, Algebra of communicating processes with abstraction, J. Theoret. Comput. Sci. 37 (1985) 77-121.
13. B. Bloom, Ready, set, go: Structural operational semantics for linear-time process algebras, Tech. Report TR 93-1372, Cornell University, 1993.
14. B. Bloom, Structural operational semantics for weak bisimulation, Tech. Report TR 93-1373, Cornell University, 1993.
15. T. Bolognesi and S.A. Smolka, Fundamental results for the verification of observational equivalence, in: Protocol Specification, Testing and Verification (North-Holland, Amsterdam, 1987).
16. P. Brémond-Grégoire, An algebra of communicating shared resources with dense time and priorities, Ph.D. Thesis, Department of Computer and Information Science, University of Pennsylvania, 1994.
17. P. Brémond-Grégoire, J.Y. Choi and I. Lee, The soundness and completeness of ACSR (algebra of communicating shared resources), Tech. Report MS-CIS-93-59, Univ. of Pennsylvania, June 1993.
18. L. Chen, Specification and verification of real-time systems, unpublished report, 1992.
19. D. Clarke, I. Lee and H.L. Xie, VERSA: a tool for the specification and analysis of resource-bound real-time systems, J. Comput. Software Eng. 3 (1995) 185-215.
20. R. Cleaveland and M. Hennessy, Priorities in process algebras, in: Proc. IEEE Symp. on Logic in Computer Science, 1988.
21. R. Cleaveland and M. Hennessy, Priorities in process algebras, Inform. Comput. 87 (1990) 58-77.
22. M.K. Franklin and A. Gabrielian, A transformational method for verifying safety properties in real-time systems, in: Proc. IEEE Real-Time Systems Symp. (1989) 112-123.
23. A. Fredette and R. Cleaveland, RTSL: a formal language for real-time schedulability analysis, Tech. Report TR-93-09, North Carolina State University, 1993.
24. A. Gabrielian and M.K. Franklin, State-based specification of complex real-time systems, in: Proc. IEEE Real-Time Systems Symp., December 1988.
25. R. Gerber, Communicating shared resources: a model for distributed real-time systems. Ph.D. Thesis, Department of Computer and Information Science, University of Pennsylvania, 1991.
26. R. Gerber and I. Lee, A resource-based prioritized bisimulation for real-time systems, Inform. Comput. 113 (1994) 102-142.
27. R. Gerth and A. Boucher, A timed failure semantics for extended communicating processes, Tech. Report TR. 4-4(1), Department of Mathematics and Computing Science, Eindhoven University of Technology, March 1987.
28. M. Hennessy and T. Regan, A process algebra for timed systems, Tech. Report 5/91, Univ. of Sussex, UK, April 1991.
29. C.A.R. Hoare, Communicating sequential processes, Comm. ACM 21 (1978) 666-676.
30. C.A.R. Hoare, Communicating Sequential Processes (Prentice-Hall, Englewood Cliffs, NJ, 1985).
31. F. Jahanian, R.S. Lee and A. Mok, Semantics of modechart in real time logic, in: Proc. 21st Hawaii Internat. Conf. on System Sciences, January 1988.
32. F. Jahanian and A.K. Mok, Safety analysis of timing properties in real-time systems, IEEE Trans. Software Eng. SE-12 (1986) 890-904.
33. F. Jahanian and A.K. Mok, A graph-theoretic approach for timing analysis and its implementation, IEEE Trans. Comput. C-36 (1987) 961-975.
34. F. Jahanian, A.K. Mok and D. Stuart, Formal specification of real-time system, Tech. Report TR 88-25, Department of Computer Science, University of Texas at Austin, 1988.
35. R. Koymans, Specifying real-time properties with metric temporal logic. Real-Time Systems 2 (1990) 255-299.
36. R. Koymans and W.P. de Roever, Examples of real-time temporal specification, in: The Analysis of Concurrent systems, Lecture Notes in Computer Science, Vol. 207 (Springer, Berlin, 1985) 231-252.
37. R. Koymans, J. Vytopil and W.P. de Roever, Real-time programming and asynchronous message passing. in: 2nd ACM Symp. on Principles of Distributed Computing (ACM Press, New York, 1983) 187-197.
38. L. Lamport, The temporal logics of actions, Tech. Report, DEC Systems Research Center, Palo Alto, California, 1991.
39. I. Lee, P. Brémond-Grégoire and R. Gerber, A process algebra approach to the specification and analysis of resource-based real-time systems, Proc. IEEE, January 1994.
40. N. Lynch and M. Tuttle, An introduction to input/output automata, Tech. Report MIT/LCS/TM-373, Laboratory for Computer Science, Massachusetts Institute of Technology, 1988.
41. N. Lynch and F. Vaandrager, Forward and Backward Simulations for Timing Based Systems, in: Proc. REX Workshop "Real-Time: Theory in Practice", Lecture Notes in Computer Science. Vol. 600 (Springer, Berlin, 1991).
42. P. Merlin, A study of the recoverability of communication protocols, Ph.D. Thesis, University of California, Irvine, Computer Science Department, 1974.
43. R. Milner, A Calculus for Communicating Systems, Lecture Notes in Computer Science, Vol. 92 (Springer, Berlin, 1980).
44. R. Milner, Calculi for synchrony and asynchrony, Theoret. Comput. Sci. 25 (1983) 267-310.
45. R. Milner, A complete axiomatisation for observational congruence of finite-state behaviors, Inform. Comput. 81 (1989) 227-247.
46. R. Milner, Communication and Concurrency (Prentice-Hall, Englewood Cliffs, NJ, 1989).
47. F. Moller and C. Tofts, A temporal calculus of communicating systems, in: Proc. CONCUR '90, Lecture Notes in Computer Science, Vol. 458 (Springer, Berlin, 1990) 401-415.
48. X. Nicollin and J. Sifakis, The algebra of timed processes ATP: theory and application, Tech. Report RT-C26, Institut National Polytechnique De Grenoble, November 1991.
49. D. Park, Concurrency and automata on infinite sequences, in: Proc. 5th G1 Conf., Lecture Notes in Computer Science, Vol. 104 (Springer, Berlin, 1981).
50. A. Pnueli, The temporal logic of programs, in: Proc. of Foundations of Computer Science (1977) 46-57.
51. C. Ramchandani, Analysis of asynchronous concurrent systems by Petri nets, Ph.D. Thesis, MIT, Department of Electrical Engineering, February 1974.
52. G.M. Reed and A.W. Roscoe, A timed model for communicating sequential processes, in: Proc. Internat. Conf. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 226 (Springer, Berlin, 1986).
53. J. Sifakis, Performance evaluation of systems using nets, in: W. Brauer, ed., Net Theory and Applications, Lecture Notes in Computer Science, Vol. 84 (Springer, Berlin, 1980) 307-319.
54. F. Vaandrager and N. Lynch, Action transducers and timed automata, in: Proc. CONCUR '92, Internat. Conf. on Concurrency Theory, Lecture Notes in Computer Science, Vol. 630 (Springer, Berlin, 1992).
55. Y. Wang, CCS + time = an interleaving model for real time systems, in: Proc. Internat. Conf. on Automata, Languages and Programming, July 1991.
56. C. Zhou, M. Hansen, A. Ravn and H. Rischel, Duration specification for shared processors, in: Proc. Formal Techniques in Real-Time and Fault-Tolerant Systems, Lecture Notes in Computer Science, Vol. 571 (Springer, Berlin, 1992) 21-32.
57. A. Zwarico, Timed acceptance: an algebra of time dependent computing, Ph.D. Thesis, Department of Computer and Information Science, University of Pennsylvania, 1988.
58. A. Zwarico, R. Gerber and I. Lee, A complete axiomatization of real-time processes, Tech. Report MS-CIS-88-88, University of Pennsylvania, Department of Computer and Information Science, November 1988.