@InProceedings{   finkel:hal-02479879,
  Author        = "Finkel, Alain and Haddad, Serge and Khmelnitsky, Igor",
  Address       = "Dublin, Ireland",
  BookTitle     = "{FoSSaCS 2020 - 23rd International Conference on Foundations of Software Science and Computation Structures}",
  date-added    = "2020-03-16 15:39:09 +0100",
  date-modified = "2020-03-16 15:39:09 +0100",
  hal_id        = "hal-02479879",
  hal_version   = "v1",
  Keywords      = "Minimal coverability set ; Coverability ; Petri nets ; Karp-Miller tree algorithm ; Clover ; Minimal coverability tree",
  Month         = "April",
  PDF           = "https://hal.inria.fr/hal-02479879/file/main.pdf",
  Title         = "{Minimal Coverability Tree Construction Made Complete and Efficient}",
  URL           = "https://hal.inria.fr/hal-02479879",
  Year          = "2020",
  bdsk-url-1    = "https://hal.inria.fr/hal-02479879",
  File          = "Minimal Coverability Tree Construction Made Complete and Efficient - a - a - a - j.pdf"
}

@InProceedings{ finkel:hal-02479879, Author = "Finkel, Alain and Haddad, Serge and Khmelnitsky, Igor", Address = "Dublin, Ireland", BookTitle = "{FoSSaCS 2020 - 23rd International Conference on Foundations of Software Science and Computation Structures}", date-added = "2020-03-16 15:39:09 +0100", date-modified = "2020-03-16 15:39:09 +0100", hal_id = "hal-02479879", hal_version = "v1", Keywords = "Minimal coverability set ; Coverability ; Petri nets ; Karp-Miller tree algorithm ; Clover ; Minimal coverability tree", Month = "April", PDF = "https://hal.inria.fr/hal-02479879/file/main.pdf", Title = "{Minimal Coverability Tree Construction Made Complete and Efficient}", URL = "https://hal.inria.fr/hal-02479879", Year = "2020", bdsk-url-1 = "https://hal.inria.fr/hal-02479879", File = "Minimal Coverability Tree Construction Made Complete and Efficient - a - a - a - j.pdf" }

Library Size: 13G (12941 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A badge