A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
From MaRDI portal
(Redirected from Publication:2409577)
Recommendations
- scientific article; zbMATH DE number 2163034
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
- Equivalence of deterministic pushdown automata revisited
- Equivalence checking problem for finite state transducers over semigroups
- An extended direct branching algorithm for checking equivalence of deterministic pushdown automata
- On Equivalence Checking of Nondeterministic Finite Automata
- scientific article; zbMATH DE number 1929958
- Reachability analysis of pushdown automata: Application to model-checking
- Equivalence of pushdown automata via first-order grammars
- A direct branching algorithm for checking equivalence of some classes of deterministic pushdown automata
Cites work
- scientific article; zbMATH DE number 1670780 (Why is no real title available?)
- scientific article; zbMATH DE number 5604065 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 1304996 (Why is no real title available?)
- scientific article; zbMATH DE number 1361117 (Why is no real title available?)
- scientific article; zbMATH DE number 604884 (Why is no real title available?)
- scientific article; zbMATH DE number 2038739 (Why is no real title available?)
- scientific article; zbMATH DE number 1927587 (Why is no real title available?)
- scientific article; zbMATH DE number 1490007 (Why is no real title available?)
- scientific article; zbMATH DE number 1500527 (Why is no real title available?)
- scientific article; zbMATH DE number 1754582 (Why is no real title available?)
- scientific article; zbMATH DE number 1796135 (Why is no real title available?)
- scientific article; zbMATH DE number 1796143 (Why is no real title available?)
- scientific article; zbMATH DE number 7361952 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- A Logical Viewpoint on Process-algebraic Quotients
- A general approach to comparing infinite-state systems with their finite-state specifications
- A polynomial algorithm for deciding bisimilarity of normed context-free processes
- A short proof of the decidability of bisimulation for normed BPA- processes
- Actions speak louder than words: proving bisimilarity for context-free processes
- An elementary bisimulation decision procedure for arbitrary context-free processes
- BPA bisimilarity is EXPTIME-hard
- Bisimilarity of one-counter processes is PSPACE-complete
- Bisimilarity of pushdown automata is nonelementary
- Bisimulation Equivalence of First-Order Grammars
- Bisimulation equivalence is decidable for all context-free processes
- Branching bisimilarity checking for PRS
- Branching bisimilarity of normed BPA processes is in NExpTime
- Branching bisimilarity on normed BPA is EXPTIME-complete
- Branching time and abstraction in bisimulation semantics
- Checking equality and regularity for normed BPA with silent moves
- Decidability of DPDA equivalence
- Decidability of bisimulation equivalence for process generating context-free languages
- Decidability of model checking for infinite-state concurrent systems
- Deciding branching bisimilarity of normed context-free processes ls in \(\sum_ 2^ p\)
- Equivalence of deterministic one-counter automata is NL-complete
- Equivalence-checking on infinite-state systems: Techniques and results
- Equivalences of Pushdown Systems Are Hard
- Graphes canoniques de graphes algébriques
- Infinite results
- Model checking LTL with regular valuations for pushdown systems
- On finite representations of infinite-state behaviours
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
- Process Algebra
- Reachability analysis of pushdown automata: Application to model-checking
- Simulation preorder over simple process algebras
- Simulation problems over one-counter nets
- The Bisimulation Problem for Equational Graphs of Finite Out-Degree
- The complexity of bisimilarity-checking for one-counter processes.
- The inclusion problem for simple languages
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
- Tools and Algorithms for the Construction and Analysis of Systems
- Verification on infinite structures.
- Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
- \(L(A)=L(B)\)? decidability results from complete formal systems
Cited in
(8)- Generalizations of checking stack automata: characterizations and hierarchies
- scientific article; zbMATH DE number 2163034 (Why is no real title available?)
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
- A direct branching algorithm for checking equivalence of some classes of deterministic pushdown automata
- Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems
- Model-checking process equivalences
- Model-checking process equivalences
- scientific article; zbMATH DE number 1929958 (Why is no real title available?)
This page was built for publication: A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2409577)
