External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

On the Complexity of the Linear-Time mu -calculus for Petri-Nets

Peter Habermehl. On the Complexity of the Linear-Time mu -calculus for Petri-Nets. In Pierre Azéma, Gianfranco Balbo, editors, Application and Theory of Petri Nets 1997, 18th International Conference, ICATPN 97, Toulouse, France, June 23-27, 1997, Proceedings. Volume 1248 of Lecture Notes in Computer Science, pages 102-116, Springer, 1997.

Abstract

Abstract is missing.

runs on