A Complete Axiomatization of Finite-state ACSR Processes

Information and Computation

Volumn 138, Issue 2, 1997, Pages 124-159

  Brémond Grégoire, Patrice ^a   Choi, Jin Young ^a,b   Lee, Insup ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b Korea University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347936128     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1997.2657     Document Type: Article

References (27)

1. Baeten, J. C. M., and Bergstra, J. A. (1991), Real time process algebra, Formal Aspects Comput. 3(2), 142-188.
2. Baeten, J. C. M., and Bergstra, J. A. (1992), Discrete time process algebra, in "CONCUR 92," Lecture Notes in Computer Science, Vol. 630, pp. 401-420, Springer-Verlag, Berlin.
3. Baeten, J., Bergstra, J., and Klop, J. (1987), Ready-trace semantics for concrete process algebra with a priority operator, Comput. J. 30(6), 498-506.
4. Brémond-Grégoire, P. (1994), "A Process Algebra of Communicating Shared Resources with Dense Time and Priorities," Ph.D. thesis, Department of Computer and Information Science, The University of Pennsylvania.
5. Bergstra, J. A., and Klop, J. W. (1985), Algebra of communicating processes with abstraction, J. Theoret. Comput. Sci. 37, 77-121.
6. Bolognesi, T., and Smolka, S. (1987), Fundamental results for verification of observational equivalence, in "Protocol Specification, Testing and Verification."
7. Cleaveland, R., and Hennessy, M. (1990), Priorities in process algebras, Inform. and Comput. 87, 58-77.
8. Choi, J.-Y., Lee, I., and Xie, H.-L. (1995), The specification and schedulability analysis of real-time systems using ACSR, in "Proceedings, 16th IEEE Real-Time Systems Symposium."
9. Camilleri, J., and Winskel, G. (1991), CCS with Priority Choice, in "Proceedings, 6th IEEE Symposium on Logic in Computer Science."
10. Davies, J., and Schneider, S. (1995), A brief history of timed CSP, Theoret. Comput. Sci. 138, 243-271.
11. Gerber, R. (1991) "Communicating Shared Resources: A Model for Distributed Real-Time Systems," Ph.D. thesis, Department of Computer and Information Science, University of Pennsylvania.
12. Gerber, R., and Lee, I. (1994), A resource-based prioritized bisimulation for real-time systems, Inform. and Comput. 113(1), 102-142.
13. Hennessy, M. (1988), "Algebraic theory of processes," MIT Press Series in the Foundations of Computing, MIT Press.
14. Hennessy, M., and Regan, T. (1990), "A Temporal Process Algebra," Technical Report 2/90, University of Sussex.
15. Hoare, C. (1985), "Communicating Sequential Processes," Prentice-Hall, Englewood Cliffs, NJ.
16. Klusener, A. S. (1991), Completeness in real time process algebra, in "Proceedings, CONCUR 91," Lecture Notes in Computer Science, Vol. 715, pp. 376-392, Springer-Verlag, Berlin.
17. Lee, I., Brémond-Grégoire, P., and Gerber, R. ( 1994), A process algebraic approach to the specification and analysis of resource-bound real-time systems, Proc. IEEE, 158-171.
18. Lee, I., and Gehlot, V. (1985), Language constructs for distributed real-time programming, in "Proceedings, 5th IEEE Real-Time Systems Symposium."
19. Milner, R. (1980), "A Calculus for Communicating Systems," Lecture Notes in Computer Science, Vol. 92, Springer-Verlag, Berlin.
20. Milner, R. (1983), Calculi for synchrony and asynchrony, Theoret. Comput. Sci. 25, 267-310.
21. Milner, R. (1984), A complete inference system for a class of regular behaviours, J. Comput. System Sci. 28, 439-466.
22. Milner, R. (1989), "Communication and Concurrency," Prentice-Hall, New York.
23. Milner, R. (1989a), A complete axiomatisation for observational congruence of finite-state behaviors, Inform. and Comput. 81, 227-247.
24. Moller, F., and Tofts, C. (1990), A temporal calculus of communicating systems, in "Proceedings, CONCUR '90," Lecture Notes in Computer Science, Vol. 458, pp. 401-415, Springer-Verlag, Berlin.
25. Nicollin, X., and Sifakis, J. (1994), The algebra of timed processes ATP: Theory and application, Inform. and Comput. 114(1), 131-178.
26. Park, D. (1981), Concurrency and automata on infinite sequences, in "Proceedings, 5th GI Conference," Lecture Notes in Computer Science, Vol. 104, Springer-Verlag, Berlin.
27. Yi, W. (1991), CCS + time = An interleaving model for real time systems, in "Proceedings, International Conference on Automata, Languages and Programming."