Results 1  10
of
14
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 488 (42 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 168 (123 self)
 Add to MetaCart
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 (20 self)
 Add to MetaCart
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 26 (8 self)
 Add to MetaCart
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 22 (1 self)
 Add to MetaCart
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...
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 16 (0 self)
 Add to MetaCart
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
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
. 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...
Constraint deduction in an intervalbased temporal logic
 Executable Modal and Temporal Logics, (Proc. of the IJCAI'93 Workshop), volume 897 of LNAI
, 1995
"... Abstract. We describe reasoning methods for the intervalbased modal temporal logic LLP which employs the modal operators sometimes, always, next, and chop. We propose a constraint deduction approach and compare it with a sequent calculus, developed as the basic machinery for the deductive planning ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Abstract. We describe reasoning methods for the intervalbased modal temporal logic LLP which employs the modal operators sometimes, always, next, and chop. We propose a constraint deduction approach and compare it with a sequent calculus, developed as the basic machinery for the deductive planning system PHI which uses LLP as underlying formalism. 1
Logic of subtyping
 Theoretical Computer Science
, 2005
"... We introduce new modal logical calculi that describe subtyping properties of Cartesian product and disjoint union type constructors as well as mutuallyrecursive types defined using those type constructors. Basic Logic of Subtyping S extends classical propositional logic by two new binary modalities ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We introduce new modal logical calculi that describe subtyping properties of Cartesian product and disjoint union type constructors as well as mutuallyrecursive types defined using those type constructors. Basic Logic of Subtyping S extends classical propositional logic by two new binary modalities ⊗ and ⊕. An interpretation of S is a function that maps standard connectives into settheoretical operations (intersection, union, and complement) and modalities into Cartesian product and disjoint union type constructors. This allows S to capture many subtyping properties of the above type constructors. We also consider logics Sρ and S ω ρ that incorporate into S mutuallyrecursive types over arbitrary and wellfounded universes correspondingly. The main results are completeness of the above three logics with respect to appropriate type universes. In addition, we prove Cut elimination theorem for S and establish decidability of S and S ω ρ.
Automated Deduction in a Graphical Temporal Logic
 Journal of Applied NonClassical Logics
, 1996
"... . RealTime Graphical Interval Logic is a modal logic for reasoning about time in which the basic modality is the interval. The logic differs from other logics in that it has a natural intuitive graphical representation that resembles the timing diagrams drawn by system designers. We have developed ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. RealTime Graphical Interval Logic is a modal logic for reasoning about time in which the basic modality is the interval. The logic differs from other logics in that it has a natural intuitive graphical representation that resembles the timing diagrams drawn by system designers. We have developed an automated deduction system for the logic, which includes a theorem prover and a user interface. The theorem prover checks the validity of proofs in the logic and produces counterexamples to invalid proofs. The user interface includes a graphical editor that enables the user to create graphical formulas on a workstation display, and a database and proof manager that tracks proof dependencies and allows graphical formulas to be stored and retrieved. In this paper we describe the logic, the automated deduction system, and an application to robotics. KEYWORDS: Automated Deduction, Buchi Automaton, Graphical Representation, Interval Logic, RealTime, Temporal Logic. Introduction Real systems...