The following pages link to Matthew C. B. Hennessy (Q1138390):
Displaying 50 items.
- The security picalculus and non-interference (extended abstract) (Q276474) (← links)
- (Q456465) (redirect page) (← links)
- First-order reasoning for higher-order concurrency (Q456466) (← links)
- Observing localities (Q685414) (← links)
- Communicating processes with value-passing and assignments (Q688827) (← links)
- Priorities in process algebras (Q802881) (← links)
- Adding recursion to Dpi (Q877023) (← links)
- A theory of system behaviour in the presence of node and link failure (Q939442) (← links)
- Axiomatising finite delay operators (Q1055190) (← links)
- An algebraic theory of fair asynchronous communicating processes (Q1088403) (← links)
- A proof system for the first-order relational calculus (Q1138391) (← links)
- A mathematical semantics for a nondeterministic typed lambda-calculus (Q1152949) (← links)
- A proof system for communicating processes with value-passing (Q1179808) (← links)
- Full abstractness for a functional/concurrent language with higher-order value-passing (Q1271466) (← links)
- Bisimulations for a calculus of broadcasting systems (Q1276256) (← links)
- A behavioural theory of first-order CML (Q1285654) (← links)
- A theory of communicating processes with value passing (Q1317426) (← links)
- An efficiency preorder for processes (Q1323358) (← links)
- A fully abstract denotational model for higher-order processes (Q1327390) (← links)
- A theory of processes with localities (Q1329198) (← links)
- Adding action refinement to a finite process algebra (Q1342519) (← links)
- Testing equivalences for processes (Q1348526) (← links)
- A fully abstract denotational semantics for the \(\pi\)-calculus (Q1605174) (← links)
- Distinguishing between communicating transactions (Q1706141) (← links)
- The security pi-calculus and non-interference (Q1772311) (← links)
- Trust and partial typing in open systems of mobile agents (Q1826471) (← links)
- Resource access control in systems of mobile agents (Q1854507) (← links)
- Assigning types to processes (Q1854525) (← links)
- Towards a behavioural theory of access and mobility control in distributed systems (Q1881259) (← links)
- A process algebra for timed systems (Q1892877) (← links)
- A modal logic for message passing processes (Q1894680) (← links)
- Concurrent testing of processes (Q1902297) (← links)
- Exploring probabilistic bisimulations. I (Q1941884) (← links)
- On the semantics of Markov automata (Q1951578) (← links)
- Towards action-refinement in process algebras (Q2365760) (← links)
- Testing equivalence as a bisimulation equivalence (Q2366163) (← links)
- Real-reward testing for probabilistic processes (Q2453107) (← links)
- safeDpi: a language for controlling mobile code (Q2581010) (← links)
- A theory for observational fault tolerance (Q2643332) (← links)
- (Q2754161) (← links)
- A theory of weak bisimulation for core CML (Q2817698) (← links)
- Typed behavioural equivalences for processes in the presence of subtyping (Q2841263) (← links)
- Mutually Testing Processes (Q2842097) (← links)
- Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation (Q2842104) (← links)
- Modelling Probabilistic Wireless Networks (Q2848371) (← links)
- (Q2848667) (← links)
- (Q2852098) (← links)
- Remarks on Testing Probabilistic Processes (Q2864156) (← links)
- Compositional Reasoning for Markov Decision Processes (Q2894560) (← links)
- Uniqueness typing for resource management in message-passing concurrency (Q2937684) (← links)