## Reasoning about Nondeterministic and Concurrent Actions: A Process Algebra Approach

### Cached

### Download Links

Citations: | 15 - 4 self |

### BibTeX

@MISC{Giacomo_reasoningabout,

author = {Giuseppe De Giacomo and Xiao Jun Chen},

title = {Reasoning about Nondeterministic and Concurrent Actions: A Process Algebra Approach},

year = {}

}

### Years of Citing Articles

### OpenURL

### Abstract

### Citations

3410 | A theory of communicating sequential processes
- BROOKES, HOARE, et al.
- 1984
(Show Context)
Citation Context ...he system, and a reasoning formalism, i.e. a suitable logic for specifying properties we wanttocheck. Notably, this setting is the one typically used in Process Algebras (e.g. CCS (Milner 1989), CSP (=-=Hoare 1985-=-), ACP (Bergstra & Klop 1984)) to model 1 concurrent and reactive systems. In Arti cial Intelligence, research onsearch-based plan-The state ( con guration) of the system is composed of a passive com... |

3217 |
Communication and Concurrency
- MILNER
- 1989
(Show Context)
Citation Context ...ble evolutions of the system, and a reasoning formalism, i.e. a suitable logic for specifying properties we wanttocheck. Notably, this setting is the one typically used in Process Algebras (e.g. CCS (=-=Milner 1989-=-), CSP (Hoare 1985), ACP (Bergstra & Klop 1984)) to model 1 concurrent and reactive systems. In Arti cial Intelligence, research onsearch-based plan-The state ( con guration) of the system is compose... |

1531 | Foundations of databases - Abiteboul, Hull, et al. - 1995 |

360 | Process algebra for synchronous communication - Bergstra, Klop - 1984 |

255 | Results on the propositional mu-calculus - Kozen - 1983 |

202 | The Concurrency Workbench: A semantics-based tool for the verification of finite-state systems - Cleaveland, Parrow, et al. - 1993 |

194 |
Modal and Temporal Logics
- Stirling
- 1992
(Show Context)
Citation Context ... these, we focus on one of the most powerful logic of programs, modal -calculus (Kozen 1983; Streett & Emerson 1989)), which includes logics like PDL, CTL and 3 CTL , and has been investigated (e.g. (=-=Stirling 1992-=-; Cleaveland 1990)) in the context of process algebra for expressing \temporal" properties of reactive and parallel processes. Speci cally, weintroduce an extension of standard modal -calculus, called... |

147 | The complexity of tree automata and logic of programs - Emerson, Jutla - 1988 |

146 | The concurrency workbench - CLEAVELAND, PARROW, et al. - 1989 |

126 |
Logics of programs
- Kozen, Tiuryn
- 1990
(Show Context)
Citation Context ... system; sinit isastate of T ;8isaformula expressing the property wewant to verify. We develop a suitable extension of modal -calculus (Kozen 1983), a powerful logic of programs which in3 cludes PDL (=-=Kozen & Tiuryn 1990-=-), CTL, CTL (Emerson 1990). We show that model checking in our logic can be linearly reduced to model checking in standard modal -calculus. We remark that, in the context of process algebra, for nite ... |

119 |
Complexity results for planning
- Bylander
- 1991
(Show Context)
Citation Context ...tis ed by the process. By means of our reduction, it is possible to use e ciently such existing implemented tools for reasoning about actions in our setting. ning, including much work on STRIP (e.g. (=-=Bylander 1991-=-)) can be considered at this level. In contrast, research on deductive planning is typically carried out at Level 3. Atomic and synchronized actions The evolution of the system from one con guration t... |

117 | Model checking vs. theorem proving: A manifesto
- Halpern, Vardi
- 1991
(Show Context)
Citation Context ...perty wewant to prove, e.g. the reachability of a state where a certain property (the goal) holds. In this paper, we adopt the viewpoint of Level 2. Following the model checking approach proposed in (=-=Halpern & Vardi 1991-=-), we use a description formalism to de ne the transition system representing the possible evolutions of the system, and a reasoning formalism, i.e. a suitable logic for specifying properties we wantt... |

107 | Proving properties of states in the situation calculus
- Reiter
- 1993
(Show Context)
Citation Context ...d too concrete to be realistic, both Level 2 and 3 have beenusedinmodeling dynamic systems. In particular, Level 3 is the one usually adopted by research on reasoning about actions (Rosenschein 1981; =-=Reiter 1993-=-; Lin & Shoham 1991; 1992; Lifschitz 1990; Lifshitz & Karta 1994). In this case, a certain logic (situation calculus, dynamic logic, etc.) is used both to represent and to reason about the dynamic sys... |

