The meaning of negative premises in transition system specifications

Journal of the ACM

Volumn 43, Issue 5, 1996, Pages 863-914

  Bol, Roland ^a   Groote, Jan Friso ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b CWI   (Netherlands)

Author keywords

Algebra; Bisimulation; Congruence; Conservative extension of TSSs; Logic programming; Negative premises; ntyft ntyxt format; Priorities and abstraction; Process algebra; Semantics

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; FORMAL LOGIC; THEOREM PROVING;

BASIC PROCESS ALGEBRA (BPA); BISIMULATION RELATION; CONSERVATIVITY THEOREM; TRANSITION RELATION; TRANSITION SYSTEM SPECIFICATIONS (TSSS);

LOGIC PROGRAMMING;

EID: 0030231273     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/234752.234756     Document Type: Article

References (48)

1. ACETO, L. 1994. Deriving complete inference systems for a class of GSOS languages generating regular behaviours. In Proceedings of CONCUR '94, B. Jonsson and J. Parrow, eds. Lecture Notes in Computer Science, vol. 836. Springer-Verlag, New York, pp. 449-464.
2. ACETO, L., BLOOM, B., AND VAANDRAGER, F. W. 1994. Turning SOS rules into equations. Inf. Comput. 111, 1, 1-52.
3. ACETO, L., AND INGÓLFSDÓTTIR, A. 1994/1995. CPO models for a class of GSOS languages. In TAPSOFT '95, 6th International Joint Conference on Theory and Practice of Soffware Development, (Århus, Denmark), P. D. Mosses, M. Nielsen, and M. I. Schwartzbach, eds. Lecture Notes in Computer Science, vol. 915. Springer-Verlag, New York, 1995, pp. 439-453. (Full version appeared as CPO Models for GSOS Languages - Part I: Compact GSOS Languages, BRICS research report RS-94-10, Department of Mathematics and Computer Science, Aalborg University, 1994.)
4. ACETO, L., AND INGÓLFSDÓTTIR, A. 1994/1995. CPO models for a class of GSOS languages. In TAPSOFT '95, 6th International Joint Conference on Theory and Practice of Soffware Development, (Århus, Denmark), P. D. Mosses, M. Nielsen, and M. I. Schwartzbach, eds. Lecture Notes in Computer Science, vol. 915. Springer-Verlag, New York, 1995, pp. 439-453. (Full version appeared as CPO Models for GSOS Languages - Part I: Compact GSOS Languages, BRICS research report RS-94-10, Department of Mathematics and Computer Science, Aalborg University, 1994.)
5. APT, K. R., AND BOL, R. N. 1994. Logic programming and negation: A survey. J. Logic Program. 19-20, 9-71.
6. BAETEN, J. C. M., AND BERGSTRA, J. A. 1988. Processen en procesexpressies. Informatie 30, 3, 177-248 (in Dutch).
7. BAETEN, J. C. M., BERGSTRA, J. A., AND KLOP, J. W. 1986. Syntax and defining equations for an interrupt mechanism in process algebra. Fund. Inf. IX, 2, 127-168.
8. BAETEN, J. C. M., AND VERHOEF, C. 1993. A congruence theorem for structured operational semantics with predicates. In Proceedings of CONCUR '93, E. Best, ed. Lecture Notes in Computer Science, vol. 715. Springer-Verlag, New York, pp. 477-492.
9. BAETEN, J. C. M., AND WEULAND, W. P. 1990. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, Cambridge, Mass.
10. BEST, E., AND KOUTNY, M. 1990. Partial order semantics of priority systems. Tech. Rep. 6/90. Univ. Hildesheim, Institut für Informatik.
11. BLOOM, B. 1995. Structural operational semantics for weak bisimulations. Theoret. Comput. Sci. 146, 25-68.
12. BLOOM, B., ISTRAIL, S., AND MEYER, A. R. 1995. Bisimulation can't be traced. J. ACM 42, 1 (Jan.), 232-268.
13. BOLOGNESI, T., LUCIDI, F., AND TRIGILA, S. 1990. From timed Petri nets to timed LOTOS. In Proceedings of the 10th IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification, (Ottawa, Ont., Canada). North-Holland, Amsterdam, The Netherlands, pp. 395-408.
14. CAMILLERI, J. 1989. An operational semantics for OCCAM. Int. J. Parall. Prog. 18, 5, 149-167.
15. CHEN, W., AND WARREN, D. S. 1993. Query evaluation under the well founded semantics. In Proceedings of the 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (Washington, D. C., May 25-28). ACM, New York, pp. 168-179.
16. CLEAVELAND, R., AND HENNESSY, M. 1988. Priorities in process algebra. In Proceedings of the 3rd Annual Symposium on Logic in Computer Science, (Edinburgh, Scotland). IEEE Computer Society Press, New York, pp. 193-202.
17. D'ARGENIO, P. R. 1995. A general conservative extension theorem in process algebras with inequalities. In Proceedings of ACP'95, A. Ponse, C. Verhoef, and S. F. M. van Vlijmen, eds. Computing Science Reports 95-14, Department of Mathematics and Computer Science, Eindhoven University of Technology.
18. DEMBINSKI, P., AND MAŁUSZYNSKI, J. 1985. And-parallelism with intelligent backtracking for annotate logic programs. In Proceedings of the 7th Symposium on Logic Programming, (Boston, Mass.). pp. 29-38.
19. FOKKINK, W. J. AND VAN GLABBEEK, R. J. 1996. Ntyft/ntyxt rules reduce to ntree rules. Inf. Comput., to appear.
20. FOKKINK, W. J., AND VERHOEF, C. 1995. A conservative look at term deduction systems with variable binding. Computing Science Reports 95-28, Dept. of Mathematics and Computing Science, Eindhoven University.
21. VAN GELDER, A., Ross, K. AND SCHLIPF, J. S. 1988. Unfounded sets and well-founded semantics for general logic programs. In Proceedings of the 7th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, (Austin, Texas, March 21-23). ACM, New York, pp. 221-230.
22. GELFOND, M., AND LIFSCHITZ, V. 1988. The stable model semantics for logic programming. In Proceeding of the 5th International Conference on Logic Programming, (Cambridge, Mass.), R. Kowalski and K. Bowen, eds. MIT Press, Cambridge, Mass., pp. 1070-1080.
23. VAN GLABBEEK, R. J. 1987. Bounded nondeterminism and the approximation induction principle in process algebra. In Proceedings of STACS 87, F. J. Brandenburg. G. Vidal-Naquet, and M. Wirsing, eds. Lecture Notes in Computer Science, vol. 247. Springer-Verlag, New York, pp. 336-347.
24. VAN GLABBEEK, R. J. 1990. The linear-branching time spectrum. In Proceedings of CONCUR90, (Amsterdam, The Netherlands), J. C. M. Baeten and J. W. Klop, eds. Lecture Notes in Computer Science, vol. 458. Springer-Verlag, New York, pp. 278-297.
25. VAN GLABBEEK, R. J. 1993a. Full abstraction in structural operational semantics. In Proceedings of AMAST '93, Workshops in Computing. Springer-Verlag, New York, pp. 77-84.
26. VAN GLABBEEK, R. J. 1993b. The linear time-branching time spectrum II (The semantics of sequential systems with silent moves). In Proceedings of CONCUR93, E. Best, ed. Lecture Notes Computer Science, vol. 715. Springer-Verlag, New York, pp. 66-81.
27. VAN GLABBEEK, R. J. 1995. The meaning of negative premises in transition system specifications II. Technical Note CS-95-16, Stanford University, Available by anonymous ftp at ftp:// boole.stanford.edu/pub/DVI/negative.dvi.gz.
28. GROOTE, J. F. 1993. Transition system specifications with negative premises. Theoret. Comput. Sci. 118, 2, 263-299.
29. GROOTE, J. F., AND VAANDRAGER, F. W. 1992. Structured operational semantics and bisimulation as a congruence. Inf. Comput. 100, 2 (Oct.), 202-260.
30. HENNESSY, M., AND PLOTKIN, G. D. 1979. Full abstraction for a simple programming language. In Proceedings of the 8th Symposium on Mathematical Foundations of Computer Science, J. Bečvář, ed. Lecture Notes in Computer Science, vol. 74. Springer-Verlag, New York, pp. 108-120.
31. HENNESSY, M., AND REGAN, T. 1990. A temporal process algebra. Report 2/90, Computer Science Department, Univ. Sussex, Sussex, England.
32. HOWE, D. J. 1996. Proving congruence of bisimulation in functional programming languages. Inf. Comput. to appear.
33. ICHIKAWA, H., YAMANAKA, K., AND KATO, J. 1990. Incremental specifications in LOTOS. In Proceedings of the 10th IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification, (Ottowa, Ont., Canada), North-Holland, Amsterdam, The Netherlands, L. Logrippo, R. L. Probert, and H. Ural, eds. pp. 183-196.
34. JANICKI, R. 1987. A formal semantics for concurrent systems with a priority relation. Acta. Inf. 24, 33-55.
35. LANGERAK, R. 1989. A testing theory for LOTOS using deadlock detection. In Proceedings of the 9th IFIP WG6.1 International Symposium on Protocol Specification, Testing, and Verification, (Enschede), E. Brinksma, G. Scollo, and C. A. Vissers, eds.
36. LLOYD, J. W. 1987. Foundations of Logic Programming, 2nd Ed. Springer-Verlag, New York.
37. MILNER, R. 1980. A calculus of communicating systems. Lecture Notes in Computer Science, vol. 92. Springer-Verlag, New York.
38. NICOLLIN, X., RICHIER, J.-L., SIFAKIS, J., AND VOIRON, J. 1990. ATP: An algebra for timed processes. In Proceedings of the IFIP TC2 Working Conference on Programming Concepts and Methods (Sea of Gallilea, Israel), M. Broy and C. B. Jones, eds. pp. 402-429.
39. PARK, D. M. R. 1981. Concurrency and automata on infinite sequences. In Proceedings of the 5th GI Conference, P. Deussen, ed. Lecture Notes in Computer Science, vol. 104. Springer-Verlag, New York, pp. 167-183.
40. PLOTKIN, G. D. 1981. A structural approach to operational semantics. Report DAIMI FN-19. Computer Science Department, Aarhus Univ.
41. PNUELI, A. 1985. Linear and branching structures in the semantics and logics of reactive systems. In Proceedings of the 12th ICALP (Nafplion). Lecture Notes in Computer Science, vol. 194. Springer-Verlag, New York, pp. 15-32.
42. PRZYMUSINSKI, T. C. 1987. On the declarative semantics of deductive databases and logic programs. In Proceedings of the Foundations of Deductive Databases and Logic Programming, Jack Minker, ed. Morgan-Kaufmann Publishers, Inc. (Los Altos, Calif.), pp. 193-219.
43. PRZYMUSINSKI, T. C. 1989. Every logic program has a natural stratification and an iterated least fixed point model. In Proceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (Philadelphia, Pa., Mar. 29-31). ACM, New York, pp. 11-21.
44. REITER, R. 1980. A logic for default reasoning. Artif. Int. 13, 81-132.
45. VAANDRAGER, F. W. 1989. Specificatie en verificatie van communicatieprotocollen met procesalgebra. Unpublished (in Dutch).
46. VAANDRAGER, F. W. 1990. Algebraic techniques for concurrency and their application. Ph.D. dissertation. Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands.
47. VERHOEF, C. 1994. A general conservative extension theorem in process algebra. In Proceedings of PRO-COMET '94. IFIP Transactions A-56. Elsevier, Amsterdam, The Netherlands.
48. VERHOEF, C. 1995. A congruence theorem for structured operational semantics with predicates and negative premises. Nord. J. Comput. 2, 2 274-302.