Number of items: 4.
2021
Lazic, Ranko and Schmitz, Sylvain
(2021)
The ideal view on Rackoff's coverability technique.
Information and Computation, 277
.
104582.
doi:10.1016/j.ic.2020.104582
ISSN 0890-5401.
2016
Lazic, Ranko and Schmitz, Sylvain
(2016)
The complexity of coverability in ν-Petri nets.
In: 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), New York City, USA, 5–8 Jul 2016. Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
pp. 467-476.
ISBN 9781450343916.
doi:10.1145/2933575.2933593
2015
Lazic, Ranko and Schmitz, Sylvain
(2015)
The ideal view on Rackoff's coverability technique.
In: 9th International Workshop on Reachability Problems, Warsaw, Poland, 21-23 Sep 2015. Published in: Reachability Problems : 9th International Workshop, RP 2015, Warsaw, Poland, September 21-23, 2015, Proceedings, 9328
pp. 76-88.
doi:10.1007/978-3-319-24537-9_8
ISSN 0302-9743.
Jurdzinski, Marcin, Lazic, Ranko and Schmitz, Sylvain
(2015)
Fixed-dimensional energy games are in pseudo-polynomial time.
In: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, 6-10 Jul 2015. Published in: Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, 9135
pp. 260-272.
ISBN 9783662476659.
doi:10.1007/978-3-662-47666-6_21
ISSN 0302-9743.
This list was generated on Thu Mar 28 23:20:22 2024 GMT.