96 | Frames in the space of situations - Lifschitz - 1990 |

92 | sometimes" and "not never" revisited: on branching versus linear time temporal logic - Emerson, Halpern - 1983 |

91 | Tableau-based model checking in the propositional mu-calculus
- Cleaveland
- 1990
(Show Context)
Citation Context ...s on one of the most powerful logic of programs, modal -calculus (Kozen 1983; Streett & Emerson 1989)), which includes logics like PDL, CTL and 3 CTL , and has been investigated (e.g. (Stirling 1992; =-=Cleaveland 1990-=-)) in the context of process algebra for expressing \temporal" properties of reactive and parallel processes. Speci cally, weintroduce an extension of standard modal -calculus, called M ,whichis suita... |

91 | Extensional equivalences for transition systems - Nicola - 1987 |

84 | Boosting the correspondence between description logics and propositional dynamic logics - Giacomo, Lenzerini - 1994 |

73 | Representing concurrent actions in extended logic programming - Baral, Gelfond - 1993 |

62 | Reasoning about concurrent execution, prioritized interrupts, and exogenous actions in the situation calculus - Giacomo, Lesperance, et al. - 1997 |

62 |
Sometimes” and “Not Never” revisited: On branching time versus linear time
- Emerson, Halpern
- 1986
(Show Context)
Citation Context ...a certain property holds (i.e. where a certain \goal" is satis ed). Many temporal and modal logics have been proposed in the process algebra literature for verifying properties of concurrent systems (=-=Emerson & Halpern 1986-=-; Kozen 1983; Manna & Pnueli 1989). Among these, we focus on one of the most powerful logic of programs, modal -calculus (Kozen 1983; Streett & Emerson 1989)), which includes logics like PDL, CTL and ... |

58 | Concurrent actions in the situation calculus - Lin, Shoham - 1992 |

55 |
Provably correct theories of actions: preliminary report
- Lin, Shoham
- 1991
(Show Context)
Citation Context ...e to be realistic, both Level 2 and 3 have beenusedinmodeling dynamic systems. In particular, Level 3 is the one usually adopted by research on reasoning about actions (Rosenschein 1981; Reiter 1993; =-=Lin & Shoham 1991-=-; 1992; Lifschitz 1990; Lifshitz & Karta 1994). In this case, a certain logic (situation calculus, dynamic logic, etc.) is used both to represent and to reason about the dynamic systems. The typical r... |

54 | Concurrency and Communication in Transaction Logic
- Bonner, Kifer
(Show Context)
Citation Context ...f properties expressed in the global store. Research in Databases on query languages based on rst-order logic plus xpoints e.g. (Abiteboul, Hull, & Vianu 1995),and that on complex transactions e.g. (=-=Bonner & Kifer 1995-=-) are relevant. Finally, we believe that it is of great interest moving from Level 2 to Level 3 by mixing the process algebra approach presented here, with the usual logical approach. This would allow... |

50 | Theanchored version of the temporal framework
- Manna, Pnueli
- 1989
(Show Context)
Citation Context ... a certain \goal" is satis ed). Many temporal and modal logics have been proposed in the process algebra literature for verifying properties of concurrent systems (Emerson & Halpern 1986; Kozen 1983; =-=Manna & Pnueli 1989-=-). Among these, we focus on one of the most powerful logic of programs, modal -calculus (Kozen 1983; Streett & Emerson 1989)), which includes logics like PDL, CTL and 3 CTL , and has been investigated... |

39 | Automated temporal reasoning about reactive systems - Emerson - 1996 |

28 | Characteristic formulae for processes with divergence. Information and Computation 110:149–163 - Steffen, Ingólfsdóttir - 1994 |

28 |
On the Di erence between Updating a Knowledge Base and Revising It ). Dans
- Mendelzon
- 1991
(Show Context)
Citation Context ...ng domain constrains that must hold in each global store. Observe that the update we areinterested in applies to interpretations, and thus is much simpler than update of theories discussed, e.g., in (=-=Katsuno & Mendelzon 1991-=-). Another possible extension is to consider the global store as a set of multi-valued variables instead of boolean variables, or even as a rst order interpretation over some xed domain. Such extensio... |

27 | Process calculi, from theory to practice: Verification tools - Boudol, Roy, et al. - 1989 |

27 | Handbook of Theoretical Computer Science, volume B, chapter Temporal and modal logic - Emerson - 1990 |

23 | CTL* and ECTL* as Fragments of the Modal mu-Calculus - Dam - 1994 |

21 | Graphical versus logical specifications - Boudol, Larsen - 1992 |

21 | E cient model checking in fragments of the mu-calculus - Emerson, Lei - 1986 |

