Pages that link to "Item:Q1205185"
From MaRDI portal
The following pages link to An algebraic verification of a mobile network (Q1205185):
Displaying 10 items.
- Type inference and strong static type checking for Promela (Q988201) (← links)
- On the decidability of process equivalences for the \(\pi\)-calculus (Q1391099) (← links)
- Names of the \(\pi\)-calculus agents handled locally (Q1589648) (← links)
- Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types (Q1770362) (← links)
- A partition refinement algorithm for the \(\pi\)-calculus (Q1854406) (← links)
- A process calculus BigrTiMo of mobile systems and its formal semantics (Q2026376) (← links)
- Basic observables for a calculus for global computing (Q2384924) (← links)
- (Q2851053) (← links)
- On the decidability of process equivalences for the π-calculus (Q5096384) (← links)
- A Practical Approach to Verification of Mobile Systems Using Net Unfoldings (Q5900141) (← links)
