A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jcss.2017.09.004
+Normal rank
@@ Property / OpenAlex ID @@
+W1585666806
@@ Property / OpenAlex ID: W1585666806 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4251918
@@ Property / cites work: Q4251918 / rank @@
+Normal rank
@@ Property / cites work @@
+Tools and Algorithms for the Construction and Analysis of Systems
+Normal rank
@@ Property / cites work @@
+Q4551151
@@ Property / cites work: Q4551151 / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of bisimulation equivalence for process generating context-free languages
+Normal rank
@@ Property / cites work @@
+Process Algebra
@@ Property / cites work: Process Algebra / rank @@
+Normal rank
@@ Property / cites work @@
+Bisimilarity of Pushdown Automata is Nonelementary
+Normal rank
@@ Property / cites work @@
+Bisimilarity of One-Counter Processes Is PSPACE-Complete
+Normal rank
@@ Property / cites work @@
+Equivalence of deterministic one-counter automata is NL-complete
+Normal rank
@@ Property / cites work @@
+Q4535007
@@ Property / cites work: Q4535007 / rank @@
+Normal rank
@@ Property / cites work @@
+Reachability analysis of pushdown automata: Application to model-checking
+Normal rank
@@ Property / cites work @@
+Q2760246
@@ Property / cites work: Q2760246 / rank @@
+Normal rank
@@ Property / cites work @@
+An elementary bisimulation decision procedure for arbitrary context-free processes
+Normal rank
@@ Property / cites work @@
+Q4994932
@@ Property / cites work: Q4994932 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphes canoniques de graphes algébriques
@@ Property / cites work: Graphes canoniques de graphes algébriques / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding branching bisimilarity of normed context-free processes ls in \(\sum_ 2^ p\)
+Normal rank
@@ Property / cites work @@
+Bisimulation equivalence is decidable for all context-free processes
+Normal rank
@@ Property / cites work @@
+Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME
+Normal rank
@@ Property / cites work @@
+Decidability of model checking for infinite-state concurrent systems
+Normal rank
@@ Property / cites work @@
+Q2754086
@@ Property / cites work: Q2754086 / rank @@
+Normal rank
@@ Property / cites work @@
+Model checking LTL with regular valuations for pushdown systems
+Normal rank
@@ Property / cites work @@
+Q4551162
@@ Property / cites work: Q4551162 / rank @@
+Normal rank
@@ Property / cites work @@
+The inclusion problem for simple languages
@@ Property / cites work: The inclusion problem for simple languages / rank @@
+Normal rank
@@ Property / cites work @@
+Checking Equality and Regularity for Normed BPA with Silent Moves
+Normal rank
@@ Property / cites work @@
+A short proof of the decidability of bisimulation for normed BPA- processes
+Normal rank
@@ Property / cites work @@
+Branching Bisimilarity on Normed BPA Is EXPTIME-Complete
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for deciding bisimilarity of normed context-free processes
+Normal rank
@@ Property / cites work @@
+Simulation Problems Over One-Counter Nets
@@ Property / cites work: Simulation Problems Over One-Counter Nets / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+Actions speak louder than words: proving bisimilarity for context-free processes
+Normal rank
@@ Property / cites work @@
+Bisimulation Equivalence of First-Order Grammars
@@ Property / cites work: Bisimulation Equivalence of First-Order Grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Equivalences of Pushdown Systems Are Hard
@@ Property / cites work: Equivalences of Pushdown Systems Are Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q4501545
@@ Property / cites work: Q4501545 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4270051
@@ Property / cites work: Q4270051 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4496250
@@ Property / cites work: Q4496250 / rank @@
+Normal rank
@@ Property / cites work @@
+BPA bisimilarity is EXPTIME-hard
@@ Property / cites work: BPA bisimilarity is EXPTIME-hard / rank @@
+Normal rank
@@ Property / cites work @@
+On finite representations of infinite-state behaviours
+Normal rank
@@ Property / cites work @@
+The complexity of bisimilarity-checking for one-counter processes.
+Normal rank
@@ Property / cites work @@
+A Logical Viewpoint on Process-algebraic Quotients
+Normal rank
@@ Property / cites work @@
+Equivalence-checking on infinite-state systems: Techniques and results
+Normal rank
@@ Property / cites work @@
+Simulation preorder over simple process algebras
@@ Property / cites work: Simulation preorder over simple process algebras / rank @@
+Normal rank
@@ Property / cites work @@
+Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
+Normal rank
@@ Property / cites work @@
+On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
+Normal rank
@@ Property / cites work @@
+A general approach to comparing infinite-state systems with their finite-state specifications
+Normal rank
@@ Property / cites work @@
+Q4449204
@@ Property / cites work: Q4449204 / rank @@
+Normal rank
@@ Property / cites work @@
+Infinite results
@@ Property / cites work: Infinite results / rank @@
+Normal rank
@@ Property / cites work @@
+Q3907077
@@ Property / cites work: Q3907077 / rank @@
+Normal rank
@@ Property / cites work @@
+\(L(A)=L(B)\)? decidability results from complete formal systems
+Normal rank
@@ Property / cites work @@
+The Bisimulation Problem for Equational Graphs of Finite Out-Degree
+Normal rank
@@ Property / cites work @@
+Q3395948
@@ Property / cites work: Q3395948 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4484512
@@ Property / cites work: Q4484512 / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of DPDA equivalence
@@ Property / cites work: Decidability of DPDA equivalence / rank @@
+Normal rank
@@ Property / cites work @@
+Q4299862
@@ Property / cites work: Q4299862 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2760238
@@ Property / cites work: Q2760238 / rank @@
+Normal rank
@@ Property / cites work @@
+Branching time and abstraction in bisimulation semantics
+Normal rank
@@ Property / cites work @@
+Branching Bisimilarity Checking for PRS
@@ Property / cites work: Branching Bisimilarity Checking for PRS / rank @@
+Normal rank