| Reference : Efficient Process Analysis of Transformation Systems Based on Petri nets |
| Reports : External report | |||
| Engineering, computing & technology : Computer science | |||
| http://hdl.handle.net/10993/5623 | |||
| Efficient Process Analysis of Transformation Systems Based on Petri nets | |
| English | |
Hermann, Frank [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >] | |
| Corradini, Andrea [> >] | |
| Ehrig, Hartmut [> >] | |
| König, Barbara [> >] | |
| 2010 | |
| TU Berlin | |
| ISSN 1436-9915 | |
| TR 2010-3 | |
| [en] In the framework of adhesive transformation systems with Negative Application
Conditions (NACs), we show how the problem of computing the set of equivalent derivations to a given one can be reduced to the analysis of the reachability graph of a generated Place/Transition Petri net. This net encodes the dependencies among rule applications of the derivation, including the inhibiting e ects of the NACs. We show the e ectiveness of this approach by comparing the cost of a brute force-approach with the cost of the presented analysis applied to a derivation of a simple system, showing a signi cant improvement in speed. | |
| http://hdl.handle.net/10993/5623 | |
| http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/ |
| File(s) associated to this reference | ||||||||||||||
|
Fulltext file(s):
| ||||||||||||||
All documents in ORBilu are protected by a user license.