The complexity of bisimilarity-checking for one-counter processes.
type: Item
instance of: scholarly article
title: The complexity of bisimilarity-checking for one-counter processes.
zbMATH Open document ID: 1044.68099
DOI: 10.1016/S0304-3975(03)00081-1
author: Antonin Kučera
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 1965394
zbMATH Keywords: One-counter automata
zbMATH Keywords: One-counter nets
zbMATH Keywords: Bisimilarity
MaRDI profile type: Publication
cites work: Q4251918
cites work: On the computational power of pushdown automata
cites work: Q4888749
cites work: Decidability of bisimulation equivalence for process generating context-free languages
cites work: Process Algebra
cites work: An efficient automata approach to some problems on context-free grammars.
cites work: Reachability analysis of pushdown automata: Application to model-checking
cites work: Verification on infinite structures.
cites work: An elementary bisimulation decision procedure for arbitrary context-free processes
cites work: Graphes canoniques de graphes algébriques
cites work: Bisimulation equivalence is decidable for all context-free processes
cites work: Q4385542
cites work: Q2754086
cites work: Q5714447
cites work: Q4371017
cites work: A short proof of the decidability of bisimulation for normed BPA- processes
cites work: Undecidable equivalences for basic process algebra
cites work: A polynomial algorithm for deciding bisimilarity of normed context-free processes
cites work: Q5592246
cites work: Actions speak louder than words: proving bisimilarity for context-free processes
cites work: Decidability of bisimilarity for one-counter processes.
cites work: Deciding bisimulation-like equivalences with finite-state processes
cites work: Q4501545
cites work: Q4738225
cites work: Q4496250
cites work: Q2766532
cites work: Q4708592
cites work: Simulation preorder over simple process algebras
cites work: Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
cites work: Q4536443
cites work: Process rewrite systems.
cites work: Q3992568
cites work: Q4298260
cites work: Q3907077
cites work: Q3219122
cites work: Q4737202
cites work: Q4484512
cites work: Characteristic formulae for processes with divergence
cites work: Decidability of bisimulation equivalence for normed pushdown processes
cites work: The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
cites work: Q4472439
full work available at URL: s0304-3975(03)00081-1
OpenAlex ID: W2161891404
description: scientific article; zbMATH DE number 1965394