A Complete Abstract Interpretation Framework for Coverability Properties of WSTS

This publication has 16 references indexed in Scilit:

• Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS
  Lecture Notes in Computer Science, 2004
• Forward Reachability Analysis of Timed Petri Nets
  Lecture Notes in Computer Science, 2004
• FAST: Fast Acceleration of Symbolic Transition Systems
  2003
• Towards the Automated Verification of Multithreaded Java Programs
  2002
• Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol
  Lecture Notes in Computer Science, 1999
• Reset nets between decidability and undecidability
  1998
• Verifying Programs with Unreliable Channels
  Information and Computation, 1996
• A theory of timed automata
  Theoretical Computer Science, 1994
• Petri nets with marking-dependent arc cardinality: Properties and analysis
  Lecture Notes in Computer Science, 1994
• Ordering by Divisibility in Abstract Algebras
  Proceedings of the London Mathematical Society, 1952