@inproceedings{d395495ed8ff40c0b7f6ff7693aa6b51,
title = "Model Checking with Finite Complete Prefixes is PSPACE-Complete",
keywords = "net unfoldings, PSPACE-completeness, temporal logics, net unfoldings, PSPACE-completeness, temporal logics, net unfoldings, PSPACE-completeness, temporal logics",
author = "K. Heljanko",
year = "2000",
language = "English",
pages = "108--122",
editor = "C. Palamidessi",
booktitle = "The 11th International Conference on Concurrency Theory, CONCUR 2000, University Park PA, USA, August 2000",
}