Author： Pattinson D.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.309, Iss.1, 2003-12, pp. : 177-193
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Soundness of workflow nets: classification, decidability, and analysis
By Aalst W.
Formal Aspects of Computing, Vol. 23, Iss. 3, 2011-05 ,pp. :
Access to resources
Recommend
Duality and the completeness of the modal -calculus
By Ambler S. Kwiatkowska M. Measor N.
Theoretical Computer Science, Vol. 151, Iss. 1, 1995-11 ,pp. :
Decidability of logic program semantics and applications to testing
By Ruggieri S.
The Journal of Logic Programming, Vol. 46, Iss. 1, 2000-11 ,pp. :
Specifying Coalgebras with Modal Logic
By Kurz A.
Electronic Notes in Theoretical Computer Science, Vol. 11, Iss. 1, 2004-01 ,pp. :