Pages that link to "Item:Q4715674"
From MaRDI portal
The following pages link to A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes (Q4715674):
Displayed 24 items.
- Partially-commutative context-free processes: expressibility and tractability (Q532392) (← links)
- Deciding bisimulation and trace equivalences for systems with many identical processes (Q672063) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Non-interleaving bisimulation equivalences on basic parallel processes (Q1049404) (← links)
- A polynomial algorithm for deciding bisimilarity of normed context-free processes (Q1351456) (← links)
- Undecidable problems in unreliable computations. (Q1401309) (← links)
- Effective decomposability of sequential behaviours (Q1575536) (← links)
- An efficient algorithm for computing bisimulation equivalence (Q1884935) (← links)
- Complexity of deciding bisimilarity between normed BPA and normed BPP (Q1959482) (← links)
- Bisimilarity on basic parallel processes (Q2072066) (← links)
- Decidability of branching bisimulation on normed commutative context-free processes (Q2254493) (← links)
- Bisimulation and coinduction enhancements: a historical perspective (Q2280213) (← links)
- A general approach to comparing infinite-state systems with their finite-state specifications (Q2503044) (← links)
- Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes (Q3090854) (← links)
- Partially-Commutative Context-Free Processes (Q3184678) (← links)
- Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems (Q3449627) (← links)
- Selected Ideas Used for Decidability and Undecidability of Bisimilarity (Q3532999) (← links)
- Normed BPA vs. Normed BPP Revisited (Q3541036) (← links)
- Complexity of Weak Bisimilarity and Regularity for BPA and BPP (Q4917028) (← links)
- Petri nets, commutative context-free grammars, and basic parallel processes (Q5055893) (← links)
- High undecidability of weak bisimilarity for Petri nets (Q5096742) (← links)
- Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences (Q5179048) (← links)
- Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
- Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time (Q5958326) (← links)