A theory of prioritizing composition

Computer Journal

Volumn 39, Issue 8, 1996, Pages

  Sekerinski, Emil ^a   Sere, Kaisa ^b  

^a ÅBO AKADEMI UNIVERSITY   (Finland)

^b UNIVERSITY OF EASTERN FINLAND   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4243155467     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/39.8.701     Document Type: Article

References (26)

1. INMOS Ltd. (1988) occam2 Reference Manual. Prentice Hall, London, UK.
2. Back, R. J. R. (1989) Data refinement in the refinement calculus. In 22nd Hawaii International Conference of System Sciences, Kailua-Kona.
3. Chandy, K. M. and Misra, J. (1988) Parallel Program Design: A Foundation. Addison-Wesley, Reading, MA.
4. Lamport, L. (1990) A temporal logic of actions. Research Report 57, DEC System Research Center, Palo Alto, CA, April.
5. Baeten, J. C. M., Bergstra, J. A. and Klop, J. W. (1986) Syntax and defining equations for an interrupt mechanism in process algebra. Fundamenta Informaticae, 9,127-168.
6. Cleaveland, R. and Hennessy, M. C. P. (1990) Priorities in process algebra. Info. Computat., 87, 000-000.
7. Natarajan, V., Christoff, L.and Cleaveland, R. (1994) Priorities and abstraction in process algebra. In Thiagarajan, P. S. (ed.), Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, 880, Madras, India, Springer-Verlag, Berlin, Germany.
8. Fidge, C. J. (1993) A formal definition of priority in CSP. ACM Trans. Progr. Lang. Syst., 15, 681-705.
9. Lowe, G. (1995) Probabilistic and prioritized models of timed CSP. Theor. Comput. Sci., 128, 315-352.
10. Smolka, S. A. and Steffen, B. (1990) Priority as extremal probability. In Concur '90. Lecture Notes in Computer Science, 458. Springer-Verlag, Berlin, Germany.
11. Tofts, C. (1990) A synchronous calculus of relative frequency. In Concur '90, Lecture Notes in Computer Science, 458. Springer-Verlag, Berlin, Germany.
12. Back, R. J. R. and Sere,K. (1994) From action systems to modular systems. In Naftalin, M. , Denvir, T. and Bertran, M. (eds), Formal Methods Europe '94, pp. 1-25, Barcelona, Spain. Lecture Notes in Compter Science, 873, Springer-Verlag, Berlin, Germany.
13. Back, R. J. R. and Sere,K. (1994) From action systems to modular systems. In Naftalin, M. , Denvir, T. and Bertran, M. (eds), Formal Methods Europe '94, pp. 1-25, Barcelona, Spain. Lecture Notes in Compter Science, 873, Springer-Verlag, Berlin, Germany.
14. Dijkstra, E. W. (1976) A Discipline of Programming. Prentice-Hall, Englewood Cliffs, NJ.
15. Back, R. J. R. and von Wright, J. (1994) Trace refinement of action systems. In Jonsson, B. and Parrow, J. (eds), CONCUR '94: Concurrency Theory, Lecture Notes in Computer Science, 836 Springer-Verlag, Berlin, Germany.
16. Back, R. J. R. and Kurki-Suonio, R. (1983) Decentralization of process nets with centralized control. In 2nd ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 131-142.
17. Morgan, C. and Gardiner, P. H. B. (1990) Data refinement by calculation. Acta Informatica, 27, 481-503.
18. Morris, J. M. (1989) Laws of data refinement. Acta Informatica, 9, 287-306.
19. Back, R. J. R. and Sere, K. (1996) Superposition refinement of action systems. Formal Aspects Comput., 8, 324-346.
20. Rönkkö, M. , Sekerinski, E. and Sere, K. (1996) Control systems as action systems. In Smedinga, R. , Spathopoulos, M. P. and Kozák, P. (eds), WODES 96 - Workshop on Discrete Event Systems, Edinburgh. IEEE Press, Herts, UK.
21. Sekerinski, E. (1996) Deriving control programs by weakest preconditions. Research report, TUCS, Turku, Finland, April.
22. Fidge, C. J. and Wellings, A. J. (1995) An action-based formal model for concurrent, real-time systems. Technical Report 95-1, Software Verification Research Centre, Brisbane, Australia, January.
23. Back, R. J. R. (1989) Refinement calculus, part II: Parallel and reactive programs. In deBakker, J. W., deRoever, W. P.and Rozenberg, G. (eds), REX Workshop on Stepwise Refinement of Distributed Systems - Models, Formalisms, Correctness. Lecture Notes in Computer Science, /bf 430, pp. 67-93, Mook, The Netherlands. Springer-Verlag, Berlin, Germany.
24. Xu, Q. W. (1996) On compositionality in refining concurrent systems. In He, J. F. (ed.), BCS FACS 7th Refinement Workshop, Bath, UK. Springer-Verlag, Oxford, UK.
25. Brookes, S. (1993) Full abstraction for a shared variable parallel language. In 8th IEEE International Symposium on Logic in Computer Science, Montreal, Canada.
26. Henzinger, T. A., Manna, Z. and A. Pnucli (1994) Temporal proof methodologies for timed transition systems. Info. Computat., 112, 273-337.