Sciweavers

1019 search results - page 15 / 204
» Petri Net Transformations in the
Sort
View
GG
2010
Springer
13 years 7 months ago
Verification of Graph Transformation Systems with Context-Free Specifications
We introduce an analysis method for graph transformation systems which checks that certain forbidden graphs are not reachable from the start graph. These forbidden graphs are speci...
Barbara König, Javier Esparza
ENTCS
2008
152views more  ENTCS 2008»
13 years 7 months ago
Augur 2 - A New Version of a Tool for the Analysis of Graph Transformation Systems
We describe the design and the present state of the verification tool Augur 2 which is currently being developed. It is based on Augur 1, a tool which can analyze graph transforma...
Barbara König, Vitali Kozioura
WSC
2007
13 years 10 months ago
How to synthesize nets from languages: a survey
In this paper we present a survey on methods for the synthesis of Petri nets from behavioral descriptions given as languages. We consider place/transition Petri nets, elementary P...
Robert Lorenz, Sebastian Mauser, Gabriel Juh&aacut...
CORR
2006
Springer
93views Education» more  CORR 2006»
13 years 7 months ago
Free Choice Petri Nets without frozen tokens and Bipolar Synchronization Systems
Bipolar synchronization systems (BP-systems) constitute a class of coloured Petri nets, well suited for modelling the control flow of discrete dynamical systems. Every BP-system ha...
Joachim Wehler
FSTTCS
1993
Springer
13 years 11 months ago
Complexity Results for 1-safe Nets
We study the complexity of several standard problems for 1-safe Petri nets and some of its subclasses. We prove that reachability, liveness, and deadlock are all PSPACE-complete f...
Allan Cheng, Javier Esparza, Jens Palsberg