Reasoning about nondeterministic and concurrent actions: A process algebra approach

Artificial Intelligence

Volumn 107, Issue 1, 1999, Pages 63-98

  Chen, Xiao Jun ^a   De Giacomo, Giuseppe ^b  

^a UNIVERSITY OF WINDSOR   (Canada)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Concurrency; Logical implication; Modal mu calculus; Model checking; Process algebra; Reasoning about actions

Indexed keywords

FORMAL LOGIC; MATHEMATICAL MODELS;

MODAL MU-CALCULUS; PROCESS ALGEBRA; REASONING ABOUT ACTIONS;

ARTIFICIAL INTELLIGENCE;

EID: 0032666305     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(98)00104-0     Document Type: Article

References (62)

1. S. Abiteboul, R. Hull, V. Vianu, Foundations of Databases, Addison Wesley, Reading, MA, 1995.
2. C. Baral, M. Gelfond, Representing concurrent actions in extended logic programming, in: Proc. 13th International Joint Conference on Artificial Intelligence (IJCAI-93), Chambéry, France, 1993, pp. 866-871.
3. J. Bergstra, J. Klop, Process algebra for synchronous communication, Inform, and Control 60 (1984) 109-137.
4. A.J. Bonner, M. Kifer, Concurrency and communication in transaction logic, in: Proc. 5th International Conference on Database Theory (ICDT-95), 1995.
5. S.-E. Bornscheuer, M. Thielscher, Representing concurrent actions and solving conflicts. Journal of the Interest Group in Pure and Applied Logics (IGPL) (Special issue of the ESPRIT project MEDLAR) 4 (3) (1996) 355-368.
6. G. Boudol, R. de Simone, V. Roy, D. Vergamini, Process calculi, from theory to practice: Verification tools, in: Proc. Workshop on Automatic Verification Methods for Finite State Systems, Lecture Notes in Computer Science, Vol. 407, Springer, Berlin, 1990.
7. G. Boudol, K. Larsen, Graphical versus logical specifications, Theoret. Comput. Sci. 106 (1992) 3-20.
8. T. Bylander, Complexity results for planning, in: Proc. 12th International Joint Conference on Artificial Intelligence (IJCAI-91), Sydney, Australia, 1991, pp. 274-279.
9. R. Cleaveland, Tableaux-based model checking in the propositional mu-calculus, Acta Informatica 27 (1990) 725-747.
10. R. Cleaveland, J. Parrow, B. Steffen, The concurrency workbench: A semantics-based tool for the verification of concurrent systems, ACM Trans. Programming Languages Syst. 15 (1993) 36-72.
11. R. Cleaveland, S. Sims. The NCSU concurrency workbench, in: Computer-Aided Verification (CAV-96), Lecture Notes in Computer Science, Vol. 1102, Springer, Berlin, 1996, pp. 394-397.
12. M. Dam, CTL* and ECTL* as fragments of the modal mu-calculus, in: Proc. Colloquium on Trees and Algebra in Programming, Lecture Notes in Computer Science, Vol. 581, Springer, Berlin, 1992, pp. 145-164.
13. G. De Giacomo, M. Lenzerini, Boosting the correspondence between description logics and propositional dynamic logics, in: Proc. 12th National Conference on Artificial Intelligence (AAAI-94), Seattle, WA, 1994, pp. 205-212.
14. G. De Giacomo, H.J. Levesque, Y. Lesperance, Reasoning about concurrent executions, prioritized interrupts, and exogenous action in the situation calculus, in: Proc. 15th International Joint Conference on Artificial Intelligence (IJCAI-97), Nagoya, Japan, 1997.
15. G. De Giacomo, R. Reiter, M. Soutchanski, Execution monitoring of high-level robot programs, in: Proc. 6th International Conference on Principles of Knowledge Representation and Reasoning (KR'98), 1998.
16. R. De Nicola, Extentional equivalences for transition system, Acta Informatica 24 (1987) 211-237.
17. E. Emerson, J. Halpern, "Sometimes" and "not never" revisited: On branching time versus linear time temporal logic, J. ACM 33 (1) (1986) 151-178.
18. E.A. Emerson, Handbook of Theoretical Computer Science, Vol. B, Elsevier, Amsterdam, 1990, Chapter 16.
19. E.A. Emerson, Automated temporal reasoning about reactive systems, in: Logics for Concurrency: Structure versus Automata, Lecture Notes in Computer Science, Vol. 1043, Springer, Berlin, 1996, pp. 41-101.
20. E.A. Emerson, C.S. Jutla, The complexity of tree automata and logics of programs, in: Proc. 20th Annual Symposium on the Foundations of Computer Science, 1988, pp. 328-337.
21. E.A. Emerson, C.S. Jutla, A.P. Sistla, On model checking for fragments of the mu-calculus, in: Proc. 5th International Conference of Computer-Aided Verification, Lecture Notes in Computer Science, Vol. 697, Springer, Berlin, 1993, pp. 385-396.
22. E.A. Emerson, C.-L. Lei, Efficient model checking in fragments of the mu-calculus. in: Proc. 1st IEEE Symposium on Logics in Computer Science (LICS'86), 1986, pp. 267-278.
23. M. Gelfond, V. Lifschitz, Representing action and change by logic programs, J. Logic Programming 17 (1993) 301-322.
24. M. Gelfond, V. Lifschitz, A. Rabinov, What are the limitations of the situation calculus? in: R. Boyer (Ed.), Automated Reasoning: Essays in Honor of Woody Bledsoe, Kluwer, Dordrecht, 1991, pp. 167-179.
25. S. Graf, J. Sifakis, A model characterization of observational congruence on finite terms of CCS, Inform. and Control 68 (1986) 125-145.
26. F.N.H.R. Nielson, Semantics with Applications, Wiley, New York, 1992.
27. J.Y. Halpern, M.Y. Vardi, Model checking vs. theorem proving: A manifesto, in: V. Lifschitz (Ed.), Artificial Intelligence and Mathematical Theory of Computation - Papers in Honor of John McCarthy, Academic Press, New York, 1991, pp. 151-176.
28. M. Hennessy, R. Milner, Algebraic laws for nondeterminism and concurrency, J. ACM 32 (1) (1985) 137-161.
29. Y. Hirishfeld, F. Moller, Decidability results in automata and process theory, in: Logics for Concurrency: Structure versus Automata, Lecture Notes in Computer Science, Vol. 1043, Springer, Berlin, 1996, pp. 102-148.
30. C. Hoare, Communicating Sequential Processes, Prentice Hall, London, 1985.
31. H. Katsuno, A. Mendelzon, On the difference between updating a knowledge base and revising it, in: Proc. 2nd International Conference on the Principles of Knowledge Representation and Reasoning (KR-91), Cambridge, MA, 1991, pp. 387-394.
32. D. Kozen, Results on the prepositional mu-calculus, Theoret. Comput. Sci. 27 (1983) 333-355.
33. D. Kozen, R. Parikh, A decision procedure for the prepositional mu-calculus, in: Proc. 2nd Workshop on Logic of Programs, Lecture Notes in Computer Science, Vol. 164, Springer, Berlin, 1983, pp. 313-325.
34. D. Kozen, J. Tiuryn, Logics of programs, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Elsevier, Amsterdam, 1990, pp. 790-840.
35. K.G. Larsen, L. XinXin, Compositionality through an operational semantics of contexts, J. Logic Comput. 1 (6) (1991) 761-795.
36. K.J. Larsen, Proof systems for satisfiability in Hennessy-Milner logic with recursion. Theoret. Comput. Sci. 72 (1990) 265-288.
37. H. Levesque, R. Reiter, Y. Lesperance, F. Lin, R. Scherl, GOLOG: A logic programming language for dynamic domains, J. Logic Programming 31 (1997) 59-84.
38. V. Lifschitz, Frames in the space of situations, Artificial Intelligence 46 (1990) 365-376.
39. V. Lifshitz, G. Karta, Actions with indirect effects (preliminary report), in: Proc. 4th International Conference on the Principles of Knowledge Representation and Reasoning (KR-94), Bonn, Germany, 1994, pp. 341-350.
40. F. Lin, R. Reiter, State constraints revisited, J. Logic Comput. (Special Issue on Action and Processes) 4 (5) (1994) 655-678.
41. F. Lin, Y. Shoham, Provably correct theories of action (preliminary report), in: Proc. 9th National Conference on Artificial Intelligence (AAAI-91), Anaheim, CA, 1991, pp. 349-354.
42. F. Lin, Y. Shoham, Concurrent actions in the situation calculus, in: Proc. 10th National Conference on Artificial Intelligence (AAAI-92), San Jose, CA, 1992, pp. 590-595.
43. Z. Manna, A. Pnueli. The anchored version of the temporal framework, in: J. de Bakker, P. de Roever, G. Rozenberg (Eds.), Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Lecture Notes in Computer Science, Vol. 354, Springer, Berlin, 1989, pp. 201-284.
44. K.L. McMillan, Symbolic Model Checking, Kluwer, Dordrecht, 1993.
45. R. Milner, Communication and Concurrency, Prentice Hall, London, 1989.
46. Y.N. Moschovakis, Elementary Induction on Abstract Structures, North-Holland, Amsterdam, 1974.
47. D. Park, Fixpoint induction and proofs of program properties, in: B. Meltzer and D. Michie (Eds.), Machine Intelligence, Vol. 5, Edinburgh University Press, 1970, pp. 59-78.
48. J.A. Pinto, Temporal reasoning in situation calculus, Ph.D. Thesis, Department of Computer Science, University of Toronto, 1994.
49. R. Reiter, The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression, in: V. Lifschitz (Ed.), Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, Academic Press, New York, 1991, pp. 359-380.
50. R. Reiter, Natural actions, concurrency and continuous time in the situation calculus, in: Proc. 5th International Conference on Principles of Knowledge Representation and Reasoning (KR'96), 1996, pp. 2-13.
51. S. Rosenschein, Plan synthesis: A logical approach, in: Proc. 8th International Joint Conference on Artificial Intelligence (IJCAI-81), Vancouver, BC, 1981.
52. B. Steffen, Characteristic formulae, Proc. ICALP, Lecture Notes in Computer Science, Vol. 372, Springer, Berlin, 1989, pp. 723-732.
53. B. Steffen, A. Ingolfsdottir, Characteristic formulae for processes with divergence, Inform, and Comput. 110 (1) (1994) 149-163.
54. C. Stirling, Modal and temporal logic, in: S. Abramsky, D.M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, Clarendon Press, Oxford, 1992, pp. 477-563.
55. C. Stirling, Modal and temporal logics for processes, in: Logics for Concurrency: Structure versus Automata, Lecture Notes in Computer Science, Vol. 1043, Springer, Berlin, 1996, pp. 149-237.
56. R.S. Streett, E.A. Emerson, The propositional mu-calculus is elementary, in: Proc. 6th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 172, Springer, Berlin, 1984, pp. 465-472.
57. R.S. Streett, E.A. Emerson, An automata theoretic decision procedure for the propositional mu-calculus, Inform, and Control 81 (1989) 249-264.
58. A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific J. Math. 5 (1955) 285-309.
59. E. Ternovskaia, Interval situation calculus, in: Proc. ECAI'94 Workshop on Logic and Change, 1994, pp. 153-164.
60. J. van Benthem, J. van Eijck, V. Stebletsova, Modal logic, transition systems and processes, J. Logic Comput. 4 (5) (1994) 811-855.
61. R. van Glabbeek, The linear time-branching time spectrum, CONCUR'90, Lecture Notes in Computer Science, Vol. 458, Springer, Berlin, 1990, pp. 278-297.
62. G. Winskel, A note on model checking the modal v-calculus, in: Proc. 11th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 372, Springer, Berlin, 1989, pp. 761-772.