CV Accueil - Archive ouverte HAL

	The ideal view on Rackoff's coverability technique Ranko Lazić , Sylvain Schmitz Information and Computation, 2021, 277, pp.104582. ⟨10.1016/j.ic.2020.104582⟩ Article dans une revue hal-03440102v1
	Non-Elementary Complexities for Branching VASS, MELL, and Extensions Ranko Lazić , Sylvain Schmitz ACM Transactions on Computational Logic, 2015, 16 (3:20), pp.1--30. ⟨10.1145/2733375⟩ Article dans une revue hal-01168290v1

	Perfect Half-Space Games Thomas Colcombet , Marcin Jurdzinski , Ranko Lazić , Sylvain Schmitz Logic in Computer Science, 2017, Reykjavik, Iceland. ⟨10.1109/LICS.2017.8005105⟩ Communication dans un congrès hal-01633355v1
	Coverability Trees for Petri Nets with Unordered Data Piotr Hofman , Sławomir Lasota , Ranko Lazić , Jérôme Leroux , Sylvain Schmitz FoSSaCS, 2016, Eindhoven, Netherlands. pp.445--461, ⟨10.1007/978-3-662-49630-5_26⟩ Communication dans un congrès hal-01252674v1
	The Complexity of Coverability in ν-Petri Nets Ranko Lazić , Sylvain Schmitz LICS 2016 - 31th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2016, New York, United States. pp.467--476, ⟨10.1145/2933575.2933593⟩ Communication dans un congrès hal-01265302v2
	The Ideal View on Rackoff's Coverability Technique Ranko Lazić , Sylvain Schmitz RP 2015 - 9th International Workshop on Reachability Problems, Sep 2015, Warsaw, Poland. pp.1--13, ⟨10.1007/978-3-319-24537-9_8⟩ Communication dans un congrès hal-01176755v3
	Fixed-dimensional energy games are in pseudo-polynomial time Marcin Jurdzinski , Ranko Lazić , Sylvain Schmitz ICALP 2015: Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming, Jul 2015, Kyoto, Japan. pp.260--272, ⟨10.1007/978-3-662-47666-6_21⟩ Communication dans un congrès hal-01168300v1

Sylvain Schmitz