Fig 3 - uploaded by Charles Lakos
Content may be subject to copyright.
Source publication
This paper presents the concept of reflection, where a program modifies its own interpretation. A number of applications of reflection are examined and it becomes apparent that the technique is particularly applicable to the implementation of object-oriented languages. The paper then considers how the technique can be applied to the implementation...
Similar publications
In this paper we are interested in sequentialization of formal power series with coefficients in the semiring (Formula presented.) which represent the behavior of timed Petri nets. Several approaches make it possible to derive nondeterministic (max, + ) automata modeling safe timed Petri nets. Their nondeterminism is a serious drawback since determ...
This paper deals with computing the minimal and maximal execution durations in a given concurrent control system in order to support dependability engineering by assuring the meeting of prescribed deadlines. For that purpose, a new type of time-dependent Petri nets - the Duration Interval Petri net - is introduced, and a dedicated reachability grap...
This work deals with the specification and the verification of concurrent systems. Our goal is to exploit an implementable model, namely the maximality-based labeled transition system, which permits expressing true-concurrency in a natural way without splitting actions on their start and end events. To do this, we give an operational semantics to b...
\mathcal{M}$-adhesive categories provide an abstract framework for a large variety of specification frameworks for modelling distributed and concurrent systems. They extend the well-known frameworks of adhesive and weak adhesive HLR categories and integrate high-level constructs such as attribution as in the case of typed attributed graphs.
In the...
We propose an extension with immediate multiactions of discrete time stochastic Petri box calculus (dtsPBC), presented by I.V. Tarasyuk. The resulting algebra dtsiPBC is a discrete time analogue of stochastic Petri box calculus (sPBC) with immediate multiactions, proposed by H. Macia, V. Valero and others within a continuous time domain. The step o...
Citations
Traditional Petri nets lack specific features to conveniently describe systems with an evolving structure. A model based on the Symmetric Net formalism has been recently introduced. It is composed of an emulator reproducing the behaviour of a Place/Transition net (encoded as a marking) and a basic set of net-transformation primitives to specify evolutionary behaviour. In this paper, we discuss the adoption of the stochastic extension of Symmetric Nets for performance analysis, considering important issues related to time specification and analysis complexity. We put into place theoretical aspects by using a running example consisting in a self-healing manufacturing system.
This paper presents fundamentals of a novel framework adequately tailored for specifying and validating complex information systems as fully distributed, autonomous yet cooperating components. The proposed framework, referred to as CO-NETS, is a multi-paradigm soundly integrating object-oriented (OO) structuring mechanisms, modularity concepts and some constructions from semantical data modeling into an appropriate variety of algebraic Petri nets. The model is semantically interpreted in a true concurrency way using an adequate instantiation of rewriting logic.CO-NETS main features may be highlighted as follows: firstly, CO-NETS allow to build autonomous components as a hierarchy of OO classes with explicit interfaces. Each component behaves with respect to an intra-component evolution pattern that fully exhibits intra-as well as inter-object concurrency. Secondly, while such components autonomously behave they may interact with each other using their explicit interfaces and respecting an inter-component interaction pattern. Thirdly, from a methodological point of view, CO-NETS components may be incrementally conceived from well known semi-informal OO diagrams. Besides that, thanks to their rewriting-logic based semantics, CO-NETS components are validated using concurrent rewriting techniques simultaneously accompanied by graphical animations. CO-NETS practicability is illustrated through a non-trivial case study, and all CO-NETS features are compared to similar existing OO formalisms on the basis of some exhaustive criteria.
The paper proposes the generation of Java applets from specifications given in an extended Petri Net formalism. The anticipated advantages of this approach are to gain a greater confidence in the correctness of the final product, and to harness the capabilities of Java in a consistent framework. The emphasis of the paper is on the generation of the Java code from the Petri net specification, on the assessment of both Java and C++ as suitable targets for this translation, and on the suitability of this extended form of Petri net as a host for various extensions to Java
