Results 1 - 10 of 2,573

Model Checking AgentSpeak

by Rafael Bordini , Michael Fisher, Carmen Pardavila, Michael Wooldridge - AAMAS'03 , 2003
"... This paper introduces AgentSpeak(F), a variation of the BDI logic programming language AgentSpeak(L) intended to permit the model-theoretic verification of multi-agent systems. After briefly introducing AgentSpeak(F) and discussing its relationship to AgentSpeak(L), we show how AgentSpeak(F) program ..."
Abstract - Cited by 111 (18 self) - Add to MetaCart
Speak(F) programs can be transformed into Promela, the model specification language for the Spin model-checking system. We also describe how specifications written in a simplified form of BDI logic can be transformed into Spin-format linear temporal logic formul. With our approach, it is thus possible

Alternating-time Temporal Logic

by Rajeev Alur, Thomas Henzinger, Orna Kupferman - Journal of the ACM , 1997
"... Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branching-time temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general var ..."
Abstract - Cited by 620 (53 self) - Add to MetaCart
Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branching-time temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general

Automatic verification of finite-state concurrent systems using temporal logic specifications

by E. M. Clarke, E. A. Emerson, A. P. Sistla - ACM Transactions on Programming Languages and Systems , 1986
"... We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a (propositional, branching-time) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract - Cited by 1388 (62 self) - Add to MetaCart
We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a (propositional, branching-time) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent

Symbolic Model Checking: 10^20 States and Beyond

by J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, L. J. Hwang , 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining state-graph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract - Cited by 758 (41 self) - Add to MetaCart
Binary Decision Diagrams (Bryant, R. E., 1986, IEEE Trans. Comput. C-35) to represent relations and formulas. We then show how our new Mu-Calculus model checking algorithm can be used to derive efficient decision procedures for CTL model checking, satistiability of linear-time temporal logic formulas

HyTech: A Model Checker for Hybrid Systems

by Thomas A. Henzinger, Pei-Hsin Ho, Howard Wong-toi - Software Tools for Technology Transfer , 1997
"... A hybrid system is a dynamical system whose behavior exhibits both discrete and continuous change. A hybrid automaton is a mathematical model for hybrid systems, which combines, in a single formalism, automaton transitions for capturing discrete change with differential equations for capturing conti ..."
Abstract - Cited by 473 (6 self) - Add to MetaCart
for which a linear hybrid automaton satisfies a temporal-logic requirement. 1 Introduction A hybrid system typically consists of a collection of digital programs that interact with each other and with an analog environment. Examples of hybrid systems include manufacturing controllers, automotive and flight

Logic Programming in a Fragment of Intuitionistic Linear Logic

by Joshua S. Hodas, Dale Miller , 1994
"... When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal of the form D ⊃ G from the context (set of formulas) Γ leads to an attempt to prove the goal G in the extended context Γ ..."
Abstract - Cited by 340 (44 self) - Add to MetaCart
if they are based on linear logic. After presenting two equivalent formulations of a fragment of linear logic, we show that the fragment has a goal-directed interpretation, thereby partially justifying calling it a logic programming language. Logic programs based on the intuitionistic theory of hereditary Harrop

Simple On-the-fly Automatic Verification of Linear Temporal Logic

by R. Gerth , D. Peled, M. Y. Vardi, P. Wolper , 1995
"... We present a tableau-based algorithm for obtaining an automaton from a temporal logic formula. The algorithm is geared towards being used in model checking in an "on-the-fly" fashion, that is the automaton can be constructed simultaneously with, and guided by, the generation of the model. ..."
Abstract - Cited by 327 (29 self) - Add to MetaCart
well on the temporal formulas typically encountered in verification. While basing linear-time temporal logic model-checking upon a transformation to automata is not new, the details of how to do this efficiently, and in "on-the-fly" fashion havenever been given.

An automata-theoretic approach to linear temporal logic

by Moshe Y. Vardi - Logics for Concurrency: Structure versus Automata, volume 1043 of Lecture Notes in Computer Science , 1996
"... Abstract. The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis. Both programs and specifications are in essence descriptions of computations. These computations can be viewed as words over s ..."
Abstract - Cited by 295 (26 self) - Add to MetaCart
Abstract. The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis. Both programs and specifications are in essence descriptions of computations. These computations can be viewed as words over

An Automata-Theoretic Approach to Branching-Time Model Checking

by Orna Kupferman, Moshe Y. Vardi, Pierre Wolper - JOURNAL OF THE ACM , 1998
"... Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing linear-time model-checking, and for obtaining many extensions and improvements to this verification method. On the other hand, for branching temporal logic, automata-theoretic techniques ..."
Abstract - Cited by 354 (66 self) - Add to MetaCart
Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing linear-time model-checking, and for obtaining many extensions and improvements to this verification method. On the other hand, for branching temporal logic, automata

Automatic Symbolic Verification of Embedded Systems

by Rajeev Alur , Thomas A. Henzinger , Pei-hsin Ho , 1996
"... We present a model-checking procedure and its implementation for the automatic verification of embedded systems. The system components are described as Hybrid Automata -- communicating machines with finite control and real-valued variables that represent continuous environment parameters such as tim ..."
Abstract - Cited by 330 (24 self) - Add to MetaCart
such as time, pressure, and temperature. The system requirements are specified in a temporal logic with stop watches, and verified by symbolic fixpoint computation. The verification procedure -- implemented in the Cornell Hybrid Technology Tool, HyTech -- applies to hybrid automata whose continuous dynamics
Results 1 - 10 of 2,573