20 |
Results on the propositional mu-calculus., Theoretical Computer Science 27
- Kozen
- 1983
(Show Context)
Citation Context ...ition system representing the possible evolutions of our dynamic system; sinit isastate of T ;8isaformula expressing the property wewant to verify. We develop a suitable extension of modal -calculus (=-=Kozen 1983-=-), a powerful logic of programs which in3 cludes PDL (Kozen & Tiuryn 1990), CTL, CTL (Emerson 1990). We show that model checking in our logic can be linearly reduced to model checking in standard moda... |

18 | Representing concurrent actions and solving conflicts - Bornscheuer, Thielscher - 1996 |

14 |
Plan synthesis: a logical approach
- Rosenschein
- 1981
(Show Context)
Citation Context ...enerally considered too concrete to be realistic, both Level 2 and 3 have beenusedinmodeling dynamic systems. In particular, Level 3 is the one usually adopted by research on reasoning about actions (=-=Rosenschein 1981-=-; Reiter 1993; Lin & Shoham 1991; 1992; Lifschitz 1990; Lifshitz & Karta 1994). In this case, a certain logic (situation calculus, dynamic logic, etc.) is used both to represent and to reason about th... |

10 |
Process algebra for syn-chronous communication. Information and Computation
- Bergstra, Klop
- 1984
(Show Context)
Citation Context ...easoning formalism, i.e. a suitable logic for specifying properties we wanttocheck. Notably, this setting is the one typically used in Process Algebras (e.g. CCS (Milner 1989), CSP (Hoare 1985), ACP (=-=Bergstra & Klop 1984-=-)) to model 1 concurrent and reactive systems. In Arti cial Intelligence, research onsearch-based plan-The state ( con guration) of the system is composed of a passive component( global store) and an... |

2 |
Frames in the Space of Situations. Arti cial Intelligence
- Lifschitz
- 1990
(Show Context)
Citation Context ...evel 2 and 3 have beenusedinmodeling dynamic systems. In particular, Level 3 is the one usually adopted by research on reasoning about actions (Rosenschein 1981; Reiter 1993; Lin & Shoham 1991; 1992; =-=Lifschitz 1990-=-; Lifshitz & Karta 1994). In this case, a certain logic (situation calculus, dynamic logic, etc.) is used both to represent and to reason about the dynamic systems. The typical reasoning problem of in... |

1 | Execution monitoring og high-level robot programs - Giacomo, Reiter, et al. - 1998 |

1 | we believe that it is of great interest mov- ing from Level 2 to Level 3 by mixing the process al- gebra approach presented here, with the usual logical approach. This would allow us to introduce incomplete information in a better controlled way. For exam - Finally - 1992 |

1 | volume B - Emerson - 1990 |

1 | On the differ- ence between updating a knowledge base and revising it - Katsuno, Mendelzon - 1991 |

1 | Actions with in- direct effects (preliminary report - Lifshitz, Karta - 1994 |

1 | Provably correct the- ories of action (preliminary report - Lin, Shoham - 1991 |

1 |
Graphical versus logical speci cations. Theoretical Computer Science 106:3{20
- Boudol, Larsen
- 1992
(Show Context)
Citation Context ...n presented here, and agents whose behavior is only partially known (as happens typically for the environment) by logical axioms. To this end the research on \loose speci cation" in process algebras (=-=Boudol & Larsen 1992-=-), as well as research inknowledge representation on description logics that include assertions on \individuals" (which can be interpreted as a partial description of a transition system) (De Giacomo ... |

1 |
Handbook of Theoretical Computer Science,volume B. Elsevier Science Publishers B.V. chapter 16
- Emerson
- 1990
(Show Context)
Citation Context ...saformula expressing the property wewant to verify. We develop a suitable extension of modal -calculus (Kozen 1983), a powerful logic of programs which in3 cludes PDL (Kozen & Tiuryn 1990), CTL, CTL (=-=Emerson 1990-=-). We show that model checking in our logic can be linearly reduced to model checking in standard modal -calculus. We remark that, in the context of process algebra, for nite state processes (processe... |

1 |
Actions with indirect e ects (preliminary report
- Lifshitz, Karta
- 1994
(Show Context)
Citation Context ...e beenusedinmodeling dynamic systems. In particular, Level 3 is the one usually adopted by research on reasoning about actions (Rosenschein 1981; Reiter 1993; Lin & Shoham 1991; 1992; Lifschitz 1990; =-=Lifshitz & Karta 1994-=-). In this case, a certain logic (situation calculus, dynamic logic, etc.) is used both to represent and to reason about the dynamic systems. The typical reasoning problem of interest is logical impli... |

1 | Characteristic formulae for processes with divergence - en, B, et al. - 1994 |