Hussein S. M. Zedan
University of York
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Hussein S. M. Zedan.
Theoretical Computer Science | 1994
David Scholefield; Hussein S. M. Zedan; He Jifeng
A refinement calculus for the development of real-time systems is presented. The calculus is based upon a wide-spectrum language called the temporal agent model (TAM), within which both functional and timing properties can be expressed in either abstract or concrete terms. A specification-oriented semantics for the language is given. Program development is considered as a refinement process, i.e. calculation of a structured program from an unstructured specification. A calculus of decomposition is defined. An example program is developed.
Proceedings of the Second International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems | 1992
David Scholefield; Hussein S. M. Zedan
The Temporal Agent Model (TAM) is a wide-spectrum development language for real-time systems. In TAM, limited resources are modelled by deriving release times and absolute deadlines from weakest pre-condition predicate transformers. In this paper the language syntax and semantics are described along with a number of examples.
Information Processing Letters | 1987
Cyrus Hazari; Hussein S. M. Zedan
Abstract We improve on Ranas distributed and fully symmetric solution for detection of distributed termination.
Research Directions in High-Level Parallel Programming Languages | 1991
Paul Butcher; Hussein S. M. Zedan
This document describes the courting of Linda (a coordination language) by Russell (a computation language), and the subsequent conception of their child Lucinda. Mother and baby are both doing well.
Information Processing Letters | 1993
Chris Ho-Stuart; Hussein S. M. Zedan; Ming Fang
Abstract New definitions for connectives in a real-time process algebra are introduced, for which the natural weak bisimulation relation is a congruence. Two kinds of weak bisimulation can be distinguished: step and path bisimulation.
Information Processing Letters | 1992
David Scholefield; Hussein S. M. Zedan
Abstract A weakest precondition semantics for a real-time concurrent language is defined. An example in verification is presented, and the use of predicate transformers as the basis of a refinement calculus is also discussed.
Sigplan Notices | 1991
Paul Butcher; Hussein S. M. Zedan
This document describes the courting of Linda (a coordination language) by Russell (a computation language), and the subsequent conception of their child Lucinda. Mother and baby are both doing well.A number of disadvantages with current Linda implementations are discussed, and a new language, Lucinda, is proposed to overcome them. Lucinda provides multiple, typed tuple spaces, polymorphism, and a novel approach to data structuring and storage.
Microprocessing and Microprogramming | 1993
Celio Estevan Moron; Hussein S. M. Zedan
Abstract The development of complex real-time systems has become a reality with the move from uniprocessor to distributed systems. In general, these systems require adaptability in order to cope with many types of timing constraints. The most critical part in the development of these systems is the scheduler. Our approach is based on the view that if the system is adaptable then the reliability is easier to be attained. We are proposing the use of milestone notion within the Least Laxity Scheduler Algorithm and augmenting it with an “alert” mechanism that is generated using the information provided by the milestone. The scheduler is fully implemented in an industrially available kernel namely RTXC/MP1
international conference on mathematical foundations of programming semantics | 1993
David Scholefield; Hussein S. M. Zedan; He Jifeng
A formal framework for a calculus of real-time systems is presented. Specifications and program statements are combined into a single language called TAM (the Temporal Agent Model), that allows the user to express both functional and timing properties. A specification-oriented semantics for TAM is given, along with the definition of a refinement relation and a calculus which is sound with respect to that relation. A simple real-time program is also developed using the calculus.
Microprocessing and Microprogramming | 1989
Hussein S. M. Zedan; R. G. Stone; D. S Simpson
Abstract PCHAN (Priority CHANnel) is a new notion for resource management in the design of distributed occam systems. The concept itself effectively redefines the usual idea of “priority”. Priority usually refers to the relative importance of access to the SAME resource. In this paper, the client is requesting different services from the same manager, and priority defines the relative importance of those services. PCHAN permits dynamic resource allocation by allowing clients to (dynamically) vary their priorities. The notion is introduced within the framework of occams model of computations and illustrated using various programming paradigms.