The Experts below are selected from a list of 30027 Experts worldwide ranked by ideXlab platform
Maciej Koutny - One of the best experts on this subject based on the ideXlab platform.
-
framed Temporal logic programming
Science of Computer Programming, 2008Co-Authors: Zhenhua Duan, Xiaoxiao Yang, Maciej KoutnyAbstract:A Projection Temporal Logic is discussed and some of its laws are given. After that, an executable Temporal logic programming language, called Framed Tempura, is formalized. A minimal model-based approach for framing in Temporal logic programming is presented. Since framing destroys monotonicity, canonical models-used to define the Semantics of non-framed programs-are no longer appropriate. To deal with this, a minimal model theory is developed, using which the Temporal Semantics of framed programs is captured. The existence of a minimal model for a given framed program is demonstrated. A synchronous communication mechanism for concurrent programs is provided by means of the framing technique and minimal model Semantics.
-
Semantics of framed Temporal logic programs
International Conference on Logic Programming, 2005Co-Authors: Zhenhua Duan, Xiaoxiao Yang, Maciej KoutnyAbstract:This paper investigates Semantics of framed Temporal logic programs. To this end, a projection Temporal logic and its executable subset are presented. Based on this language, a framing technique is introduced. The Semantics of a non-framed program is well interpreted by the canonical model. However, since introducing a framing operator destroys monotonicity, a canonical model may no longer capture the intended meaning of a program. Hence, a minimal model theory is developed. Within this model, negation by default is used to manipulate frame operator. Further, the Temporal Semantics of framed programs is captured by means of the minimal models. The existence of a minimal model for a given framed program is also proved. An example is given to illustrate how the Semantics of framed programs can be captured.
Edward A Lee - One of the best experts on this subject based on the ideXlab platform.
-
architectural support for cyber physical systems
Architectural Support for Programming Languages and Operating Systems, 2015Co-Authors: Edward A LeeAbstract:Cyber-physical systems are integrations of computation, communication networks, and physical dynamics. Although time plays a central role in the physical world, all widely used software abstractions lack Temporal Semantics. The notion of correct execution of a program written in every widely-used programming language today does not depend on the Temporal behavior of the program. But Temporal behavior matters in almost all systems, and most particularly in cyber-physical systems. In this talk, I will argue that time can and must become part of the Semantics of programs for a large class of applications. To illustrate that this is both practical and useful, we will describe a recent effort at Berkeley in the design and implementation of timing-centric software systems. Specifically, I will describe PRET machines, which redefine the instruction-set architecture (ISA) of a microprocessor to embrace Temporal Semantics. Such machines can be used in high-confidence and safety-critical systems, in energy-constrained systems, in mixed-criticality systems, and as a Real-Time Unit (RTU) that cooperates with a general-purpose processor to provide real-time services, in a manner similar to how a GPU provides graphics services.
-
distributed real time software for cyber physical systems
Proceedings of the IEEE, 2012Co-Authors: John C Eidson, Edward A Lee, Slobodan Matic, Sanjit A Seshia, Jia ZouAbstract:Real-time embedded software today is commonly built using programming abstractions with little or no Temporal Semantics. This paper addresses this problem by presenting a programming model called programming Temporally integrated distributed embedded systems (PTIDES) that serves as a coordination language for model-based design of distributed real-time embedded systems. Specifically, the paper describes the principles of PTIDES, which leverages network time synchronization to provide a determinate distributed real-time Semantics. We show how PTIDES can function as a coordination language, orchestrating components that may be designed and specified using different formalisms. We show the use of this environment in the design of interesting and practical cyber-physical systems, such as a power plant control system.
-
network latency and packet delay variation in cyber physical systems
2011 IEEE Network Science Workshop, 2011Co-Authors: Janette Cardoso, Patricia Derler, John C Eidson, Edward A LeeAbstract:The problem addressed in this paper is the limitation imposed by network elements, especially Ethernet elements, on the real-time performance of timecritical systems. Most current network elements are concerned only with data integrity, connection, and throughput with no mechanism for enforcing Temporal Semantics. Existing safety-critical applications and other applications in industry require varying degrees of control over system-wide Temporal Semantics. In addition, there are emerging commercial applications that require or will benefit from tighter enforcement of Temporal Semantics in network elements than is currently possible. This paper examines these applications and requirements and suggests possible approaches to imposing Temporal Semantics on networks. Modelbased design and simulation is used to evaluate the effects of network limitations on time-critical systems.
Jan Treur - One of the best experts on this subject based on the ideXlab platform.
-
Temporal Semantics of meta level architectures for dynamic control of reasoning
Series in Defeasible Reasoning and Uncertainty Management Systems, 2001Co-Authors: Jan TreurAbstract:In the literature on meta-level architectures and reflection two separate streams can be distinguished: a logical stream (e.g., [Bowen and Kowalski, 1982], [Giunchiglia et al., 1993], [Weyhrauch, 1980]) and a procedural stream (e.g., [Clancey and Bock, 1988], [Davis, 1980]). Unfortunately there is a serious gap between the two streams. In the logical stream one restricts oneself often to static reflections; i.e., of facts the truth of which does not change during the reasoning: e.g., provable(A) (with A an object-level formula). In the procedural stream usually facts are reflected the truth of which changes during the whole reasoning pattern; e.g. control statements like currentgoal(A) with A an object-level formula, that are sometimes true and sometimes false during the reasoning. If applications to dynamic control of complex reasoning tasks are concerned these dynamic reflections are much more powerful (for applications see, e.g. [Davis, 1980], [Clancey and Bock, 1988], or [Brumsen et al., 1992], [Geelen and Kowalczyk, 1992], [Tan and Treur, 1992a1, [Tan and Treur, 1992b], [Treur, 1991a], [Treur and Veerkamp, 1992]). However, a logical basis for this is still lacking. The current paper provides a logical foundation (based on Temporal logic) of meta-level architectures for dynamic control. Our logical framework enables one to study these dynamic meta-level architectures by logical means. It can be viewed as a contribution to bridge the gap between the logical stream and the procedural stream.
-
Temporal Semantics of compositional task models and problem solving methods
Data and Knowledge Engineering, 1999Co-Authors: Frances M T Brazier, Jan Treur, Niek J E Wijngaards, Mark E T WillemsAbstract:Abstract Task models and problem solving methods can be specified informally or formally. In recent years various approaches have formalized the notion of task models or problem solving methods. Most modelling approaches concentrate on the form of a task model or problem solving method rather than on their precise Semantics: a formalisation is often only a syntactical formalisation. A more precise definition of the Semantics requires explication of the control of a system's behaviour. In this paper Temporal Semantics is defined for a compositional modelling approach to task models and problem solving methods. The Semantics is a description of a compositional system's behaviour; a Temporal approach provides a means to describe the dynamics involved. The formalisation of the Semantics is based on compositional three-valued Temporal models. The compositional structure of information states, transitions and reasoning traces provides a transparent model of the system's behaviour, both conceptually and formally.
-
Temporal Semantics of meta level architectures for dynamic control of reasoning
LOPSTR '94 META '94 Proceedings of the 4th International Workshops on Logic Programming Synthesis and Transformation - Meta-Programming in Logic, 1994Co-Authors: Jan TreurAbstract:Meta-level architectures for dynamic control of reasoning processes are quite powerful. In the literature many applications in reasoning systems modelling complex tasks are described, usually in a procedural manner. In this paper we present a declarative framework based on Temporal (partial) logic that enables one to describe the dynamics of reasoning behaviour by Temporal models. Using these models the Semantics of the behaviour of the whole (meta-level) reasoning system can be described by a set of (intended) Temporal models.
Zhenhua Duan - One of the best experts on this subject based on the ideXlab platform.
-
framed Temporal logic programming
Science of Computer Programming, 2008Co-Authors: Zhenhua Duan, Xiaoxiao Yang, Maciej KoutnyAbstract:A Projection Temporal Logic is discussed and some of its laws are given. After that, an executable Temporal logic programming language, called Framed Tempura, is formalized. A minimal model-based approach for framing in Temporal logic programming is presented. Since framing destroys monotonicity, canonical models-used to define the Semantics of non-framed programs-are no longer appropriate. To deal with this, a minimal model theory is developed, using which the Temporal Semantics of framed programs is captured. The existence of a minimal model for a given framed program is demonstrated. A synchronous communication mechanism for concurrent programs is provided by means of the framing technique and minimal model Semantics.
-
Semantics of framed Temporal logic programs
International Conference on Logic Programming, 2005Co-Authors: Zhenhua Duan, Xiaoxiao Yang, Maciej KoutnyAbstract:This paper investigates Semantics of framed Temporal logic programs. To this end, a projection Temporal logic and its executable subset are presented. Based on this language, a framing technique is introduced. The Semantics of a non-framed program is well interpreted by the canonical model. However, since introducing a framing operator destroys monotonicity, a canonical model may no longer capture the intended meaning of a program. Hence, a minimal model theory is developed. Within this model, negation by default is used to manipulate frame operator. Further, the Temporal Semantics of framed programs is captured by means of the minimal models. The existence of a minimal model for a given framed program is also proved. An example is given to illustrate how the Semantics of framed programs can be captured.
Xiaoxiao Yang - One of the best experts on this subject based on the ideXlab platform.
-
framed Temporal logic programming
Science of Computer Programming, 2008Co-Authors: Zhenhua Duan, Xiaoxiao Yang, Maciej KoutnyAbstract:A Projection Temporal Logic is discussed and some of its laws are given. After that, an executable Temporal logic programming language, called Framed Tempura, is formalized. A minimal model-based approach for framing in Temporal logic programming is presented. Since framing destroys monotonicity, canonical models-used to define the Semantics of non-framed programs-are no longer appropriate. To deal with this, a minimal model theory is developed, using which the Temporal Semantics of framed programs is captured. The existence of a minimal model for a given framed program is demonstrated. A synchronous communication mechanism for concurrent programs is provided by means of the framing technique and minimal model Semantics.
-
Semantics of framed Temporal logic programs
International Conference on Logic Programming, 2005Co-Authors: Zhenhua Duan, Xiaoxiao Yang, Maciej KoutnyAbstract:This paper investigates Semantics of framed Temporal logic programs. To this end, a projection Temporal logic and its executable subset are presented. Based on this language, a framing technique is introduced. The Semantics of a non-framed program is well interpreted by the canonical model. However, since introducing a framing operator destroys monotonicity, a canonical model may no longer capture the intended meaning of a program. Hence, a minimal model theory is developed. Within this model, negation by default is used to manipulate frame operator. Further, the Temporal Semantics of framed programs is captured by means of the minimal models. The existence of a minimal model for a given framed program is also proved. An example is given to illustrate how the Semantics of framed programs can be captured.
