Add to ORKGThis is an electronic version of the paper presented at the PN-GT'06: Workshop on Petri Nets and Graph Transformation, held in Natal on 2006This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation such as coherence and minimal initial digraph are applied to Petri nets, especially to reachability criteria. Second, the state equation and related algebraic Petri net techniques for reachability are generalized using tensor algebra to cover a wider class of rewriting systems
The structure of the reachability graph of a marked graph Petri net is fully characterised. Exact st...
International audienceWe investigate the decidability and complexity status of model-checking proble...
Graph grammars (or graph transformation systems), originally introduced as a generalization of strin...
This paper attempts to contribute in two directions. First, concepts and results of our Matrix Graph...
AbstractGiven a finite or infinite labeled transition graph defined by a graph grammar, we show an a...
This is an electronic version of the paper presented at the International Congress of Mathematicians...
AbstractColoured Petri nets are well suited to the modelling of symmetric systems. Model symmetries ...
Coloured Petri nets are well suited to the modelling of symmetric systems. Model symmetries can be u...
AbstractGraph grammars are a powerful model of concurrent and distributed systems which can be seen ...
Tesis doctoral inédita. Universidad Autónoma de Madrid, Escuela Politécnica Superior, abril de 200
The construction of symbolic reachability graphs is a useful technique for reducing state explosion ...
AbstractIn this paper, we define a class of Petri nets, called Petri nets with counters, that can be...
We investigate the decidability and complexity status of model-checking problems on unlabelled reach...
AbstractA new structure to analyse Petri nets and decide reachability is presented. Originated in Ma...
The final publication is available at Springer via http://dx.doi.org/10.1007/11841883_10Proceedings ...
The structure of the reachability graph of a marked graph Petri net is fully characterised. Exact st...
International audienceWe investigate the decidability and complexity status of model-checking proble...
Graph grammars (or graph transformation systems), originally introduced as a generalization of strin...
This paper attempts to contribute in two directions. First, concepts and results of our Matrix Graph...
AbstractGiven a finite or infinite labeled transition graph defined by a graph grammar, we show an a...
This is an electronic version of the paper presented at the International Congress of Mathematicians...
AbstractColoured Petri nets are well suited to the modelling of symmetric systems. Model symmetries ...
Coloured Petri nets are well suited to the modelling of symmetric systems. Model symmetries can be u...
AbstractGraph grammars are a powerful model of concurrent and distributed systems which can be seen ...
Tesis doctoral inédita. Universidad Autónoma de Madrid, Escuela Politécnica Superior, abril de 200
The construction of symbolic reachability graphs is a useful technique for reducing state explosion ...
AbstractIn this paper, we define a class of Petri nets, called Petri nets with counters, that can be...
We investigate the decidability and complexity status of model-checking problems on unlabelled reach...
AbstractA new structure to analyse Petri nets and decide reachability is presented. Originated in Ma...
The final publication is available at Springer via http://dx.doi.org/10.1007/11841883_10Proceedings ...
The structure of the reachability graph of a marked graph Petri net is fully characterised. Exact st...
International audienceWe investigate the decidability and complexity status of model-checking proble...
Graph grammars (or graph transformation systems), originally introduced as a generalization of strin...