Undecidability of performance equivalence of Petri nets

Details Undecidability of performance equivalence of Petri nets Undecidability of performance equivalence of Petri nets

2009-10-30

arxiv.org/abs/0910.5819v1

Computer Science

Computational Complexity

Scientific paper

We investigate bisimulation equivalence on Petri nets under durational semantics. Our motivation was to verify the conjecture that in durational setting, the bisimulation equivalence checking problem becomes more tractable (which is the case, e.g., over communication-free nets). We disprove this conjecture in three of four proposed variants of durational semantics. The fourth case remains an interesting open problem.

Affiliated with

Also associated with

No associations

Rating

Undecidability of performance equivalence of Petri nets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Undecidability of performance equivalence of Petri nets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Undecidability of performance equivalence of Petri nets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-89408