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

DOI10.1016/J.IPL.2009.04.003zbMATH Open1205.68246OpenAlexW2029953169MaRDI QIDQ989507FDOQ989507

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

Recommendations

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

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)

Cites Work

• The covering and boundedness problems for vector addition systems
• Title not available (Why is that?)
• On the complexity of the linear-time μ-calculus for Petri Nets
• Complexity of equivalence problems for concurrent systems of finite agents
• A lower bound on web services composition
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• High undecidability of weak bisimilarity for Petri nets
• Simulation preorder over simple process algebras
• Strong bisimilarity of simple process algebras: Complexity lower bounds
• Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time
• CONCUR 2003 - Concurrency Theory

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)