Results 1  10
of
1,770,523
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) 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 1384 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) 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
Robustness of temporal logic specifications
 IN: PROCEEDINGS OF FATES/RV. VOLUME 4262 OF LNCS
, 2006
"... In this paper, we consider the robust interpretation of metric temporal logic (MTL) formulas over timed sequences of states. For systems whose states are equipped with nontrivial metrics, such as continuous, hybrid, or general metric transition systems, robustness is not only natural, but also a cr ..."
Abstract

Cited by 11 (6 self)
 Add to MetaCart
In this paper, we consider the robust interpretation of metric temporal logic (MTL) formulas over timed sequences of states. For systems whose states are equipped with nontrivial metrics, such as continuous, hybrid, or general metric transition systems, robustness is not only natural, but also a
Linear Temporal Logic Specifications
, 2001
"... presents an approach to checking a running program against its Linear Temporal Logic (LTL) specifications. LTL is a widely used logic for expressing properties of programs viewed as sets of executions. Our approach consists of translating LTL formulae to finitestate automata, which are used as obse ..."
Abstract
 Add to MetaCart
presents an approach to checking a running program against its Linear Temporal Logic (LTL) specifications. LTL is a widely used logic for expressing properties of programs viewed as sets of executions. Our approach consists of translating LTL formulae to finitestate automata, which are used
Process Semantics of Temporal Logic Specification
, 1991
"... . A process semantics for temporal logic specification is provided by relating a category of temporal theories and interpretations between theories where specification configuration and interconnection is achieved via colimits of diagrams, and a category of algebraic models of processes where par ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
. A process semantics for temporal logic specification is provided by relating a category of temporal theories and interpretations between theories where specification configuration and interconnection is achieved via colimits of diagrams, and a category of algebraic models of processes where
Refining Interval Temporal Logic Specifications
 TransformationBased Reactive Systems Development, number 1231 in LNCS
, 1997
"... Interval Temporal Logic (ITL) was designed as a tool for the specification and verification of systems. The development of an executable subset of ITL, namely Tempura, was an important step in the use of temporal logic as it enables the developer to check, debug and simulate the design. However, a d ..."
Abstract

Cited by 18 (10 self)
 Add to MetaCart
Interval Temporal Logic (ITL) was designed as a tool for the specification and verification of systems. The development of an executable subset of ITL, namely Tempura, was an important step in the use of temporal logic as it enables the developer to check, debug and simulate the design. However, a
Robustness of Temporal Logic Specifications for ContinuousTime Signals
, 2009
"... In this paper, we consider the robust interpretation of Metric Temporal Logic (MTL) formulas over signals that take values in metric spaces. For such signals, which are generated by systems whose states are equipped with nontrivial metrics, for example continuous or hybrid, robustness is not only na ..."
Abstract

Cited by 43 (18 self)
 Add to MetaCart
that remains εclose to the initial one also satisfies the same MTL specification under the usual Boolean semantics. Finally, our framework is applied to the problem of testing formulas of two fragments of MTL, namely Metric Interval Temporal Logic (MITL) and closed Metric Temporal Logic (clMTL), over
A FiniteDomain Semantics for Testing Temporal Logic Specifications
"... A method to achieve executability of temporal logic specifications is restricting the interpretation of formulas over finite domains. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
A method to achieve executability of temporal logic specifications is restricting the interpretation of formulas over finite domains.
Deriving Liveness Goals from Temporal Logic Specifications
 Journal of Symbolic Computation
, 1996
"... Introduction The use of temporal logic has been widely explored both on the fields of specification and certification of properties of reactive systems (Pnueli, 1977), (Sernadas, 1980), (Fiadeiro and Maibaum, 1992), (Clarke, Grumberg and Kurshan, 1992), (Manna and Pnueli, 1992), (Manna and Pnueli, ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Introduction The use of temporal logic has been widely explored both on the fields of specification and certification of properties of reactive systems (Pnueli, 1977), (Sernadas, 1980), (Fiadeiro and Maibaum, 1992), (Clarke, Grumberg and Kurshan, 1992), (Manna and Pnueli, 1992), (Manna and Pnueli
Synchronizing Multiagent Plans using Temporal Logic Specifications
 in Proceedings of the First International Conference on MultiAgent Systems (ICMAS95
, 1995
"... Plan synchronization is a method of analyzing multiagent plans to introduce ordering constraints between them so that their concurrent execution achieves a desired goal. We describe a plan synchronization method for goals expressed using temporal logic specifications. Our goals can involve both qual ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
Plan synchronization is a method of analyzing multiagent plans to introduce ordering constraints between them so that their concurrent execution achieves a desired goal. We describe a plan synchronization method for goals expressed using temporal logic specifications. Our goals can involve both
Results 1  10
of
1,770,523