Cited By
View all- Devillers RErofeev EHujsa T(2021)Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and BeyondTransactions on Petri Nets and Other Models of Concurrency XV10.1007/978-3-662-63079-2_4(75-100)Online publication date: 25-Feb-2021
- Wimmel H(2020)Presynthesis of bounded choice-free or fork-attribution netsInformation and Computation10.1016/j.ic.2019.104482271:COnline publication date: 1-Jul-2020
- Devillers RErofeev EHujsa T(2019)Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems: A Geometric ApproachTransactions on Petri Nets and Other Models of Concurrency XIV10.1007/978-3-662-60651-3_7(172-191)Online publication date: 21-Nov-2019
- Show More Cited By