Results 1  10
of
41
Modeling Rational Agents within a BDIArchitecture
, 1991
"... Intentions, an integral part of the mental state of an agent, play an important role in ..."
Abstract

Cited by 801 (21 self)
 Add to MetaCart
Intentions, an integral part of the mental state of an agent, play an important role in
Model Checking of Safety Properties
, 1999
"... Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region. Proof rules for the verification of safety properties have been developed in the proofbased approach to verification, making verification of safety properties simp ..."
Abstract

Cited by 101 (16 self)
 Add to MetaCart
Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region. Proof rules for the verification of safety properties have been developed in the proofbased approach to verification, making verification of safety properties simpler than verification of general properties. In this paper we consider model checking of safety properties. A computation that violates a general linear property reaches a bad cycle, which witnesses the violation of the property. Accordingly, current methods and tools for model checking of linear properties are based on a search for bad cycles. A symbolic implementation of such a search involves the calculation of a nested fixedpoint expression over the system's state space, and is often impossible. Every computation that violates a safety property has a finite prefix along which the property is violated. We use this fact in order to base model checking of safety properties on a search for ...
Strategies for Temporal Resolution
, 1995
"... Verifying that a temporal logic specification satisfies a temporal property requires some form of theorem proving. However, although proof procedures exist for such logics, many are either unsuitable for automatic implementation or only deal with small fragments of the logic. In this thesis the algo ..."
Abstract

Cited by 93 (42 self)
 Add to MetaCart
Verifying that a temporal logic specification satisfies a temporal property requires some form of theorem proving. However, although proof procedures exist for such logics, many are either unsuitable for automatic implementation or only deal with small fragments of the logic. In this thesis the algorithms for, and strategies to guide, a fully automated temporal resolution theorem prover are given, proved correct and evaluated. An approach to applying resolution, a proof method for classical logics suited to mechanisation, to temporal logics has been developed by Fisher. The method involves translation to a normal form, classical style resolution within states and temporal resolution over states. It has only one temporal resolution rule and is therefore particularly suitable as the basis of an automated temporal resolution theorem prover. As the application of the temporal resolution rule is the most costly part of the method, involving search amongst graphs, different algorithms on w...
Verification on Infinite Structures
, 2000
"... In this chapter, we present a hierarchy of infinitestate systems based on the primitive operations of sequential and parallel composition; the hierarchy includes a variety of commonlystudied classes of systems such as contextfree and pushdown automata, and Petri net processes. We then examine the ..."
Abstract

Cited by 69 (2 self)
 Add to MetaCart
In this chapter, we present a hierarchy of infinitestate systems based on the primitive operations of sequential and parallel composition; the hierarchy includes a variety of commonlystudied classes of systems such as contextfree and pushdown automata, and Petri net processes. We then examine the equivalence and regularity checking problems for these classes, with special emphasis on bisimulation equivalence, stressing the structural techniques which have been devised for solving these problems. Finally, we explore the model checking problem over these classes with respect to various linear and branchingtime temporal logics.
Social Plans: A Preliminary Report
, 1992
"... The formalization of multiagent autonomous systems requires a rich ontology for capturing a variety of collective behaviours and a powerful semantics for distinguishing between collective agents having, executing, and jointly intending a plan. In this paper, we introduce the notion of social agents ..."
Abstract

Cited by 69 (6 self)
 Add to MetaCart
The formalization of multiagent autonomous systems requires a rich ontology for capturing a variety of collective behaviours and a powerful semantics for distinguishing between collective agents having, executing, and jointly intending a plan. In this paper, we introduce the notion of social agents and social plans. A definition of joint intentions is provided that avoids some of the problems encountered by previous formalizations. In particular, it models cooperation by requiring that agents adopt a joint goal and a joint plan of action before forming a joint intention. The paper also stresses the planning capability of agents and outlines a process for meansend reasoning by multiple agents. 1 Introduction Situated agents are systems embedded in dynamic environments; they continuously sense their environment and effect changes to it by performing actions. These agents have to balance the time they devote to thinking against the time they take acting. Also they need to balance the...
Asymmetry Thesis and SideEffect Problems in LinearTime and BranchingTime Intention Logics
, 1991
"... In this paper, we examine the relationships between beliefs, goals, and intentions. In particular, we consider the formalization of the Asymmetry Thesis as proposed by Bratman [ 1987 ] . We argue that the semantic characterization of this principle determines if the resulting logic is capable of han ..."
Abstract

Cited by 61 (13 self)
 Add to MetaCart
