scientific article; zbMATH DE number 4035115
From MaRDI portal
Publication:3774929
Recommendations
- Decidability of bisimulation equivalence for process generating context-free languages
- Bisimulation equivalence is decidable for all context-free processes
- An elementary bisimulation decision procedure for arbitrary context-free processes
- Deciding bisimulation-like equivalences with finite-state processes
- Computable processes and bisimulation equivalence
- Deciding bisimulation equivalences for a class of non-finite-state programs
- Deciding bisimulation equivalences for a class of non-finite-state programs
- Decidability of branching bisimulation on normed commutative context-free processes
- Decidability of branching bisimulation on normed commutative context-free processes
- Decidability of bisimulation equivalence for normed pushdown processes
Cited in
(41)- A short proof of the decidability of bisimulation for normed BPA- processes
- Decidability of bisimulation equivalence for normed pushdown processes
- On deciding trace equivalences for processes
- Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\)
- Complete formal systems for equivalence problems
- Decidability of bisimilarity for one-counter processes.
- Bisimulation equivalence is decidable for all context-free processes
- Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
- Prototyping concurrent systems with agents and artifacts: framework and core calculus
- Decidability of bisimulation equivalence for process generating context-free languages
- Partially-Commutative Context-Free Processes
- Graphes canoniques de graphes algébriques
- Deciding Bisimilarity of Full BPA Processes Locally
- Decision procedures and graph reductions for bisimulation equivalences part 1
- Actions speak louder than words: proving bisimilarity for context-free processes
- On deciding some equivalences for concurrent processes
- Bisimulation equivalence is decidable for one-counter processes
- Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence.
- scientific article; zbMATH DE number 2102747 (Why is no real title available?)
- Context-free event domains are recognizable
- Bisimulation Equivalence of First-Order Grammars
- Partially-commutative context-free processes: expressibility and tractability
- Refining the process rewrite systems hierarchy via ground tree rewrite systems
- Pushdown automata, multiset automata, and Petri nets
- Well-structured transition systems everywhere!
- The regular viewpoint on PA-processes
- Basic process algebra with deadlocking states
- How to Parallelize sequential processes
- simpA: an agent-oriented approach for programming concurrent applications on top of Java
- Infinite results
- Decidability of bisimulation equivalence for normed pushdown processes
- Bisimulation collapse and the process taxonomy
- Silence is golden: Branching bisimilarity is decidable for context-free processes
- Polymorphic higher-order context-free session types
- System \(F^\mu_\omega\) with context-free session types
- Regularity is decidable for normed BPA and normed BPP processes in polynomial time
- Modal and temporal logics for processes
- Regularity is decidable for normed PA processes in polynomial time
- On the regular structure of prefix rewriting
- Recursive process definitions with the state operator
- Automated analysis of mutual exclusion algorithms using CCS
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3774929)
