Results 1  10
of
25
The synchronous dataflow programming language LUSTRE
 Proceedings of the IEEE
, 1991
"... This paper describes the language Lustre, which is a dataflow synchronous language, designed for programming reactive systems  such as automatic control and monitoring systems  as well as for describing hardware. The dataflow aspect of Lustre makes it very close to usual description tools in t ..."
Abstract

Cited by 647 (53 self)
 Add to MetaCart
This paper describes the language Lustre, which is a dataflow synchronous language, designed for programming reactive systems  such as automatic control and monitoring systems  as well as for describing hardware. The dataflow aspect of Lustre makes it very close to usual description tools in these domains (blockdiagrams, networks of operators, dynamical samplessystems, etc: : : ), and its synchronous interpretation makes it well suited for handling time in programs. Moreover, this synchronous interpretation allows it to be compiled into an efficient sequential program. Finally, the Lustre formalism is very similar to temporal logics. This allows the language to be used for both writing programs and expressing program properties, which results in an original program verification methodology. 1 Introduction Reactive systems Reactive systems have been defined as computing systems which continuously interact with a given physical environment, when this environment is unable to sy...
Leadsto: A language and environment for analysis of dynamics by simulation
 Proc. of the Third German Conference on MultiAgent System Technologies, MATES'05. Lecture Notes in Artificial Intelligence
, 2005
"... Abstract. This paper presents the language and software environment LEADSTO that has been developed to model and simulate the dynamics of MultiAgent Systems (MAS) in terms of both qualitative and quantitative concepts. The LEADSTO language is a declarative ordersorted temporal language, extended w ..."
Abstract

Cited by 180 (135 self)
 Add to MetaCart
