scientific article; zbMATH DE number 7204937
From MaRDI portal
Publication:5111633
DOI10.4230/LIPIcs.CONCUR.2017.20zbMath1442.68144MaRDI QIDQ5111633
Publication date: 27 May 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding bisimilarity is P-complete
- Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
- Process rewrite systems.
- BPA bisimilarity is EXPTIME-hard
- Decidability of branching bisimulation on normed commutative context-free processes
- Decidability of bisimulation equivalence for process generating context-free languages
- Undecidability of bisimilarity by defender's forcing
- Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME
- Branching Bisimilarity on Normed BPA Is EXPTIME-Complete
- Complexity of Weak Bisimilarity and Regularity for BPA and BPP
- On the Ehrenfeucht-Fraïssé game in theoretical computer science
- Checking Equality and Regularity for Normed BPA with Silent Moves
- Equivalence-checking on infinite-state systems: Techniques and results
- Model Checking Probabilistic Timed Automata with One or Two Clocks
This page was built for publication:
