M. Majster-cederbaum - Academia.edu (original) (raw)
Uploads
Papers by M. Majster-cederbaum
Lecture Notes in Computer Science, 2005
In this paper, we show that the non-deterministic choice “+”, which was proposed as a primitive o... more In this paper, we show that the non-deterministic choice “+”, which was proposed as a primitive operator in Synchronization Tree Logic (STL for short) can be defined essentially by conjunction and disjunction in the μ-calculus (μM for short). This is obtained by extending the μ-calculus with the non-deterministic choice “+” (denoted by μM + ) and then showing that μM + can be
Theoretical Computer Science, 2000
Journal of Computer and System Sciences, 2000
Information Processing Letters, 1998
Formal Aspects of Computing, 2006
Formal Aspects of Computing, 1997
The purpose of this paper is twofold: First, we show in which way the initial solution of a domai... more The purpose of this paper is twofold: First, we show in which way the initial solution of a domain equation for cpo's and the unique solution of a corresponding domain equation for metric spaces are related. Second, we present a technique to lift a given domain equation for cpo's to a corresponding domain equation for metric spaces.
We propose results ensuring correctness by construction of a system from properties of its intera... more We propose results ensuring correctness by construction of a system from properties of its interaction model and of its components. The considered properties include deadlock-freedom, local progress of subsystems and robust- ness of these properties with respect to failure of components. This is done in a framework for component based modelling described in a previous paper. A component is the superposition of two models: a behaviour model and an in- teraction model. The interaction model describes the way the components may interact by introducing connectors that relate actions from dierent compo- nents. We illustrate our concepts and results with examples.
Lecture Notes in Computer Science, 2005
In this paper, we show that the non-deterministic choice “+”, which was proposed as a primitive o... more In this paper, we show that the non-deterministic choice “+”, which was proposed as a primitive operator in Synchronization Tree Logic (STL for short) can be defined essentially by conjunction and disjunction in the μ-calculus (μM for short). This is obtained by extending the μ-calculus with the non-deterministic choice “+” (denoted by μM + ) and then showing that μM + can be
Theoretical Computer Science, 2000
Journal of Computer and System Sciences, 2000
Information Processing Letters, 1998
Formal Aspects of Computing, 2006
Formal Aspects of Computing, 1997
The purpose of this paper is twofold: First, we show in which way the initial solution of a domai... more The purpose of this paper is twofold: First, we show in which way the initial solution of a domain equation for cpo's and the unique solution of a corresponding domain equation for metric spaces are related. Second, we present a technique to lift a given domain equation for cpo's to a corresponding domain equation for metric spaces.
We propose results ensuring correctness by construction of a system from properties of its intera... more We propose results ensuring correctness by construction of a system from properties of its interaction model and of its components. The considered properties include deadlock-freedom, local progress of subsystems and robust- ness of these properties with respect to failure of components. This is done in a framework for component based modelling described in a previous paper. A component is the superposition of two models: a behaviour model and an in- teraction model. The interaction model describes the way the components may interact by introducing connectors that relate actions from dierent compo- nents. We illustrate our concepts and results with examples.