Verification of bounded Petri nets using integer programming

ISSN： 0925-9856

Source： Formal Methods in System Design, Vol.30, Iss.2, 2007-04, pp. : 143-176

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

Implementing Coloured Petri Nets Using a Functional Programming Language

By Kristensen Lars Michael

LISP and Symbolic Computation, Vol. 17, Iss. 3, 2004-09 ,pp. : 207-243

Springer Publishing Company

Access to resources Recommend Favorite

Micropayment proposal with formal verification using coloured Petri nets and performance analysis on the Android platform

By Isern-Deyà Andreu Pere Payeras-Capellà M. Magdalena Mut-Puigserver Macià Ferrer-Gomila Josep-Lluis Huguet-Rotger Llorenç

International Journal of Business Intelligence and Data Mining, Vol. 8, Iss. 1, 2013-08 ,pp. : 74-104

Inderscience Publishers

Access to resources Recommend Favorite

Generalized Nonlinear Lagrangian Formulation for Bounded Integer Programming

By Xu Yifan Liu Chunli Li Duan

Journal of Global Optimization, Vol. 33, Iss. 2, 2005-10 ,pp. : 257-272

Springer Publishing Company

Access to resources Recommend Favorite

Control of Safe Ordinary Petri Nets Using Unfolding

By Giua Alessandro Xie Xiaolan

Discrete Event Dynamic Systems, Vol. 15, Iss. 4, 2005-12 ,pp. : 349-373

Springer Publishing Company

Access to resources Recommend Favorite

Object Petri nets marking using UML

By Bouabana-Tebibel Thouraya Méziani Lila

International Journal of Computer Applications in Technology, Vol. 47, Iss. 2-3, 2013-06 ,pp. : 162-171

Inderscience Publishers

Access to resources Recommend Favorite