Bisimilarity on basic parallel processes
type: Item
instance of: scholarly article
title: Bisimilarity on basic parallel processes
author: Petr Jančar
published in: Theoretical Computer Science
publication date: 2022-02-01T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7467467
zbMATH Keywords: verification
zbMATH Keywords: concurrency
zbMATH Keywords: equivalence checking
zbMATH Keywords: bisimulation equivalence
zbMATH Keywords: basic parallel processes
MaRDI profile type: Publication
full work available at URL: j.tcs.2021.11.027
OpenAlex ID: W4200416319
cites work: Q4736869
cites work: Strong bisimilarity of simple process algebras: Complexity lower bounds
cites work: Q3992568
cites work: Three Partition Refinement Algorithms
cites work: CCS expressions, finite state processes, and three problems of equivalence
cites work: Deciding bisimilarity is P-complete
cites work: Decidability of bisimulation equivalence for process generating context-free languages
cites work: Verification on infinite structures.
cites work: Q4665738
cites work: A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
cites work: Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences
cites work: Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time
cites work: Checking Equality and Regularity for Normed BPA with Silent Moves
cites work: Process rewrite systems.
cites work: Q4353915
cites work: Decidability of branching bisimulation on normed commutative context-free processes
cites work: Branching time and abstraction in bisimulation semantics
cites work: Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
cites work: Q5111633
cites work: Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME
cites work: Branching Bisimilarity on Normed BPA Is EXPTIME-Complete
cites work: Q4596795
cites work: BPA bisimilarity is EXPTIME-hard
cites work: An elementary bisimulation decision procedure for arbitrary context-free processes
cites work: Bisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof)
DOI: 10.1016/J.TCS.2021.11.027
description: scientific article; zbMATH DE number 7467467