Undecidability of bisimilarity for Petri nets and some related problems

Author： Jancar P.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.148, Iss.2, 1995-09, pp. : 281-301

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

Reachability Problems and Abstract State Spaces for Time Petri Nets with Stopwatches

By Berthomieu Bernard   Lime Didier   Roux Olivier   Vernadat François  

Discrete Event Dynamic Systems, Vol. 17, Iss. 2, 2007-06 ,pp. : 133-158

Springer Publishing Company

Access to resources Recommend Favorite

The undecidability of some equivalence problems concerning ngsm's and finite substitutions

By Turakainen P.  

Theoretical Computer Science, Vol. 174, Iss. 1, 1997-03 ,pp. : 269-274

Elsevier

Access to resources Recommend Favorite

On the composition of time Petri nets

By Peres Florent  

Discrete Event Dynamic Systems, Vol. 21, Iss. 3, 2011-09 ,pp. : 395-424

Springer Publishing Company

Access to resources Recommend Favorite

Petri nets and bisimulation

By Nielsen M.   Winskel G.  

Theoretical Computer Science, Vol. 153, Iss. 1, 1996-01 ,pp. : 211-244

Elsevier

Access to resources Recommend Favorite

Error-correcting Petri nets

By Pagnoni Anastasia  

Natural Computing, Vol. 10, Iss. 2, 2011-06 ,pp. : 711-725

Springer Publishing Company

Access to resources Recommend Favorite