The following pages link to (Q4938637):
Displayed 14 items.
- Partially-commutative context-free processes: expressibility and tractability (Q532392) (← links)
- Theory of interaction (Q896903) (← links)
- Unique parallel decomposition in branching and weak bisimulation semantics (Q896916) (← links)
- Decomposition orders -- another generalisation of the fundamental theorem of arithmetic (Q1781996) (← links)
- Complexity of deciding bisimilarity between normed BPA and normed BPP (Q1959482) (← links)
- A general approach to comparing infinite-state systems with their finite-state specifications (Q2503044) (← links)
- Decidable first-order transition logics for PA-processes (Q2575856) (← 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)
- Decidability of Weak Bisimilarity for a Subset of BPA (Q5415622) (← links)
- Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time (Q5958326) (← links)
- The regular viewpoint on PA-processes (Q5958465) (← links)