On the Decidability of Model Checking for Several [mu]-calculi and Petri Nets

LFCS, Department of Computer Science, University of Edinburgh (1993)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 105,261

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Completeness results for linear logic on Petri nets.Uffe Engberg & Glynn Winskel - 1997 - Annals of Pure and Applied Logic 86 (2):101-135.
Coloured petri nets: modelling and validation of concurrent systems.K. Jensen - 2009 - New York: Springer. Edited by Lars M. Kristensen.
Propositional dynamic logic for Petri nets.B. Lopes, M. Benevides & E. H. Haeusler - 2014 - Logic Journal of the IGPL 22 (5):721-736.
The completeness of linear logic for Petri net models.K. Ishihara & K. Hiraishi - 2001 - Logic Journal of the IGPL 9 (4):549-567.
The Box Calculus: A New Causal Algebra with Multilabel Communication.Eike Best & Jon G. Hall - 1991 - University of Newcastle Upon Tyne, Computing Laboratory.
Well (and better) quasi-ordered transition systems.Parosh Aziz Abdulla - 2010 - Bulletin of Symbolic Logic 16 (4):457-515.

Analytics

Added to PP
2015-02-03

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

References found in this work

No references found.

Add more references