Complexity Results for POMSET Languages

This publication has 14 references indexed in Scilit:

• Using partial orders to improve automatic verification methods
  Published by Springer Nature ,2005
• Using partial-order semantics to avoid the state explosion problem in asynchronous systems
  Published by Springer Nature ,2005
• Symbolic model checking: 1020 States and beyond
  Published by Elsevier ,2004
• Polynomial-time 1-Turing reductions from #PH to #P
  Theoretical Computer Science, 1992
• Counting linear extensions
  Order, 1991
• Timing assumptions and verification of finite-state concurrent systems
  Published by Springer Nature ,1990
• Reasoning about networks with many identical finite state processes
  Information and Computation, 1989
• The complementation problem for Büchi automata with applications to temporal logic
  Theoretical Computer Science, 1987
• Modeling concurrency with partial orders
  International Journal of Parallel Programming, 1986
• The complexity of computing the permanent
  Theoretical Computer Science, 1979