The Experts below are selected from a list of 1542 Experts worldwide ranked by ideXlab platform
Maria Bielikova - One of the best experts on this subject based on the ideXlab platform.
-
qos aware semantic web service composition approach considering pre Postconditions
International Conference on Web Services, 2010Co-Authors: Peter Bartalos, Maria BielikovaAbstract:Web service composition is a topic bringing several issues to be resolved. Our work deals with the effectiveness and scalability of service composition. During composition we consider QoS and pre-/post-conditions of single services to create a composite service satisfying the user needs the best. Regarding pre-/post-conditions we propose an approach to fast determination of which services produce results expected by the user, i.e. the post-condition of which services implicates the desired condition defined in the user goal. This paper proposes also an approach to restriction on the service space which provided a dramatic improvement in terms of composition time.
-
fast and scalable semantic web service composition approach considering complex pre Postconditions
IEEE Congress on Services, 2009Co-Authors: Peter Bartalos, Maria BielikovaAbstract:The process of semantic web service composition arranges several web services into one composite service to realize complex workflows with an exploitation of semantics. This paper proposes an approach to automatic semantic web service composition. Its advantage is good scalability regarding the complexity of user constraints and pre/post conditions. Based on these conditions it propagates the value restrictions constraint from the user goal through the overall composite service. The resulting plan depicts all the possible branches of the workflow leading to a goal. This includes the automatic generation of the conditions deciding which branch will be chosen during the execution. Finally, our approach exploits available data which can be used as input parameters for web services. If these are not offered, it searches for a web service producing them.
Catuscia Palamidessi - One of the best experts on this subject based on the ideXlab platform.
-
temporal concurrent constraint programming denotation logic and applications
Nordic Journal of Computing, 2002Co-Authors: Mogens Nielsen, Catuscia Palamidessi, Frank D ValenciaAbstract:The tcc model is a formalism for reactive concurrent constraint programming. We present a model of temporal concurrent constraint programming which adds to tcc the capability of modeling asynchronous and nondeterministic timed behavior. We call this tcc extension the ntcc calculus. We also give a denotational semantics for the strongest-Postcondition of ntcc processes and, based on this semantics, we develop a proof system for linear-temporal properties of these processes. The expressiveness of ntcc is illustrated by modeling cells, timed systems such as RCX controllers, multi-agent systems such as the Predator/Prey game, and musical applications such as generation of rhythms patterns and controlled improvisation.
-
a temporal concurrent constraint programming calculus
Principles and Practice of Constraint Programming, 2001Co-Authors: Catuscia Palamidessi, Frank D ValenciaAbstract:The tcc model is a formalism for reactive concurrent constraint programming. In this paper we propose a model of temporal concurrent constraint programming which adds to tcc the capability of modeling asynchronous and non-deterministic timed behavior. We call this tcc extension the ntcc calculus. The expressiveness of ntcc is illustrated by modeling cells, asynchronous bounded broadcasting and timed systems such as RCX controllers. We present a denotational semantics for the strongest-Postcondition of ntcc processes and, based on this semantics, we develop a proof system for linear temporal properties of these processes.
-
a temporal concurrent constraint programming calculus
BRICS Report Series, 2001Co-Authors: Catuscia Palamidessi, Frank D ValenciaAbstract:The tcc model is a formalism for reactive concurrent constraint programming. In this paper we propose a model of temporal concurrent constraint programming which adds to tcc the capability of modeling asynchronous and non-deterministic timed behavior. We call this tcc extension the ntcc calculus. The expressiveness of ntcc is illustrated by modeling cells and asynchronous bounded broadcasting, by specifying temporal requirements such as response and invariance, and by modeling timed systems such as RCX controllers. We present a denotational semantics for modeling the strongest-Postcondition behavior of ntcc processes, and, based on this semantics, we develop a proof system for proving linear temporal properties of these processes.
-
proving concurrent constraint programs correct
ACM Transactions on Programming Languages and Systems, 1997Co-Authors: Frank S De Boer, Maurizio Gabbrielli, Elena Marchiori, Catuscia PalamidessiAbstract:We introduce a simple compositional proof system for proving (partial) correctness of concurrent constraint programs (CCP). The proof system is based on a denotational approximation of the strongest Postcondition semantics of CCP programs. The proof system is proved to be correct for full CCP and complete for the class of programs in which the denotational semantics characterizes exactly the strongest Postcondition. This class includes the so-called confluent CCP, a special case of which is constraint logic programming with dynamic scheduling.
-
proving concurrent constraint programs correct
Symposium on Principles of Programming Languages, 1994Co-Authors: Frank S De Boer, Maurizio Gabbrielli, Elena Marchiori, Catuscia PalamidessiAbstract:We develop a compositional proof-system for the partial correctness of concurrent constraint programs. Soundness and (relative) completeness of the system are proved with respect to a denotational semantics based on the notion of strongest Postcondition. The strongest Postcondition semantics provides a justification of the declarative nature of concurrent constraint programs, since it allows to view programs as theories in the specification logic.
Duan Repov - One of the best experts on this subject based on the ideXlab platform.
-
l fuzzy strongest Postcondition predicate transformers as l idempotent linear or affine operators between semimodules of monotonic predicates
Fuzzy Sets and Systems, 2012Co-Authors: Oleh Nykyforchyn, Duan RepovAbstract:For a completely distributive quantale L, L-fuzzy strongest Postcondition predicate transformers are introduced, and it is shown that, under reasonable assumptions, they are linear or affine continuous mappings between continuous L-idempotent semimodules of L-fuzzy monotonic predicates.
Betty H C Cheng - One of the best experts on this subject based on the ideXlab platform.
-
strongest Postcondition semantics as the formal basis for reverse engineering
Automated Software Engineering, 1996Co-Authors: Gerald C Gannod, Betty H C ChengAbstract:Reverse engineering of program code is the process of constructing a higher level abstraction of an implementation in order to facilitate the understanding of a system that may be in a “legacy” or “geriatric” state. Changing architectures and improvements in programming methods, including formal methods in software development and object-oriented programming, have prompted a need to reverse engineer and re-engineer program code. This paper describes the application of the strongest Postcondition predicate transformer (sp) as the formal basis for the reverse engineering of imperative program code.
-
strongest Postcondition semantics as the formal basis for reverse engineering
Working Conference on Reverse Engineering, 1995Co-Authors: Gerald C Gannod, Betty H C ChengAbstract:Reverse engineering of program code is the process of constructing a higher level abstraction of an implementation in order to facilitate the understanding of a system that may be in a "legacy" or "geriatric" state. Changing architectures and improvements in programming methods, including formal methods in software development and object-oriented programming, have prompted a need to reverse engineer and re-engineer program code. This paper describes the application of the strongest Postcondition predicate transformer (strongest Postcondition) as the formal basis for the reverse engineering of imperative program code.
Peter Bartalos - One of the best experts on this subject based on the ideXlab platform.
-
qos aware semantic web service composition approach considering pre Postconditions
International Conference on Web Services, 2010Co-Authors: Peter Bartalos, Maria BielikovaAbstract:Web service composition is a topic bringing several issues to be resolved. Our work deals with the effectiveness and scalability of service composition. During composition we consider QoS and pre-/post-conditions of single services to create a composite service satisfying the user needs the best. Regarding pre-/post-conditions we propose an approach to fast determination of which services produce results expected by the user, i.e. the post-condition of which services implicates the desired condition defined in the user goal. This paper proposes also an approach to restriction on the service space which provided a dramatic improvement in terms of composition time.
-
fast and scalable semantic web service composition approach considering complex pre Postconditions
IEEE Congress on Services, 2009Co-Authors: Peter Bartalos, Maria BielikovaAbstract:The process of semantic web service composition arranges several web services into one composite service to realize complex workflows with an exploitation of semantics. This paper proposes an approach to automatic semantic web service composition. Its advantage is good scalability regarding the complexity of user constraints and pre/post conditions. Based on these conditions it propagates the value restrictions constraint from the user goal through the overall composite service. The resulting plan depicts all the possible branches of the workflow leading to a goal. This includes the automatic generation of the conditions deciding which branch will be chosen during the execution. Finally, our approach exploits available data which can be used as input parameters for web services. If these are not offered, it searches for a web service producing them.
