The following pages link to (Q3774929):
Displaying 37 items.
- Partially-commutative context-free processes: expressibility and tractability (Q532392) (← links)
- simpA: an agent-oriented approach for programming concurrent applications on top of Java (Q608358) (← links)
- On the regular structure of prefix rewriting (Q685354) (← links)
- Recursive process definitions with the state operator (Q758198) (← links)
- Automated analysis of mutual exclusion algorithms using CCS (Q911263) (← links)
- A short proof of the decidability of bisimulation for normed BPA- processes (Q1198053) (← links)
- Decidability of bisimulation equivalence for normed pushdown processes (Q1276237) (← links)
- On deciding trace equivalences for processes (Q1310916) (← links)
- Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\) (Q1314379) (← links)
- Complete formal systems for equivalence problems (Q1575907) (← links)
- Decidability of bisimilarity for one-counter processes. (Q1854338) (← links)
- Bisimulation equivalence is decidable for all context-free processes (Q1899906) (← links)
- Weak bisimilarity and regularity of context-free processes is EXPTIME-hard (Q2847410) (← links)
- Prototyping concurrent systems with agents and artifacts: framework and core calculus (Q2866321) (← links)
- Graphes canoniques de graphes algébriques (Q3479542) (← links)
- Deciding Bisimilarity of Full BPA Processes Locally (Q3540084) (← links)
- Decision procedures and graph reductions for bisimulation equivalences part 1 (Q4203808) (← links)
- Actions speak louder than words: proving bisimilarity for context-free processes (Q4209294) (← links)
- On deciding some equivalences for concurrent processes (Q4362275) (← links)
- Bisimulation equivalence is decidable for one-counter processes (Q4571985) (← links)
- Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence. (Q4608615) (← links)
- (Q4818834) (← links)
- Context-free event domains are recognizable (Q5096387) (← links)
- Bisimulation Equivalence of First-Order Grammars (Q5167841) (← links)
- Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems (Q5894255) (← links)
- Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
- Well-structured transition systems everywhere! (Q5941101) (← links)
- The regular viewpoint on PA-processes (Q5958465) (← links)
- Basic process algebra with deadlocking states (Q5958771) (← links)
- How to Parallelize sequential processes (Q6044125) (← links)
- Infinite results (Q6104374) (← links)
- Bisimulation collapse and the process taxonomy (Q6104377) (← links)
- Polymorphic higher-order context-free session types (Q6499549) (← links)
- System \(F^\mu_\omega\) with context-free session types (Q6535246) (← links)
- Regularity is decidable for normed BPA and normed BPP processes in polynomial time (Q6560192) (← links)
- Modal and temporal logics for processes (Q6560391) (← links)
- Regularity is decidable for normed PA processes in polynomial time (Q6567761) (← links)
