Pages that link to "Item:Q897107"
From MaRDI portal
The following pages link to Introduction to concurrency theory. Transition systems and CCS (Q897107):
Displaying 16 items.
- Formally sound implementations of security protocols with JavaSPI (Q1707348) (← links)
- A study on team bisimulation and H-team bisimulation for BPP nets (Q2055961) (← links)
- Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves (Q2117014) (← links)
- Team equivalences for finite-state machines with silent moves (Q2216117) (← links)
- Unique solutions of contractions, CCS, and their HOL formalisation (Q2216120) (← links)
- A constraint-based language for multiparty interactions (Q2229145) (← links)
- Team bisimilarity, and its associated modal logic, for BPP nets (Q2231652) (← links)
- A calculus of concurrent graph-rewriting processes (Q2291821) (← links)
- Verification of finite-state machines: a distributed approach (Q2413026) (← links)
- Symbolic Semantics for Multiparty Interactions in the Link-Calculus (Q2971125) (← links)
- (Q3384919) (← links)
- Language Representability of Finite P/T Nets (Q3460873) (← links)
- Interleaving vs True Concurrency: Some Instructive Security Examples (Q5100754) (← links)
- A Study on Team Bisimulations for BPP Nets (Q5100755) (← links)
- Causal Semantics for BPP Nets with Silent Moves (Q5164874) (← links)
- Process calculi for biological processes (Q6062000) (← links)
