Process languages for rooted eager bisimulation

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

Volumn 1877 LNCS, Issue , 2000, Pages 275-289

  Ulidowski, Irek ^a   Yuen, Shoji ^b  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b NAGOYA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BISIMULATIONS; GENERAL CLASS; PREORDERS; PROCESS LANGUAGES; PROCESS OPERATORS; SOS APPROACH; TRANSITION RULE;

SYSTEMS ENGINEERING; COMPUTATIONAL LINGUISTICS;

SYSTEMS ENGINEERING;

EID: 0011191212     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44618-4_21     Document Type: Conference Paper

References (31)

1. S. Abramsky. Observation equivalence as a testing equivalence. Theoretical Computer Science, 53: 225-241, 1987.
2. L. Aceto, B. Bloom, and F. W. Vaandrager. Turning SOS rules into equations. Information and Computation, 111: 1-52, 1994.
3. L. Aceto, W. Fokkink, R. van Glabbeek, and A. Ingólfsdó ttir. Axiomatizing prefix iteration with silent steps. Information and Computation, 127: 1-52, 1996.
4. L. Aceto and A. Ingólfsdóttir. CPO models for a class of GSOS languages. In P. D. Mosses, M. Nielsen, and M. I. Schwartzbach, editors, Proceedings of TAPSOFT'95, Volume 915 of Lecture Notes in Computer Science. Springer, 1995.
5. J. C. M. Baeten and W. P. Weijland. Process Algebra, Volume 18 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.
6. B. Bloom. Structural operational semantics for weak bisimulations. Theoreti cal Computer Science, 146: 27-68, 1995.
7. B. Bloom. Stuctured operational semantics as a specification language. In Conference Record of the 22nd ACM Symposium on Principles of Programming Languages, 1995.
8. 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, 1988.
9. B. Bloom, S. Istrail, and A. R. Meyer. Bisimulation can't be traced. Journal of ACM, 42(1): 232-268, 1995.
10. R. de Simone. Higher-level synchronising devices in MEIJE-SCCS. Theoretical Computer Science, 37: 245-267, 1985.
11. W. J. Fokkink. Rooted branching bisimulation as a congruence. Journal of Computer and System Sciences, 60(1): 13-37, 2000.
12. R. J. van Glabbeek. Comparative Concurrency Semantics and Refinement of Actions. PhD thesis, CWI, 1990.
13. R. J. van Glabbeek and W. P. Weijland. Branching time and abstraction in bisimulation semantics. Journal of the ACM, 43(3): 555-600, 1996.
14. J. F. Groote. Transition system specifications with negative premises. Theoreti cal Computer Science, 118(2): 263-299, 1993.
15. M. Hennessy. An Algebraic Theory of Processes. The MIT Press, 1988.
16. M. Hennessy and T. Regan. A process algebra for timed systems. Information and Computation, 117: 221-239, 1995.
17. R. Milner. A Calculus for Communicating Systems, Volume 92 of Lecture Notes in Computer Science. Springer, 1980.
18. R. Milner. A modal characterisation of observable machine behaviours. In G. Aste-siano and C. Böhm, editors, Proceedings of CAAP'81, Volume 112 of Lecture Notes in Computer Science. Springer, 1981.
19. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
20. R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoreti cal Computer Science, 34: 83-133, 1984.
21. G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, 1981.
22. I. Ulidowski. Equivalences on observable processes. In Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Science Press, 1992.
23. I. Ulidowski. Local Testing and Implementable Concurrent Processes. PhD thesis, Imperial College, University of London, 1994.
24. I. Ulidowski. Finite axiom systems for testing preorder and De Simone process languages. Theoretical Computer Science, 239(1): 97-139, 2000.
25. I. Ulidowski and I. C. C. Phillips. Formats of ordered SOS rules with silent actions. In M. Bidoit and M. Dauchet, editors, Proceedings of the 7th International Conference on Theory and Practice of Software Development TAPSOFT'97, Volume 1214 of Lecture Notes in Computer Science. Springer, 1997.
26. I. Ulidowski and I. C. C. Phillips. Ordered SOS rules and process languages for branching and eager bisimulations. Technical Report 1999/15, Department of Mathematics and Computer Science, Leicester University, 1999.
27. I. Ulidowski and S. Yuen. Process languages for rooted weak preorders. Full version of this paper, available at http://www.mcs.le.ac.uk/~iulidowski.
28. I. Ulidowski and S. Yuen. Extending process languages with time. In M. Johnson, editor, Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology AMAST'97, Volume 1349 of Lecture Notes in Computer Science. Springer, 1997.
29. C. Verhoef. A congruence theorem for structured operational semantics with predicates and negative premises. Nordic Journal of Computing, 2(2): 274-302, 1995.
30. D. Walker. Bisimulation and divergence. Information and Computation, 85(2): 202-241, 1990.
31. W. P. Weijland. Synchrony and Asynchrony in Process Algebra. PhD thesis, University of Amsterdam, 1989.