Skip to Main content Skip to Navigation
Conference papers

Synthesis of Weighted Marked Graphs from Circular Labelled Transition Systems

Abstract : Several works have proposed methods for the analysis and synthesis of Petri net subclasses from labelled transition systems (LTS). In this paper, we focus on Choice-Free (CF) Petri nets, in which each place has at most one output, and their subclass of Weighted Marked Graphs (WMGs). We provide new conditions for the WMG-synthesis from a circular LTS, i.e. forming a single circuit, and discuss the difficulties in extending these new results to the CF case.
Complete list of metadata

Cited literature [30 references]  Display  Hide  Download

https://hal.laas.fr/hal-02332213
Contributor : Thomas Hujsa <>
Submitted on : Thursday, October 24, 2019 - 4:47:59 PM
Last modification on : Thursday, June 10, 2021 - 3:06:29 AM
Long-term archiving on: : Saturday, January 25, 2020 - 5:01:21 PM

File

ATAED19-DEH.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02332213, version 1

Citation

Raymond Devillers, Evgeny Erofeev, Thomas Hujsa. Synthesis of Weighted Marked Graphs from Circular Labelled Transition Systems. International Workshop on Algorithms & Theories for the Analysis of Event Data 2019, Jun 2019, Aachen, Germany. ⟨hal-02332213⟩

Share

Metrics

Record views

99

Files downloads

36