Analysis of Petri Nets and Transition Systems
This paper describes a stand-alone, no-frills tool supporting the analysis of (labelled) place/transition Petri nets and the synthesis of labelled transition systems into Petri nets. It is implemented as a collection of independent, dedicated algorithms which have been designed to operate modularly,...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Open Publishing Association
2015-08-01
|
| Series: | Electronic Proceedings in Theoretical Computer Science |
| Online Access: | http://arxiv.org/pdf/1508.04851v1 |
| _version_ | 1811301855927468032 |
|---|---|
| author | Eike Best Uli Schlachter |
| author_facet | Eike Best Uli Schlachter |
| author_sort | Eike Best |
| collection | DOAJ |
| description | This paper describes a stand-alone, no-frills tool supporting the analysis of (labelled) place/transition Petri nets and the synthesis of labelled transition systems into Petri nets. It is implemented as a collection of independent, dedicated algorithms which have been designed to operate modularly, portably, extensibly, and efficiently. |
| first_indexed | 2024-04-13T07:17:36Z |
| format | Article |
| id | doaj.art-1787b44c4a9b4517b0e973a70a39b2a5 |
| institution | Directory Open Access Journal |
| issn | 2075-2180 |
| language | English |
| last_indexed | 2024-04-13T07:17:36Z |
| publishDate | 2015-08-01 |
| publisher | Open Publishing Association |
| record_format | Article |
| series | Electronic Proceedings in Theoretical Computer Science |
| spelling | doaj.art-1787b44c4a9b4517b0e973a70a39b2a52022-12-22T02:56:43ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802015-08-01189Proc. ICE 2015536710.4204/EPTCS.189.6:7Analysis of Petri Nets and Transition SystemsEike Best0Uli Schlachter1 Oldenburg Oldenburg This paper describes a stand-alone, no-frills tool supporting the analysis of (labelled) place/transition Petri nets and the synthesis of labelled transition systems into Petri nets. It is implemented as a collection of independent, dedicated algorithms which have been designed to operate modularly, portably, extensibly, and efficiently.http://arxiv.org/pdf/1508.04851v1 |
| spellingShingle | Eike Best Uli Schlachter Analysis of Petri Nets and Transition Systems Electronic Proceedings in Theoretical Computer Science |
| title | Analysis of Petri Nets and Transition Systems |
| title_full | Analysis of Petri Nets and Transition Systems |
| title_fullStr | Analysis of Petri Nets and Transition Systems |
| title_full_unstemmed | Analysis of Petri Nets and Transition Systems |
| title_short | Analysis of Petri Nets and Transition Systems |
| title_sort | analysis of petri nets and transition systems |
| url | http://arxiv.org/pdf/1508.04851v1 |
| work_keys_str_mv | AT eikebest analysisofpetrinetsandtransitionsystems AT ulischlachter analysisofpetrinetsandtransitionsystems |