Deriving liveness goals from temporal logic specifications

Journal of Symbolic Computation

Volumn 22, Issue 5-6, 1996, Pages 521-553

  Caleiro, C ^a   Saake, G ^b   Sernadas, A ^a  

^a INSTITUTO SUPERIOR TÉCNICO   (Portugal)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030295472     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1996.0065     Document Type: Article

References (47)

1. Abadi, M., Manna, Z. (1989). Temporal logic programming. J. Symbolic Computation, 8, 277-295.
2. Adámek, J., Herrlich, H., Strecker, G. (1990), Abstract and concrete categories. John Wiley.
3. Barringer, H., Fisher, M., Gabbay, D., Gough, G., Owens, R. (1989). METATEM: a framework for programming in temporal logic. In: Proc. REX workshop on stepwise refinement of distributed systems: models, formalisms, correctness - LNCS 430. Springer-Verlag.
4. Barringer, H., Kuiper, R., Pnueli, A. (1984). Now you may compose temporal specifications. In: Proc. 16th ACM Symposium on Theory of Computing, pp. 51-63.
5. Bell, J., Machover, M. (1977). A Course in Mathematical Logic. North-Holland.
6. Ben-Ari, M., Pnueli, A., Manna, Z. (1983). The temporal logic of branching time. Acta Informatica, pp. 207-226.
7. Caleiro, C. (1994). Operational semantics of temporal object specifications. The INESC J. Junior Activities in Science and Technology, 1(1), pp. 7-35.
8. Caleiro, C. (1995). On the relationship between operational and denotational semantics of temporal logic specification of object behaviour. In: Wieringa, R., Feenstra, R. (eds), Information systems correctness and reusability. Selected papers from the IS-CORE Workshop, Amsterdam 94, pp. 69-83. World Scientific.
9. Chomicki, J. (1992). History-less checking of dynamic integrity constraints. In: Golshani, F. (ed.), Proc. 8th IEEE Conference on Data Engineering, pp. 557-564.
10. Clarke, E., Emerson, E. (1981). Design and synthesis of synchronization skeletons using branching time temporal logic. In: Proc. Workshop on Logics of Programs - LNCS 131, pp. 52-71.
11. Clarke, E., Grumberg, O., Kurshan, R. (1992). A synthesis of two approaches for verifying finite state concurrent systems. J. Logic and Computation, 2(5), pp. 605-618.
12. Emerson, E. (1990). Temporal and modal logic. In: Handbook of Theoretical Computer Science, pp. 996-1072.
13. Fiadeiro, J., Maibaum, T. (1992). Temporal theories as modularization units for concurrent systems specification. Formal Aspects of Computing, 4, 239-272.
14. Fisher, M., Barringer, H. (1991). Concurrent METATEM processes - a language for distributed AI. In: Proc. European Simulation Multiconference.
15. Fisher, M., Owens, R. (1992). From the past to the future: executing temporal logic programs. In: Proc. logic programming and automated reasoning - LNCS 624. Springer-Verlag.
16. Fisher, M., Owens, R. (1995). Executable modal and temporal logics - a survey. In: Executable modal and temporal logics - LNAI 897. Springer-Verlag.
17. Fisher, M., Wooldridge, M. (1987). Executable temporal logic for distributed AI. In: Twelfth International Conference on Distributed AI.
18. Francez, N. (1986). Fairness. Springer-Verlag.
19. Gabbay, D., Pnueli, A., Shelah, S., Stavi, J. (1980). On the temporal analysis of fairness. In: Proc. 7th ACM Symposium on Principles of Programming Languages.
20. Goldblatt, R. (1987). Logics of Time and Computation. CSLI.
21. Hart, S., Sharir, M. (1984). Probabilistic temporal logics for finite and bounded models. In: Proc. 16th ACM Symposium on Theory of Computing, pp. 1-13.
22. Hülsmann, K., Saake, G. (1991). Theoretical foundations of handling large substitution sets in temporal integrity monitoring. Acta Informatica, 28, 365-407.
23. Kung, C. (1984). Temporal framework for database specification and verification. In: Proc. 5th International Conference on Very Large Databases, pp. 91-99.
24. Lipeck, U. (1990). Transformation of dynamic integrity constraints into transaction specifications. Theoretical Computer Science, 76, 115-142.
25. Lipeck, U., Gertz, M., Saake, G. (1994). Transitional monitoring of dynamic integrity constraints. Data Engineering, 17(2), 38-42.
26. Lipeck, U., Saake, G. (1987). Monitoring dynamic integrity constraints based on temporal logic. Information Systems, 12, 255-269.
27. Manna, Z., Pnueli, A. (1987). Specification and verification of concurrent programs by ∀-automata. In: Temporal Logic in Specification - LNCS 398, pp. 124-164. Springer-Verlag.
28. Manna, Z., Pnueli, A. (1989). The anchored version of the temporal framework. In: de Bakker, J., de Roever, W.-P., Rozenberg, G. (eds), Linear time, branching time and partial order in logics and models for concurrency - LNCS 354, pp. 201-284. Springer-Verlag.
29. Manna, Z., Pnueli, A. (1991). Completing the temporal picture. Theoretical Computer Science, 83, 97-130.
30. Manna, Z., Pnueli, A. (1992). The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag.
31. Manna, Z., Pnueli, A. (1993). A temporal proof methodology for reactive systems. In: Program design calculi - NATO ASI Series, Series F: Computer and System Sciences. Springer-Verlag.
32. Manna, Z., Wolper, P. (1984). Synthesis of communicating processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems, 6(1), pp. 68-93.
33. Merz, S. (1992). Temporal logic as a programming language. Ph.D. thesis, Ludwig-Maximilians Universität, München, Germany.
34. Pnueli, A. (1977). The temporal logic of programs. In: Proc. 18th IEEE Symposium on Foundations of Computer Science, pp. 46-57.
35. Pnueli, A. (1983). On the extremely fair termination of probabilistic programs. In: Proc. 15th ACM Symposium on Theory of Computing, pp. 278-290.
36. Pnueli, A. (1992). System specification and refinement in temporal logic. In: Foundations of Software Technology and Theoretical Computer Science, LNCS 652, pp. 1-38. Springer-Verlag.
37. Pnueli, A., Rosner, R. (1988). On the synthesis of a reactive module. In: Proc. 16th ACM Symposium on Principles of Programming Languages, pp. 179-190.
38. Saake, G. (1991). Descriptive specification of database object behaviour. Data and Knowledge Engineering, 6(1), 47-73.
39. Schwiderski, S., Hartmann, T., Saake, G. (1994). Monitoring temporal preconditions in a behaviour oriented object model. Data and Knowledge Engineering, 14, 143-186.
40. Segala, R. (1995). A compositional trace-based semantics for probabilistic automata. In: Proceedings of CONCUR95 - LNCS 962, pp. 234-248. Springer-Verlag.
41. Sernadas, A. (1980). Temporal aspects of logical procedure definition. Information Systems, 5, 167-187.
42. Sernadas, A., Costa, J. F., Sernadas, C. (1994). An institution of object behaviour. In: Ehrig, H., Orejas, F. (eds), Recent trends in data type specification: 9th workshop on specification of abstract data types - Selected papers, pp. 337-350. Springer-Verlag.
43. Sernadas, A., Sernadas, C., Caleiro, C. (1996a). Denotational semantics of object specification. Tech. rep., IST, Lisbon, Portugal. Submitted for publication.
44. Sernadas, A., Sernadas, C., Costa, J.F. (1995). Object specification logic. J. Logic and Computation, 5(5), 603-630.
45. Sernadas, A., Sernadas, C., Ramos, J. (1996b). A temporal logic approach to object certification. J. Data and Knowledge Engineering. In print.
46. Thomas, W. (1990). Automata on infinite objects. In: Handbook of Theoretical Computer Science, pp. 133-191.
47. Wolper, P. (1987). On the relation of programs and computations to models of temporal logic. In: Banieqbal, B., Barringer, H., Pnueli, A. (eds), Temporal Logic in Specification - LNCS 398, pp. 75-123.