In this paper, we examine the relationships between beliefs, goals, and intentions. In particular, we consider the formalization of the Asymmetry Thesis as proposed by Bratman [ 1987 ] . We argue that the semantic characterization of this principle determines if the resulting logic is capable of handling other important problems, such as the sideeffect problem of beliefgoalintention interaction. While Cohen and Levesque's [ 1990 ] formalization faithfully models some aspects of the asymmetry thesis, it does not solve all the sideeffect problems; on the other hand the formalization provided by Rao and Georgeff [ 1991 ] solves all the sideeffect problems, but only models a weak form of the asymmetry thesis. In this paper, we combine the intuition behind both these approaches and provide a semantic account of the asymmetry thesis, in both lineartime and branchingtime logics, for solving many of these problems. 1 Introduction Formalizations of intentions and their relationships w...
Decidability of Model Checking for InfiniteState Concurrent Systems
 Acta Informatica
"... We study the decidability of the model checking problem for linear and branching time logics, and two models of concurrent computation, namely Petri nets and Basic Parallel Processes. 1 Introduction Most techniques for the verification of concurrent systems proceed by an exhaustive traversal of the ..."
Abstract

Cited by 59 (1 self)
 Add to MetaCart
We study the decidability of the model checking problem for linear and branching time logics, and two models of concurrent computation, namely Petri nets and Basic Parallel Processes. 1 Introduction Most techniques for the verification of concurrent systems proceed by an exhaustive traversal of the state space. Therefore, they are inherently incapable of considering systems with infinitely many states. Recently, some new methods have been developed in order to at least palliate this problem. Using them, several verification problems for some restricted infinitestate models have been shown to be decidable. These results can be classified into those showing the decidability of equivalence relations [8, 9, 24, 26], and those showing the decidability of model checking for different modal and temporal logics. In this paper, we contribute to this second group. The model checking problem has been studied so far for three infinitestate models: contextfree processes, pushdown processes, and...
Formal Models and Decision Procedures for MultiAgent Systems
, 1995
"... The study of computational agents capable of rational behaviour has received a great deal of attention in recent years. A number of theoretical formalizations for such multiagent systems have been proposed. However, most of these formalizations do not have a strong semantic basis nor a sound and com ..."
Abstract

Cited by 51 (0 self)
 Add to MetaCart
The study of computational agents capable of rational behaviour has received a great deal of attention in recent years. A number of theoretical formalizations for such multiagent systems have been proposed. However, most of these formalizations do not have a strong semantic basis nor a sound and complete axiomatization. Hence, it has not been clear as to how these formalizations could be used in building agents in practice. This paper explores a particular type of multiagent system, in which each agent is viewed as having the three mental attitudes of belief (B), desire (D), and intention (I). It provides a family of multimodal branchingtime BDI logics with a semantics that is grounded in traditional decision theory and a possibleworlds framework, categorizes them, provides sound and complete axiomatizations, and gives constructive tableaubased decision procedures for testing the satisfiability and validity of formulas. The computational complexity of these decision procedures is n...
Automated Temporal Reasoning about Reactive Systems
, 1996
"... . There is a growing need for reliable methods of designing correct reactive systems such as computer operating systems and air traffic control systems. It is widely agreed that certain formalisms such as temporal logic, when coupled with automated reasoning support, provide the most effective a ..."
Abstract

Cited by 38 (2 self)
 Add to MetaCart
. There is a growing need for reliable methods of designing correct reactive systems such as computer operating systems and air traffic control systems. It is widely agreed that certain formalisms such as temporal logic, when coupled with automated reasoning support, provide the most effective and reliable means of specifying and ensuring correct behavior of such systems. This paper discusses known complexity and expressiveness results for a number of such logics in common use and describes key technical tools for obtaining essentially optimal mechanical reasoning algorithms. However, the emphasis is on underlying intuitions and broad themes rather than technical intricacies. 1 Introduction There is a growing need for reliable methods of designing correct reactive systems. These systems are characterized by ongoing, typically nonterminating and highly nondeterministic behavior. Examples include operating systems, network protocols, and air traffic control systems. There is w...
Model checking and the Mucalculus
 DIMACS Series in Discrete Mathematics
, 1997
"... There is a growing recognition of the need to apply formal mathematical methods in the design of "high confidence" computing systems. Such systems operate in safety critical contexts (e.g., air traffic control systems) or where errors could have major adverse economic consequences (e.g., banking n ..."
Abstract

Cited by 36 (0 self)
 Add to MetaCart
There is a growing recognition of the need to apply formal mathematical methods in the design of "high confidence" computing systems. Such systems operate in safety critical contexts (e.g., air traffic control systems) or where errors could have major adverse economic consequences (e.g., banking networks). The problem is especially acute in the design of many reactive systems which must exhibit correct ongoing behavior, yet are not amenable to thorough testing due to their inherently nondeterministic nature. One useful approach for specifying and reasoning about correctness of such systems is temporal logic model checking, which can provide an efficient and expressive tool for automatic verification that a finite state system meets a correctness specification formulated in temporal logic. We describe model checking algorithms and discuss their application. To do this, we focus attention on a particularly important type of temporal logic known as the Mucalculus.