Thomas Hujsa

Orcid: 0000-0001-5226-8752

Affiliations:
  • University of Toulouse, LAAS-CNRS, France
  • University of Toulouse, ONERA/DTIS, France (former)
  • University of Oldenburg, Depaertment of Computer Science, Germany (former)
  • University Paris Diderot, France (former)
  • LIP6, UPMC, Paris, France (former)


According to our database1, Thomas Hujsa authored at least 20 papers between 2013 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Property Directed Reachability for Generalized Petri Nets.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

2021
Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond.
Trans. Petri Nets Other Model. Concurr., 2021

2020
Checking marking reachability with the state equation in Petri net subclasses.
CoRR, 2020

On the Petri Nets with a Single Shared Place and Beyond.
CoRR, 2020

2019
Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems: A Geometric Approach.
Trans. Petri Nets Other Model. Concurr., 2019

Analysis and Synthesis of Weighted Marked Graph Petri Nets: Exact and Approximate Methods.
Fundam. Informaticae, 2019

Synthesis of Weighted Marked Graphs from Circular Labelled Transition Systems.
Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data 2019 Satellite event of the conferences: 40th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2019 and 19th International Conference on Application of Concurrency to System Design ACSD 2019, 2019

2018
Sufficient conditions for the marked graph realisability of labelled transition systems.
Theor. Comput. Sci., 2018

On Deadlockability, Liveness and Reversibility in Subclasses of Weighted Petri Nets.
Fundam. Informaticae, 2018

Proposition of an Action Layer for Electrum.
Proceedings of the Abstract State Machines, Alloy, B, TLA, VDM, and Z, 2018

Analysis and Synthesis of Weighted Marked Graph Petri Nets.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2018

Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems.
Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data 2018 Satellite event of the conferences: 39th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2018 and 18th International Conference on Application of Concurrency to System Design ACSD 2018, 2018

2017
On Liveness and Deadlockability in Subclasses of Weighted Petri Nets.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2017

2016
On Liveness and Reversibility of Equal-Conflict Petri Nets.
Fundam. Informaticae, 2016

2015
On the Reversibility of Live Equal-Conflict Petri Nets.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2015

2014
Contribution to the study of weighted Petri nets. (Contribution à l'étude des réseaux de Petri généralisés).
PhD thesis, 2014

Polynomial Sufficient Conditions of Well-Behavedness and Home Markings in Subclasses of Weighted Petri Nets.
ACM Trans. Embed. Comput. Syst., 2014

On the Reversibility of Well-Behaved Weighted Choice-Free Systems.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2014

2013
Liveness evaluation of a cyclo-static DataFlow graph.
Proceedings of the 50th Annual Design Automation Conference 2013, 2013

Polynomial Sufficient Conditions of Well-Behavedness for Weighted Join-Free and Choice-Free Systems.
Proceedings of the 13th International Conference on Application of Concurrency to System Design, 2013


  Loading...