Michael Fisher. A Model Checker for Linear Time Temporal Logic. Formal Aspects of Computing, 4(3):299--319, June 1992. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Aplicación de la Lógica Temporal Proposicional.. - Kemme, al. (1994) (Correct)
....los nodos especiales del camino desde la ra iz hasta la hoja y la hoja a estados. Podemos considerar un grafo finito de transiciones G, cuyos estados est an etiqueteados con conjuntos de proposiciones, como un conjunto de estructuras lineales finitas. El algoritmo de model checking descrito en [8] comprueba si hay en G una sucesi on que es modelo de una f ormula dada.Otros algoritmos de este tipo se pueden encontrar en [3, 4, 6, 7, 10, 12] 3 La L ogica de Intervalos La forma m as habitual de representar conocimientos temporales dentro de la inteligencia artificial es la l ogica temporal ....
Michael Fisher. A model checker for linear time temporal logic. Formal Aspects of Computing, 4:299--319, 1992.
Algoritmos de Satisfactibildad y Model-Checking para la.. - Kemme (Correct)
.... satisface la f ormula (CTL) o si todos los caminos que empiezan con este estado son modelos de la f ormula (LTL) Partiendo de los primeros algoritmos para la l ogica lineal ( LP94] y la CTL ( CES83] se han propuesto varios algoritmos por un lado m as eficientes, y por otro mas poderosos ([AH93, Alu91, BES93, BCDM86, Bro86, Fis92, DKJ88, Lew90, y otros]) Explicaremos los m etodos principales de chequear modelos. Despu es presentaremos los algoritmos de [Fis92] y [CES83] como ejemplos para la LTL y la CTL. Al final indicaremos que mejoras y ampliaciones de los algoritmos son posibles. Principalmente podemos distinguir dos conceptos. En uno ....
....lineal ( LP94] y la CTL ( CES83] se han propuesto varios algoritmos por un lado m as eficientes, y por otro mas poderosos ( AH93, Alu91, BES93, BCDM86, Bro86, Fis92, DKJ88, Lew90, y otros] Explicaremos los m etodos principales de chequear modelos. Despu es presentaremos los algoritmos de [Fis92] y [CES83] como ejemplos para la LTL y la CTL. Al final indicaremos que mejoras y ampliaciones de los algoritmos son posibles. Principalmente podemos distinguir dos conceptos. En uno empujamos la f ormula sobre el grafo y chequeamos cuales subf ormulas son v alidas en cuales estados o caminos ....
[Article contains additional citation context not shown here]
Michael Fisher. A model checker for linear time temporal logic. Formal Aspects of Computing, 4: 299--319, 1992.
Strategies for Temporal Resolution - Dixon (1995) (2 citations) (Correct)
....for specification. Verifying that such properties hold for a program specified in temporal logic involves proofs within the logic itself. There is an extensive body of work on automated verification mostly in the area of model checking style systems, see for example [CE81, CES86, GB88, BFG89b, Fis92a] particularly based on tableau [Gou84, Wol85] or automata [WVS83, VW86, Var87] Model checking involves the generation of a structure that captures all possible behaviours of a system followed by a phase to check that these behaviours match the desired behaviour. However, standard model checking ....
M. Fisher. A Model Checker for Linear Time Temporal Logic. Formal Aspects of Computing, 4(3):299--319, June 1992.
An LTL Verification System Based on Automata Theory - van Wyk (1999) (Correct)
....checker described in this thesis is based on automata theory. LTL is used to describe correctness claims and an on the fly model checking algorithm is used. An onthe fly model checker computes the reachable states as needed and therefore only a part of the state graph has to be stored in memory [3, 12, 13, 32]. A given LTL formula specifies a desirable property that all computations of a system should have. A computation can be seen as an infinite sequence of states. In the state graph of a system, every state is described by a finite set of atomic propositions, so a computation can be viewed as an ....
M. Fisher. A model checker for linear time temporal logic. Formal Aspects of Computing, 4(3):299--319, 1992.
Fair SMG and Linear Time Model Checking - Barringer, Fisher, Gough (1989) (3 citations) Self-citation (Fisher) (Correct)
.... linear time temporal formulae [Gou84] and the satisfiability algorithms presented in [LP85] In the full paper we will present results comparing the implementation of the model checker described here with that of our original implementation handling fairness constraints within the temporal logic [Fis92] and with our linear temporal logic decision procedures [GB89] 2 Extending SMG for Fair Constructs 2.1 SMG Structure Figure 1 outlines the basic structure of the state machine generator (compiler) Program Parser J J J J Semantics Omega Omega Omega Omega Omega Omega State ....
....by the transition, em the environment modification and R, R 1 . R n are transition rules. The output format of the state transition graph can be chosen as appropriate for the model checker to be used, in particular for mcb [Bro86] or a linear time temporal logic model checker such as MDF [Fis92]. 2.2 A shared variables language A simple shared variables language has been chosen to illustrate our approach to handling fair constructs in SMG (other languages will be considered in the full paper) It consists of Boolean variables and expressions, assignment, sequential composition, guarded ....
[Article contains additional citation context not shown here]
Michael Fisher. A Model Checker for Linear Time Temporal Logic. Formal Aspects of Computing, 4(3):299--319, June 1992.
Fair SMG and Linear Time Model Checking - Barringer, Fisher, Gough (1989) (3 citations) Self-citation (Fisher) (Correct)
.... linear time temporal formulae [Gou84] and the satisfiability algorithms presented in [LP85] In the full paper we will present results comparing the implementation of the model checker described here with that of our original implementation handling fairness constraints within the temporal logic [Fis92] and with our linear temporal logic decision procedures [GB89] 2 Extending SMG for Fair Constructs 2.1 SMG Structure Figure 1 outlines the basic structure of the state machine generator (compiler) Program Parser J J J J J J Semantics Omega Omega Omega Omega Omega Omega AE State ....
....by the transition, em the environment modification and R, R 1 . R n are transition rules. The output format of the state transition graph can be chosen as appropriate for the model checker to be used, in particular for mcb [Bro86] or a linear time temporal logic model checker such as MDF [Fis92]. 2.2 A shared variables language A simple shared variables language has been chosen to illustrate our approach to handling fair constructs in SMG (other languages will be considered in the full paper) It consists of Boolean variables and expressions, assignment, sequential composition, guarded ....
[Article contains additional citation context not shown here]
Michael Fisher. A Model Checker for Linear Time Temporal Logic. Formal Aspects of Computing, 4(3):299--319, June 1992.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC