2-nested simulation is not finitely equationally axiomatizable

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

Volumn 2010, Issue , 2001, Pages 39-50

  Aceto, Luca ^a   Fokkink, Wan ^b   Ingólfsdóttir, Anna ^a  

^a DANISH NATIONAL RESEARCH FOUNDATION   (Denmark)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

AXIOMATIZATION; CONGRUENCE FORMATS; LINEAR TIME BRANCHING TIME SPECTRUM; TRACE EQUIVALENCE; TYFT/TYXT FORMAT;

ARTIFICIAL INTELLIGENCE;

EID: 84957099297     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44693-1_4     Document Type: Conference Paper

References (21)

1. L. Aceto, Z. Ésik, and A. Ingólfsdóttir, On the two-variable fragment of the equational theory of the max-sum algebra of the natural numbers, in Proceedings of the 17th STACS, H. Reichel and S. Tison, eds., vol. 1770 of Lecture Notes in Computer Science, Springer-Verlag, Feb. 2000, pp. 267-278.
2. L. Aceto, Z. Ésik, and A. Ingólfsdóttir, The max-plus algebra of the natural numbers has no finite equational basis, research report, BRICS, Department of Computer Science, Aalborg University, October 1999. Pp. 25. To appear in Theoretical Computer Science.
3. L. Aceto, W. Fokkink, and A. Ingólfsdóttir, A menagerie of non-finitely based process semantics over BPA*—from ready simulation to completed traces, Mathematical Structures in Computer Science, 8 (1998), pp. 193-230.
4. J. Baeten and J. Klop, eds., Proceedings CONCUR 90, Amsterdam, vol. 458 of Lecture Notes in Computer Science, Springer-Verlag, 1990.
5. J. Bergstra and J. W. Klop, Fixed point semantics in process algebras, Report IW 206, Mathematisch Centrum, Amsterdam, 1982.
6. J. H. Conway, Regular Algebra and Finite Machines, Mathematics Series (R. Brown and J. De Wet eds.), Chapman and Hall, London, United Kingdom, 1971.
7. J. L. Gischer, The equational theory of pomsets, Theoretical Comput. Sci., 61 (1988), pp. 199-224.
8. R. van Glabbeek, The linear time - branching time spectrum, in Baeten and Klop [4], pp. 278-297.
9. J. F. Groote, A new strategy for proving ω-completeness with applications in process algebra, in Baeten and Klop [4], pp. 314-331.
10. J. F. Groote and F. Vaandrager, Structured operational semantics and bisimulation as a congruence, Information and Computation, 100 (1992), pp. 202-260.
11. R. Keller, Formal verification of parallel programs, Comm. ACM, 19 (1976), pp. 371-384.
12. H. Lin, An interactive proof tool for process algebras, in 9th Annual Symposium on Theoretical Aspects of Computer Science, vol. 577 of Lecture Notes in Computer Science, Cachan, France, 13-15 Feb. 1992, Springer, pp. 617-618.
13. R. Milner, An algebraic definition of simulation between programs, in Proceedings 2nd Joint Conference on Artificial Intelligence, William Kaufmann, 1971, pp. 481-489.
14. R. Milner, Communication and Concurrency, Prentice-Hall International, Englewood Cliffs, 1989.
15. W. Mitchell and D. Carlisle, Modal observation equivalence of processes,Technical Report UMCS-96-1-1, Manchester University, Computer Science, 1996.
16. F. Moller, The importance of the left merge operator in process algebras, in Proceedings 17th ICALP, Warwick, M. Paterson, ed., vol. 443 of Lecture Notes in Computer Science, Springer-Verlag, July 1990, pp. 752-764.
17. F. Moller, The nonexistence of finite axiomatisations for CCS congruences, in Proceedings 5th Annual Symposium on Logic in Computer Science, Philadelphia, USA, IEEE Computer Society Press, 1990, pp. 142-153.
18. G. Plotkin, A structural approach to operational semantics, Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
19. V. Redko, On defining relations for the algebra of regular events, Ukrainskii Matematicheskii Zhurnal, 16 (1964), pp. 120-126. In Russian.
20. P. Sewell, Nonaxiomatisability of equivalences over finite state processes, Annals of Pure and Applied Logic, 90 (1997), pp. 163-191.
21. S. K. Shukla, D. J. Rosenkrantz, H. B. Hunt III, and R. E. Stearns, A HORNSAT based approach to the polynomial time decidability of simulation relations for ifanite state processes, in DIMACS Workshop on Satisfiability Problem: Theory and Applications, D. Du, J. Gu, and P. M. Pardalos, eds., vol. 35 of DI-MACS Series in Discrete Mathematics and Computer Science, 1996, pp. 603-642.