General parameterised refinement and recursion for the M-net calculus

Author： Devillers R.   Klaudel H.   Riemann R.-C.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.300, Iss.1, 2003-05, pp. : 259-300

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Coloured Petri net refinement specification and correctness proof with Coq

By Choppy Christine  

Innovations in Systems and Software Engineering, Vol. 6, Iss. 3, 2010-09 ,pp. : 195-202

Springer Publishing Company

Access to resources Recommend Favorite

A Sufficient Condition for Reachability in a General Petri Net

By Ramachandran Parthasarathy   Kamath Manjunath  

Discrete Event Dynamic Systems, Vol. 14, Iss. 3, 2004-07 ,pp. : 251-266

Springer Publishing Company

Access to resources Recommend Favorite

Blissfully ignorant: the effects of general privacy concerns, general institutional trust, and affect in the privacy calculus

By  

INFORMATION SYSTEMS JOURNAL, Vol. 25, Iss. 6, 2015-11 ,pp. : 607-635

John Wiley & Sons Inc

Access to resources Recommend Favorite

Blissfully ignorant: the effects of general privacy concerns, general institutional trust, and affect in the privacy calculus

By  

INFORMATION SYSTEMS JOURNAL, Vol. 1350-1917, Iss. 6, 2015-11 ,pp. : 607-635

John Wiley & Sons Inc

Access to resources Recommend Favorite

Advanced STEP parameterised and constrained features for reverse engineering

By Remy Sebastien   Ducellier Guillaume   Charles Sebastien   Eynard Benoit  

International Journal of Computer Applications in Technology, Vol. 32, Iss. 1, 2008-07 ,pp. : 1-11

Inderscience Publishers

Access to resources Recommend Favorite