This paper discusses applications of a formal set-theoretic foundation for fuzzy set theory [23] to problems of approximate and uncertain reasoning, and also looks at other formalisms, such as the classical Alternativ...
详细信息
This paper discusses applications of a formal set-theoretic foundation for fuzzy set theory [23] to problems of approximate and uncertain reasoning, and also looks at other formalisms, such as the classical Alternative Set Theory 139) and its Intuitionistic version [21, 20] for uncertain reasoning. Formal definitions of these frameworks will be given. Many suggestions for semantic operations on values of formulae involving intermediate truth have been made;[41, 40] contain a survey of these. There are two main problems: how to reconcile the use of the linear order [0, 1] as the value space when in reality degrees of truth are often incomparable, and secondly, within this simplified range of values, to select operations which are both logically coherent with each other and intuitively reasonable. We will derive general semantic constraints on operations which will motivate the formal frameworks that we define.
In this paper, we develop a compositional denotational semantics for prioritized real-time distributed programming languages. One of the interesting features is that it extends the existing compositional theory propos...
详细信息
In this paper, we develop a compositional denotational semantics for prioritized real-time distributed programming languages. One of the interesting features is that it extends the existing compositional theory proposed by Koymans et al (1988) for prioritized real-time languages preserving the compositionality of the semantics. The language permits users to define situations in which an action has priority over another action without the requirement of preassigning priorities to actions for partially ordering the alphabet of actions. These features are part of the languages such as Ada designed specifically keeping in view the needs of real-time embedded systems. Further, the approach does not have the restriction of other approaches such as prioritized internal moves can preempt unprioritized actions etc. Our notion of priority in the environment is based on the intuition that a low priority action can proceed only if the high priority action cannot proceed due to lack of the handshaking partner at that point of execution. In other words, if some action is possible corresponding to that environment at some point of execution then the action takes place without unnecessary waiting. The proposed semantic theory provides a clear distinction between the semantic model and the execution model - this has enabled us to fully ensure that there is no unnecessary waiting.
We describe the rudiments of algorithm refinement: the business of taking a specification and producing code that correctly implements it. The paper starts with a general discussion of the concepts, and then turns to ...
We describe the rudiments of algorithm refinement: the business of taking a specification and producing code that correctly implements it. The paper starts with a general discussion of the concepts, and then turns to a particular calculus for algorithm refinement.
The authors present a real-time programming language, including concurrency, which could be used in the formal development of embedded systems. The semantics of the language is provided in the form of a time interval ...
详细信息
We define non-interference in the algebra of CSP;that definition leads to simple proof rules for non-interference concerning, amongst other things, composition of systems exhibiting non-interference. We work through a...
The author defines non-interference in the algebra of CSP; that definition leads to simple proof rules for non-interference concerning, amongst other things, composition of systems exhibiting non-interference. The aut...
详细信息
The author defines non-interference in the algebra of CSP; that definition leads to simple proof rules for non-interference concerning, amongst other things, composition of systems exhibiting non-interference. The author works through a case study of a multi-level secure system to illustrate those laws.< >
The authors present a real-time programming language, including concurrency, which could be used in the formal development of embedded systems. The semantics of the language is provided in the form of a time interval ...
详细信息
The authors present a real-time programming language, including concurrency, which could be used in the formal development of embedded systems. The semantics of the language is provided in the form of a time interval semantics and also a number of algebraic refinement laws. The laws allow convenient reasoning and transformation of programs. In particular, a compiler for a sequential subset of the language is defined as a set of theorems relating high-level program constructs to a low-level machine specified as an interpreter in the high-level language. In addition, a prototype compiler may be produced very directly from Ihe lheorems in Ihe form of a logic program.
This paper describes a design framework for developing application-specific serial array circuits. Starting from a description of the state-transition logic or a fully-parallel architecture, correctness-preserving tra...
详细信息
This paper describes a design framework for developing application-specific serial array circuits. Starting from a description of the state-transition logic or a fully-parallel architecture, correctness-preserving transformations are employed to derive a wide range of implementations with different space-time trade-offs. The approach has been used in synthesising designs based on field-programmable gate arrays, and is illustrated by the development of a number of circuits including sorters and convolvers.< >
暂无评论