Scientific Annals of Computer Science
"Alexandru Ioan Cuza" University of Iaşi
Volume XII, 2002
A Tutorial on a Monadic Approach for Expressions Evaluation.,
pages 1-27
Stefan ANDREI, Wei-Ngan CHIN, Gheorghe GRIGORAS
Abstract |
BibTeX
This paper presents a monadic approach for treating
arithmetic expressions evaluation in
programming languages. The evaluation of
arithmetic expressions is an important task in any
compiler design. Using monads, our paper provides an
implementation in Haskell and illustrates optimization
opportunities based on standard monadic combinators.
Correctness results are also taken into account.
Three Level Petri Nets Rule Based Reduction.,
pages 29-52
Toader JUCAN, Oana CAPTARENCU
Abstract |
BibTeX
Three level Petri nets is a formalism for modelling
hierarchical multi -- agent systems. Tokens in three -- level Petri
Nets are elements represented by two -- level Petri nets. This
model maintains the main features of Petri net model: some crucial
for verification problems remain decidable for three -- level
Petri nets (termination, control -- state maintainability and
the inevitability problem). A comparison with some other ``flat''
Petri net models is given.
Discovery of Resourses for Distributed Application Execution in Dynamic Clusters.,
pages 53-78
Dan GRIGORAS
Abstract |
BibTeX
Cluster architectures are cost effective alternatives to
supercomputers. Built on the backbone of computer networks, they can be
scaled up or down according to distributed applications requirements. An ad
hoc cluster is temporarily organized as a virtual parallel machine for
solving demanding applications. Its resources are gathered by the means of a
name/directory or discovery process. In this paper, we review major existing
name, directory and discovery services, and describe a distributed approach
to resource discovery and management, based on a population of interacting
mobile agents. This system has several advantages, like flexibility,
scalability, robustness and transparency. Moreover, it guarantees to include
in the dynamic cluster architecture only the resources that increase system
performances.
Initial Logic and Induction in Algebraic Specification.,
pages 79-108
Dorel LUCANU
Abstract |
BibTeX
The initial truth refers to those properties which are valid in
initial models. In this paper we show how the initial
truth can be organized as an institution and introduce a
valid inference rule system with which we can develop proofs by induction
in this logic.
An XML-based Object-Oriented Infrastructure for Developing Software Agents.,
pages 109-134
Sinica ALBOAIE, Sabin-Corneliu BURAGA, Lenuta ALBOAIE
Abstract |
BibTeX
In this paper, we present an agent-based object-oriented solution for
accessing the Web distributed resources. We describe a multi-agent
infrastructure -- called emph{Omega} -- that can be considered as
a hierarchical space of a set of distributed objects that
models the Web resources.
We propose an XML/RDF-based model that can be used as an universal manner
for serialization and metadata description of the objects processed
by the agents. We also present a
distributed address space for active objects and the way in which we can
use them as a foundation for a Web-like distributed system that uses
active objects.
Concurrency-Degrees for Jumping Petri-Nets.,
pages 135-
Cristian VIDRASCU, Toader JUCAN
Abstract |
BibTeX
This paper treats the notion of degrees of concurrency in jumping Petri nets.
It will present a more general definition of concurrency-degrees for
them, which takes into consideration
the autoconcurrency (i.e the case of the transitions concurrently enabled with themselves),
thus replacing the old definitions of concurrency-degrees given
for jumping Petri nets in cite{JuV00}, %(from cite{JuV00}),
which ignore the auto-concurrency.
Also, this paper will introduce a finer notion,
namely the concurrency-degrees w.r.t. a set of transitions.
Moreover, it will point out how
these more general concurrency-degrees can be computed.
