Finite axiom systems for testing preorder and De Simone process languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1101, Issue , 1996, Pages 210-224

  Ulidowski, Irek ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; SPECIFICATIONS;

AUTOMATICALLY GENERATED; AXIOM SYSTEM; IMPORTANT FEATURES; MULTI-MEDIA; PREORDERS; PROCESS LANGUAGES; PROCESS OPERATORS; SPECIFICATION AND VERIFICATION;

SOFTWARE ENGINEERING;

EID: 0348092949     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0014317     Document Type: Conference Paper

References (19)

1. L. Aceto, B. Bloom, and F.W. Vaandrager. Turning SOS rules into equations. In Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, California, 1992.
2. L. Aceto. Deriving complete inteference systems for a class of GSOS languages generating regular behaviours. In Proceedings of the 5th International Conference CONCUR'94, Uppsala, Sweden, 1994. LNCS 789.
3. L. Aceto and A. Ingólfdóttir. CPO models for a class of GSOS languages. In P.D. Mosses, M. Nielsen, and M.I. Schwartzbach, editors,Proceedings of TAPSOFT '95. Springer-Verlag, 1995. LNCS 915.
4. B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can't be traced: preliminary report. In Conference Record of the 15th ACM Symposium on Principles of Programming Languages, San Diego, California, 1988.
5. B. Bloom. Structural operational semantics for weak bisimulations. Technical Report TR 93-1373, Cornell, 1993. To appear in Theoretical Computer Science.
6. B. Bloom. Stuctured operational semantics as a specification language. In Conference Record of the 22nd ACM Symposium on Principles of Programming Languages, San Francisco, California, 1995.
7. J.C.M Baeten and W.P Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science, 1990.
8. R. de Simone. Higher-level synchronising devices in MEIJE-SCCS. Theoretical Computer Science, Vol. 37, pp. 245-267, 1985.
9. J.F. Groote and F. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, Vol. 100, pp. 202-260, 1990.
10. M. Hennessy. An Algebraic Theory of Processes. The MIT Press, 1988.
11. C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
12. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
13. R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, Vol. 34, pp. 83-133, 1984.
14. G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, 1981.
15. I. Ulidowski. Equivalences on observable processes. In Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, California, 1992.
16. I. Ulidowski. Local Testing and Implementable Concurrent Processes. PhD thesis, Imperial College, University of London, 1994.
17. I. Ulidowski. Axiomatisations of weak equivalences for De Simone languages. In I. Lee and S.A. Smolka, editors, Proceedings of the 6th International Conference on Concurrency Theory CONCUR'95, Philadelphia, 1995. Springer-Verlag. LNCS 962.
18. I. Ulidowski. Finite axiom systems for testing preorder and De Simone process languages. Technical report, RIMS, Kyoto University, 1995. Available at http://www.kurims.kyoto-u.ac.jp/∼irek/.
19. F.W. Vaandrager. On the relationship between process algebra and input/output automata. In Proceedings of the 6th Annual IEEE Symposium on Logic in Computer Science, Amsterdam, 1991.