Free Choice Petri Nets, Cambridge Tracts in Theoretical Computer Science, vol.40, 1995. ,
On Liveness and Reversibility of Equal-Conflict Petri Nets. Fundamenta Informaticae, vol.146, pp.83-119, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01716969
On Liveness and Deadlockability in Subclasses of Weighted Petri Nets. Application and Theory of Petri Nets and Concurrency: 38th International Conference, Petri NETS, pp.267-287, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-02127837
Linear algebraic and linear programming techniques for the analysis of place/transition net systems, Lectures on Petri Nets I: Basic Models, vol.1491, pp.309-373, 1998. ,
Structure theory of Equal Conflict systems, Theoretical Computer Science, vol.153, issue.1&2, pp.271-300, 1996. ,
Synchronous Data Flow, Proceedings of the IEEE, vol.75, pp.1235-1245, 1987. ,
Static scheduling of synchronous data flow programs for digital signal processing, IEEE Transaction on Computers, C, vol.36, issue.1, pp.24-35, 1987. ,
A hierarchical multiprocessor scheduling framework for synchronous dataflow graphs, 1995. ,
Embedded multiprocessors: scheduling and synchronization. Signal Processing and Communications, 2009. ,
On weighted T-systems, 13th International Conference on Application and Theory of Petri Nets and Concurrency (ICATPN), vol.616, pp.348-367, 1992. ,
A sufficient condition for the liveness of Weighted Event Graphs, European Journal of Operational Research, vol.197, issue.2, pp.532-540, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-01197183
Contribution to the study of weighted Petri nets, 2014. ,
URL : https://hal.archives-ouvertes.fr/tel-01127406
On the Reversibility of Well-Behaved Weighted Choice-Free Systems, Application and Theory of Petri Nets and Concurrency -35th International Conference, PETRI NETS 2014, pp.334-353, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01017044
Synthesis of Bounded Choice-Free Petri Nets, 26th International Conference on Concurrency Theory, pp.128-141, 2015. ,
Bounded Choice-Free Petri Net Synthesis: Algorithmic Issues, Acta Informaticae, vol.55, issue.7, pp.575-611, 2018. ,
Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems. International Workshop on Algorithms & Theories for the Analysis of Event Data, pp.75-90, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-02127780
Over-Approximative Petri Net Synthesis for Restricted Subclasses of Nets, LATA 2018, vol.10792, pp.296-307, 2018. ,
Petri Net Synthesis and Modal Specifications, 2018. ,
Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets, 8th International Conference on Language and Automata Theory and Applications, pp.161-172, 2014. ,
State space axioms for T-systems, Acta Informaticae, vol.52, issue.2-3, pp.133-152, 2015. ,
Characterisation of the State Spaces of Marked Graph Petri Nets. Information and Computation, vol.253, pp.399-410, 2017. ,
Analysis and Synthesis of Weighted Marked Graph Petri Nets. Application and Theory of Petri Nets and Concurrency -39th International Conference, PETRI, pp.19-39, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-02127849
Polynomial Sufficient Conditions of Well-Behavedness and Home Markings in Subclasses of Weighted Petri Nets, ACM Trans. Embed. Comput. Syst, vol.13, issue.4s, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01053867
Polynomial Sufficient Conditions of Well-Behavedness for Weighted Join-Free and Choice-Free Systems, 13th International Conference on Application of Concurrency to System Design, pp.90-99, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00863651
A Decidability Theorem for a Class of Vector-Addition Systems, Inf. Process. Lett, vol.3, issue.3, pp.78-80, 1975. ,
Choice-Free Petri Nets: a Model for Deterministic Concurrent Systems with Bulk Services and Arrivals, IEEE Transactions on Systems, Man, and Cybernetics, Part A, vol.27, issue.1, pp.73-83, 1997. ,
Synthesis and reengineering of persistent systems, Acta Informaticae, vol.52, issue.1, pp.35-60, 2015. ,
Marked Directed Graphs, J. Comput. Syst. Sci, vol.5, issue.5, pp.511-523, 1971. ,
A Fundamental Theorem of Asynchronous Parallel Computation, Sagamore Computer Conference 1974, vol.24, pp.102-112, 1975. ,
Petri Net Synthesis, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01237142
Synthesis of Persistent Systems. Application and Theory of Petri Nets and Concurrency -35th International Conference, PETRI NETS, Proceedings, pp.111-129, 2014. ,
Synthesis of live and bounded persistent systems. Fundamenta Informaticae, vol.140, pp.39-59, 2015. ,
Products of Transition Systems and Additions of Petri Nets, Proc. 16th International Conference on Application of Concurrency to System Design, pp.65-73, 2016. ,
Factorisation of transition systems, Acta Informaticae, vol.55, issue.4, pp.339-362, 2018. ,
Factorisation of Petri Net Solvable Transition Systems, Application and Theory of Petri Nets and Concurrency -39th International Conference, pp.82-98, 2018. ,
Partial (Set) 2-Structures. Part I: Basic Notions and the Representation Problem, Acta Informaticae, vol.27, issue.4, pp.315-342, 1990. ,
A Characterization of Set Representable Labeled Partial 2-Structures Through Decompositions, Acta Informaticae, vol.28, issue.1, pp.83-94, 1990. ,
Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets, Inf. Process. Lett, vol.94, issue.6, pp.241-245, 2005. ,
A decomposition theorem for finite persistent transition systems, Acta Inf, vol.46, issue.3, pp.237-254, 2009. ,