(Show Context)
Abstract. This paper presents the language and software environment LEADSTO that has been developed to model and simulate the dynamics of MultiAgent Systems (MAS) in terms of both qualitative and quantitative concepts. The LEADSTO language is a declarative ordersorted temporal language, extended with quantitative means. Dynamics of MAS can be modelled by specifying the direct temporal dependencies between state properties in successive states. Based on the LEADSTO language, a software environment was developed that performs simulations of LEADSTO specifications, generates simulation traces for further analysis, and constructs visual representations of traces. The approach proved its value in a number of projects within different domains of MAS research. 1
METATEM: A Framework for Programming in Temporal Logic
 In REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness (LNCS Volume 430
, 1989
"... In this paper we further develop the methodology of temporal logic as an executable imperative language, presented by Moszkowski [Mos86] and Gabbay [Gab87, Gab89] and present a concrete framework, called METATEM for executing (modal and) temporal logics. Our approach is illustrated by the developmen ..."
Abstract

Cited by 88 (19 self)
 Add to MetaCart
(Show Context)
In this paper we further develop the methodology of temporal logic as an executable imperative language, presented by Moszkowski [Mos86] and Gabbay [Gab87, Gab89] and present a concrete framework, called METATEM for executing (modal and) temporal logics. Our approach is illustrated by the development of an execution mechanism for a propositional temporal logic and for a restricted first order temporal logic.
An Authorization Logic with Explicit Time
, 2008
"... We present an authorization logic that permits reasoning with explicit time. Following a prooftheoretic approach, we study the metatheory of the logic, including cut elimination. We also demonstrate formal connections to proofcarrying authorization’s existing approach for handling time and commen ..."
Abstract

Cited by 30 (12 self)
 Add to MetaCart
(Show Context)
We present an authorization logic that permits reasoning with explicit time. Following a prooftheoretic approach, we study the metatheory of the logic, including cut elimination. We also demonstrate formal connections to proofcarrying authorization’s existing approach for handling time and comment on the enforceability of our logic in the same framework. Finally, we illustrate the expressiveness of the logic through examples, including those with complex interactions between time, authorization, and mutable state.
Planning from Second Principles
 Artificial Intelligence
, 1996
"... Planning from second principles by reusing and modifying plans is one way of improving the efficiency of planning systems. In this paper, we study it in the general framework of deductive planning and develop a logical formalization of planning from second principles, which relies on a systematic ..."
Abstract

Cited by 27 (1 self)
 Add to MetaCart
(Show Context)
Planning from second principles by reusing and modifying plans is one way of improving the efficiency of planning systems. In this paper, we study it in the general framework of deductive planning and develop a logical formalization of planning from second principles, which relies on a systematic decomposition of the planning process. Deductive inference processes with clearly defined semantics formalize each of the subtasks a second principles planner has to address. Plan modification, which comprises matching and adaptation tasks, is based on a deductive approach yielding provably correct modified plans. Description logics are introduced as query languages to plan libraries, which leads to a novel and efficient solution to the indexing problem in casebased reasoning. Apart from sequential plans, this approach enables a planner to reuse and modify complex plans containing control structures like conditionals and loops. 1 Introduction Planning from first principles generat...
A Road Map of Interval Temporal Logics and Duration Calculi
, 2004
"... We survey main developments, results, and open problems on interval temporal logics and duration calculi. We present various formal systems studied in the literature and discuss their distinctive features, emphasizing on expressiveness, axiomatic systems, and (un)decidability results. ..."
Abstract

Cited by 26 (11 self)
 Add to MetaCart
We survey main developments, results, and open problems on interval temporal logics and duration calculi. We present various formal systems studied in the literature and discuss their distinctive features, emphasizing on expressiveness, axiomatic systems, and (un)decidability results.
Separation Logic Semantics of Communicating Processes
 In FICS
, 2008
"... This paper explores a unification of the ideas of Concurrent Separation Logic with those of Communicating Sequential Processes. It extends separation logic by an operator for separation in time as well as separation in space. It extends CSP in the direction of the picalculus: dynamic change of alph ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
(Show Context)
This paper explores a unification of the ideas of Concurrent Separation Logic with those of Communicating Sequential Processes. It extends separation logic by an operator for separation in time as well as separation in space. It extends CSP in the direction of the picalculus: dynamic change of alphabet is achieved by communication of channel names. Separation is exploited to ensure that each channel still has only two ends. For purposes of exploration, the model is the simplest possible, confined to traces without refusals. The treatment is sufficiently general to facilitate extensions by standard techniques for sharing multiplexed channels and heap state. 1
Rule systems for runtime verification: A short tutorial
 In Proc. of the 9th Int. Workshop on Runtime Verification (RV’09), volume 5779 of LNCS
, 2009
"... Abstract. In this tutorial, we introduce two rulebased systems for on and offline trace analysis, RULER and LOGSCOPE. RULER is a conditional rulebased system, which has a simple and easily implemented algorithm for effective runtime verification, and into which one can compile a wide range of temp ..."
Abstract

Cited by 14 (9 self)
 Add to MetaCart
(Show Context)
Abstract. In this tutorial, we introduce two rulebased systems for on and offline trace analysis, RULER and LOGSCOPE. RULER is a conditional rulebased system, which has a simple and easily implemented algorithm for effective runtime verification, and into which one can compile a wide range of temporal logics and other specification formalisms used for runtime verification. Specifications can be parameterized with data, or even with specifications, allowing for temporal logic combinators to be defined. We outline a number of simple syntactic extensions of core RULER that can lead to further conciseness of specification but still enabling easy and efficient implementation. RuleR is implemented in Java and we will demonstrate its ease of use in monitoring Java programs. LOGSCOPE is a derivation of RULER adding a simple very userfriendly temporal logic. It was developed in Python, specifically for supporting testing of spacecraft flight software for NASA’s next 2011 Mars mission MSL (Mars Science Laboratory). The system has been applied by test engineers to analysis of log files generated by running the flight software. Detailed logging is already part of the system design approach, and hence there is no added instrumentation overhead caused by this approach. While postmortem log analysis prevents the autonomous reaction to problems possible with traditional runtime verification, it provides a powerful tool for test automation. A new system is being developed that integrates features from both RULER and LOGSCOPE.
A Graphical Interval Logic Toolset for Verifying Concurrent Systems
 In Proc. 4th Conf. Computer Aided Verification, LNCS #697
, 1993
"... . Graphical Interval Logic is the foundation of a toolset we have developed to support formal specification and verification of concurrent systems. The logic is a discrete lineartime temporal logic with the distinguishing feature that formulas in the logic have an intuitive graphical representation ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
(Show Context)
. Graphical Interval Logic is the foundation of a toolset we have developed to support formal specification and verification of concurrent systems. The logic is a discrete lineartime temporal logic with the distinguishing feature that formulas in the logic have an intuitive graphical representation. The toolset includes a graphical editor that allows the user to compose and edit graphical formulas on a workstation display and a theorem prover that mechanically checks the validity of proofs in the logic. This paper describes the toolset and illustrates its use. 1 Introduction Verifying the correctness of the design of a concurrent system is an extremely difficult and challenging task. The complexity of the problem stems mainly from the need to consider all of the possible orderings or interleavings of events that can be generated by different executions of the system. Nevertheless, the problem is very important because many of the most critical realworld systems are concurrent system...
Y.: Verifying Chinese train control system under a combined scenario by theorem proving
"... Abstract. In this paper, we investigate how to formalize and verify the System Requirements Specification (SRS) of Chinese Train Control System Level 3 (CTCS3), which includes a set of basic operational scenarios that cooperate with each other to achieve the desired behavior of trains. It is absol ..."
Abstract

Cited by 7 (7 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper, we investigate how to formalize and verify the System Requirements Specification (SRS) of Chinese Train Control System Level 3 (CTCS3), which includes a set of basic operational scenarios that cooperate with each other to achieve the desired behavior of trains. It is absolutely necessary to prove that the cooperation of basic scenarios indeed completes the required behavior. As a case study, a combined scenario with several basic scenarios integrated is studied in this paper. We model each scenario as a Hybrid CSP (HCSP) process, and specify its properties using Hybrid Hoare Logic (HHL). Given such an annotated HCSP model, the deductive verification of conformance of the model to the properties is then carried out. For the purpose, we implement a theorem prover of HHL in Isabelle/HOL, with which the process including modelling and verification of annotated HCSP models can be mechanized. In particular, we provide a machinechecked proof for the combined scenario, with the result indicating a design error in SRS of CTCS3.