EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system

DOI10.1016/J.IPL.2009.04.003MaRDI QIDQ989507zbMATH OpenOpenAlexFDO

Authors Sławomir Lasota

Publication date 20 August 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2009.04.003

zbMATH Keywords

concurrencyPetri netBPP-netsimulation preorder and equivalencetrace preorder and equivalence

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Simulation preorder over simple process algebras
• Simulation over one-counter nets is PSPACE-complete
• scientific article; zbMATH DE number 1304996
• scientific article; zbMATH DE number 1512618
• scientific article; zbMATH DE number 1696434

Cites work

• scientific article; zbMATH DE number 1927561 (Why is no real title available?)
• scientific article; zbMATH DE number 1927588 (Why is no real title available?)
• scientific article; zbMATH DE number 1512618 (Why is no real title available?)
• scientific article; zbMATH DE number 2102770 (Why is no real title available?)
• A lower bound on web services composition
• Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time
• Complexity of equivalence problems for concurrent systems of finite agents
• Equivalence checking of non-flat systems is EXPTIME-hard.
• High undecidability of weak bisimilarity for Petri nets
• On the complexity of the linear-time μ-calculus for Petri Nets
• Simulation preorder over simple process algebras
• Strong bisimilarity of simple process algebras: Complexity lower bounds
• The covering and boundedness problems for vector addition systems

Cited in

(1)

• Flatness and Complexity of Immediate Observation Petri Nets

This page was built for publication: EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989507)