Model checking using net unfoldings

This publication has 14 references indexed in Scilit:

• Complexity results for 1-safe nets
  Published by Springer Nature ,1993
• A solution to the covering problem for 1-bounded conflict-free Petri nets using Linear Programming
  Information Processing Letters, 1992
• Branching processes of Petri nets
  Acta Informatica, 1991
• Reasoning about networks with many identical finite state processes
  Information and Computation, 1989
• Sequential and concurrent behaviour in Petri net theory
  Theoretical Computer Science, 1987
• An O(n1.5) algorithm to decide boundedness for conflict-free vector replacement systems
  Information Processing Letters, 1987
• Automatic verification of finite-state concurrent systems using temporal logic specifications
  ACM Transactions on Programming Languages and Systems, 1986
• The temporal logic of branching time
  Acta Informatica, 1983
• Synchronisationsgraphen
  Acta Informatica, 1973
• Marked directed graphs
  Journal of Computer and System Sciences, 1971