Abstract: In previous studies, we have introduced marked-controlled net rewrit-ing systems and a subclass of these called marked-controlled recongurable Petri nets. In a marked-controlled net rewriting system, a system conguration is de-scribed as a Petri net, and a change in conguration is described as a graph rewriting rule. A marked-controlled recongurable Petri net is a marked-controlled net rewrit-ing system where a change in conguration amounts to a modication in the ow relations of the places in the domain of the involved rule in accordance with this rule, independently of the context in which this rewriting applies. In both mod-els, the enabling of a rule not only depends on the net topology, but also depends on the net marking acco...
Petri nets are a formal and theoretically rich model for the modelling and analysis of systems. A su...
The study of asynchronous control structures used for enforcing the coordination required to carry o...
A categorical semantic domain is constructed for the reification of Petri nets based on graph transf...
Petri nets are a formal and graphical tool proposed to model and to analyze behavior of concurrent s...
In this contribution we present a tool for modeling and simulation with reconfig-urable Petri nets. ...
Controlled graph rewriting enhances expressiveness of plain graph-rewriting systems (i.e., sets of g...
In this paper we address the issues of modelling and verification of concurren- t systems subject to...
The Workshop on Petri Nets and Graph Transformations, which is currently at its second edition, is f...
Preface of the Proceedings of the Fourth International Workshop on Petri Nets and Graph Transformati...
This paper deals with the formal modeling of dynamically reconfigurable systems using Petri nets. Dy...
In its basic version, Petri Nets are defined as fixed graphs, where thebehaviour of the system is mo...
Abstract. The “classical ” approach to represent Petri nets by graph transformation systems is to tr...
We introduce a class of high level Petri nets, called reconfigurable nets, that can dynamically modi...
Reconfigurable Petri nets are Petri nets together with rules for the dynamic change of the nets. We ...
Petri Nets (PN) are a well established formal model for discrete event systems (DES). Classical PNs,...
Petri nets are a formal and theoretically rich model for the modelling and analysis of systems. A su...
The study of asynchronous control structures used for enforcing the coordination required to carry o...
A categorical semantic domain is constructed for the reification of Petri nets based on graph transf...
Petri nets are a formal and graphical tool proposed to model and to analyze behavior of concurrent s...
In this contribution we present a tool for modeling and simulation with reconfig-urable Petri nets. ...
Controlled graph rewriting enhances expressiveness of plain graph-rewriting systems (i.e., sets of g...
In this paper we address the issues of modelling and verification of concurren- t systems subject to...
The Workshop on Petri Nets and Graph Transformations, which is currently at its second edition, is f...
Preface of the Proceedings of the Fourth International Workshop on Petri Nets and Graph Transformati...
This paper deals with the formal modeling of dynamically reconfigurable systems using Petri nets. Dy...
In its basic version, Petri Nets are defined as fixed graphs, where thebehaviour of the system is mo...
Abstract. The “classical ” approach to represent Petri nets by graph transformation systems is to tr...
We introduce a class of high level Petri nets, called reconfigurable nets, that can dynamically modi...
Reconfigurable Petri nets are Petri nets together with rules for the dynamic change of the nets. We ...
Petri Nets (PN) are a well established formal model for discrete event systems (DES). Classical PNs,...
Petri nets are a formal and theoretically rich model for the modelling and analysis of systems. A su...
The study of asynchronous control structures used for enforcing the coordination required to carry o...
A categorical semantic domain is constructed for the reification of Petri nets based on graph transf...