×

Hennessy, Matthew C. B.

Compute Distance To:
Author ID: hennessy.matthew-c-b Recent zbMATH articles by "Hennessy, Matthew C. B."
Published as: Hennessy, Matthew; Hennessy, M.; Hennessy, M. C. B.; Hennessy, Matthew C. B.; Henessy, Matthew
Homepage: https://www.scss.tcd.ie/Matthew.Hennessy
External Links: MGP · Wikidata · Google Scholar · dblp · IdRef

Publications by Year

Citations contained in zbMATH Open

111 Publications have been cited 1,957 times in 1,155 Documents Cited by Year
Algebraic laws for nondeterminism and concurrency. Zbl 0629.68021
Hennessy, Matthew; Milner, Robin
308
1985
Testing equivalences for processes. Zbl 0985.68518
De Nicola, R.; Hennessy, M. C. B.
245
1984
Algebraic theory of processes. Zbl 0744.68047
Hennessy, Matthew
140
1988
Symbolic bisimulations. Zbl 0874.68187
Hennessy, M.; Lin, H.
64
1995
A process algebra for timed systems. Zbl 0826.68068
Hennessy, Matthew; Regan, Tim
63
1995
Full abstraction for a simple parallel programming language. Zbl 0457.68006
Hennessy, M. C. B.; Plotkin, G. D.
61
1979
On observing nondeterminism and concurrency. Zbl 0441.68018
Hennessy, Matthew; Milner, Robin
54
1980
Resource access control in systems of mobile agents. Zbl 1009.68081
Hennessy, Matthew; Riely, James
42
2002
An efficiency preorder for processes. Zbl 0790.68039
Arun-Kumar, S.; Hennessy, M.
40
1992
Characterising testing preorders for finite probabilistic processes. Zbl 1161.68035
Deng, Yuxin; van Glabbeek, Robert J.; Hennessy, Matthew; Morgan, Carroll C.
34
2008
Termination, deadlock, and divergence. Zbl 0799.68131
Aceto, L.; Hennessy, M.
33
1992
A distributed pi-calculus. Zbl 1125.68082
Hennessy, Matthew
32
2007
Testing equivalence as a bisimulation equivalence. Zbl 0797.68058
Cleaveland, Rance; Hennessy, Matthew
30
1993
Priorities in process algebras. Zbl 0726.68053
Cleaveland, Rance; Hennessy, Matthew
28
1990
Acceptance trees. Zbl 0633.68074
Hennessy, M.
28
1985
A theory of processes with localities. Zbl 0806.68070
Boudol, G.; Castellani, I.; Hennessy, M.; Kiehn, A.
25
1994
A term model for synchronous processes. Zbl 0503.68022
Hennessy, Matthew
24
1981
Bisimulation congruences in safe ambients. Zbl 1323.68412
Merro, Massimo; Hennessy, Matthew
23
2002
Testing finitary probabilistic processes (extended abstract). Zbl 1254.68166
Deng, Yuxin; van Glabbeek, Rob; Hennessy, Matthew; Morgan, Carroll
23
2009
A theory of communicating processes with value passing. Zbl 0794.68098
Hennessy, M.; Ingólfsdóttir, A.
22
1993
Distributed bisimulations. Zbl 0697.68076
Castellani, Ilaria; Hennessy, Matthew
20
1989
The semantics of call-by-value and call-by-name in a nondeterministic environment. Zbl 0437.68002
Hennessy, M. C. B.
20
1980
The semantics of programming languages. An elementary introduction using structural operational semantics. Zbl 0723.68067
Hennessy, Matthew
18
1990
A fully abstract denotational model for higher-order processes. Zbl 0806.68071
Hennessy, M.
18
1994
A term model for CCS. Zbl 0479.68011
Hennessy, M. C. B.; Plotkin, G. D.
18
1980
Observing localities. Zbl 0783.68072
Boudol, G.; Castellani, I.; Hennessy, M.; Kiehn, A.
17
1993
Resource access control in systems of mobile agents. Zbl 0917.68047
Hennessy, M.; Riely, J.
16
1998
On the semantics of Markov automata. Zbl 1286.68362
Deng, Yuxin; Hennessy, Matthew
15
2013
Communicating transactions (extended abstract). Zbl 1287.68018
de Vries, Edsko; Koutavas, Vasileios; Hennessy, Matthew
15
2010
Exploring probabilistic bisimulations. I. Zbl 1259.68153
Hennessy, Matthew
15
2012
Towards action-refinement in process algebras. Zbl 0779.68028
Aceto, L.; Hennessy, M.
14
1993
Axiomatising finite concurrent processes. Zbl 0666.68024
Hennessy, Matthew
14
1988
The power of the future perfect in program logics. Zbl 0582.68010
Hennessy, Matthew; Stirling, Colin
14
1985
Proof systems for message-passing process algebras. Zbl 0857.68040
Hennessy, M.; Lin, H.
13
1996
Adding action refinement to a finite process algebra. Zbl 0834.68077
Aceto, L.; Hennessy, M.
13
1994
A proof system for communicating processes with value-passing. Zbl 0736.68057
Hennessy, M.
12
1991
Bisimulations for a calculus of broadcasting systems. Zbl 0915.68065
Hennessy, M.; Rathke, J.
12
1998
Trust and partial typing in open systems of mobile agents. Zbl 1069.68076
Riely, James; Hennessy, Matthew
12
2003
Information flow vs. resource access in the asynchronous pi-calculus. (Extended abstract). Zbl 0973.68519
Hennessy, Matthew; Riely, James
12
2000
Distributed processes and location failures. Zbl 0989.68007
Riely, J.; Hennessy, M.
12
2001
Typed behavioural equivalences for processes in the presence of subtyping. Zbl 1093.68062
Henessy, Matthew; Rathke, Julian
11
2004
Towards a behavioural theory of access and mobility control in distributed systems. Zbl 1071.68009
Hennessy, Matthew; Merro, Massimo; Rathke, Julian
10
2004
Using higher-order contracts to model session types. Zbl 1448.68329
Bernardi, Giovanni; Hennessy, Matthew
10
2016
A fully abstract denotational semantics for the \(\pi\)-calculus. Zbl 1014.68105
Hennessy, Matthew
10
2002
Remarks on testing probabilistic processes. Zbl 1277.68121
Deng, Yuxin; Van Glabbeek, Rob; Hennessy, Matthew; Morgan, Carroll; Zhang, Chenyi
10
2007
A mathematical semantics for a nondeterministic typed lambda-calculus. Zbl 0462.68006
Hennessy, M. C. B.; Ashcroft, E. A.
10
1980
Towards action-refinement in process algebras. Zbl 0716.68034
Aceto, L.; Hennessy, M.
9
1989
Observing localities. (Extended abstract). Zbl 0778.68055
Boudol, G.; Castellani, I.; Hennessy, M.; Kiehn, A.
8
1991
Modelling session types using contracts. Zbl 1361.68160
Bernardi, Giovanni; Hennessy, Matthew
8
2016
Assigning types to processes. Zbl 1009.68085
Yoshida, Nobuko; Hennessy, Matthew
8
2002
safeDpi: a language for controlling mobile code. Zbl 1081.68003
Hennessy, Matthew; Rathke, Julian; Yoshida, Nobuko
8
2005
The semantics of nondeterminism. Zbl 0379.02015
Hennessy, M.; Ashcroft, E. A.
8
1976
Testing equivalences for processes. Zbl 0515.68029
de Nicola, R.; Hennessy, M. C. B.
8
1983
Axiomatising finite delay operators. Zbl 0521.68047
Hennessy, Matthew
8
1984
Synchronous and asynchronous experiments on processes. Zbl 0544.68028
Hennessy, M.
8
1983
A theory of system behaviour in the presence of node and link failures (extended abstract). Zbl 1134.68340
Francalanza, Adrian; Hennessy, Matthew
8
2005
An algebraic theory of fair asynchronous communicating processes. Zbl 0612.68026
Hennessy, Matthew
8
1987
CCS without \(\tau\) ’s. Zbl 0614.68025
De Nicola, Rocco; Hennessy, Matthew
8
1987
Communicating processes with value-passing and assignments. Zbl 0784.68055
Hennessy, M.; Ingólfsdóttir, A.
7
1993
Powerdomains and nondeterministic recursive definitions. Zbl 0486.68009
Hennessy, M. C. B.
7
1982
A theory of system behaviour in the presence of node and link failure. Zbl 1152.68037
Francalanza, Adrian; Hennessy, Matthew
6
2008
Subtyping and locality in distributed higher order processes. Zbl 0940.68024
Yoshida, Nobuko; Hennessy, Matthew
6
1999
On the semantics of Markov automata. Zbl 1333.68162
Deng, Yuxin; Hennessy, Matthew
6
2011
A proof system for the first-order relational calculus. Zbl 0431.68084
Hennessy, Matthew C. B.
6
1980
A theory for observational fault tolerance. Zbl 1123.68080
Francalanza, Adrian; Hennessy, Matthew
6
2007
Bisimulations for communicating transactions (extended abstract). Zbl 1405.68215
Koutavas, Vasileios; Spaccasassi, Carlo; Hennessy, Matthew
6
2014
Adding action refinement to a finite process algebra. Zbl 0786.68055
Aceto, Luca; Hennessy, Matthew
5
1991
A theory of weak bisimulation for core CML. Zbl 0916.68093
Ferreira, William; Hennessy, Matthew; Jeffrey, Alan
5
1998
Security policies as membranes in systems for global computing. Zbl 1272.68062
Gorla, Daniele; Hennessy, Matthew; Sassone, Vladimiro
5
2005
Concurrent testing of processes. Zbl 0835.68074
Hennessy, M.
5
1995
A theory of weak bisimulation for core CML. Zbl 1345.68049
Ferreira, William; Hennessy, Matthew; Jeffrey, Alan
5
1996
Modelling MAC-layer communications in wireless systems. Zbl 1395.94007
Cerone, Andrea; Hennessy, Matthew; Merro, Massimo
5
2015
Counting the cost in the picalculus (extended abstract). Zbl 1291.68288
Hennessy, Matthew; Gaur, Manish
5
2009
The security pi-calculus and non-interference. Zbl 1067.68096
Hennessy, Matthew
5
2005
A calculus for costed computations. Zbl 1213.68403
Hennessy, Matthew
5
2011
First-order reasoning for higher-order concurrency. Zbl 1248.68355
Koutavas, Vasileios; Hennessy, Matthew
5
2012
A modal logic for message passing processes. Zbl 0827.68102
Hennessy, M.; Liu, Xin Xin
5
1995
Finite conjunctive nondeterminism. Zbl 0649.03013
Hennessy, M.; Plotkin, G.
5
1987
Proving systolic systems correct. Zbl 0598.68030
Hennessy, Matthew
5
1986
Typed behavioural equivalences for processes in the presence of subtyping. Zbl 1268.68127
Hennessy, Matthew; Rathke, Julian
4
2002
Using higher-order contracts to model session types (extended abstract). Zbl 1417.68116
Bernardi, Giovanni; Hennessy, Matthew
4
2014
The power of the future perfect in program logics. Zbl 0557.68029
Hennessy, M.; Stirling, C.
4
1984
A fault tolerance bisimulation proof for consensus (extended abstract). Zbl 1187.68326
Francalanza, Adrian; Hennessy, Matthew
4
2007
Distributed processes and location failures. Zbl 1401.68233
Riely, James; Hennessy, Matthew
4
1997
Unique fixpoint induction for message-passing process calculi. Zbl 0998.68089
Hennessy, M.; Lin, H.; Rathke, J.
3
2001
A theory for observational fault tolerance. (Extended abstract). Zbl 1180.68114
Francalanza, Adrian; Hennessy, Matthew
3
2006
Observing processes. (Tutorial). Zbl 0683.68021
Hennessy, M.
3
1989
A theory of communicating processes with value-passing. Zbl 0765.68105
Hennessy, M.; Ingólfsdóttir, A.
2
1990
A proof system for communicating processes with value-passing. Zbl 0729.68020
Hennessy, M.
2
1989
Full abstractness for a functional/concurrent language with higher-order value-passing. Zbl 0912.68114
Hartonas, Chrysafis; Hennessy, Matthew
2
1998
Local model checking for value-passing processes. (Extended abstract). Zbl 0885.03021
Rathke, J.; Hennessy, M.
2
1997
Towards a behavioural theory of access and mobility control in distributed systems. Zbl 1029.68109
Hennessy, Matthew; Merro, Massimo; Rathke, Julian
2
2003
Towards a semantic theory of CML. Zbl 1193.68068
Ferreira, W.; Hennessy, M.
2
1995
Uniqueness typing for resource management in message-passing concurrency. Zbl 1303.68087
Devries, Edsko; Francalanza, Adrian; Hennessy, Matthew
2
2014
Mutually testing processes. Zbl 1390.68460
Bernardi, Giovanni; Hennessy, Matthew
2
2015
Proof methodologies for behavioural equivalence in DPI. Zbl 1169.68538
Ciaffaglione, Alberto; Hennessy, Matthew; Rathke, Julian
2
2005
Higher-order processes and their models. Zbl 1418.68143
Hennessy, M.
2
1994
Adding recursion to Dpi. Zbl 1111.68083
Hym, Samuel; Hennessy, Matthew
2
2007
An algebraic theory of fair asynchronous communicating processes. Zbl 0566.68022
Hennessy, Matthew
2
1985
Mutually testing processes (extended abstract). Zbl 1390.68459
Bernardi, Giovanni; Hennessy, Matthew
1
2013
Distinguishing between communicating transactions. Zbl 1388.68198
Koutavas, Vasileios; Gazda, Maciej; Hennessy, Matthew
1
2018
Using higher-order contracts to model session types. Zbl 1448.68329
Bernardi, Giovanni; Hennessy, Matthew
10
2016
Modelling session types using contracts. Zbl 1361.68160
Bernardi, Giovanni; Hennessy, Matthew
8
2016
Modelling MAC-layer communications in wireless systems. Zbl 1395.94007
Cerone, Andrea; Hennessy, Matthew; Merro, Massimo
5
2015
Mutually testing processes. Zbl 1390.68460
Bernardi, Giovanni; Hennessy, Matthew
2
2015
Bisimulations for communicating transactions (extended abstract). Zbl 1405.68215
Koutavas, Vasileios; Spaccasassi, Carlo; Hennessy, Matthew
6
2014
Using higher-order contracts to model session types (extended abstract). Zbl 1417.68116
Bernardi, Giovanni; Hennessy, Matthew
4
2014
Uniqueness typing for resource management in message-passing concurrency. Zbl 1303.68087
Devries, Edsko; Francalanza, Adrian; Hennessy, Matthew
2
2014
Real-reward testing for probabilistic processes. Zbl 1359.68218
Deng, Yuxin; van Glabbeek, Rob; Hennessy, Matthew; Morgan, Carroll
1
2014
On the semantics of Markov automata. Zbl 1286.68362
Deng, Yuxin; Hennessy, Matthew
15
2013
Mutually testing processes (extended abstract). Zbl 1390.68459
Bernardi, Giovanni; Hennessy, Matthew
1
2013
Modelling probabilistic wireless networks. Zbl 1274.68225
Cerone, Andrea; Hennessy, Matthew
1
2013
Exploring probabilistic bisimulations. I. Zbl 1259.68153
Hennessy, Matthew
15
2012
First-order reasoning for higher-order concurrency. Zbl 1248.68355
Koutavas, Vasileios; Hennessy, Matthew
5
2012
On the semantics of Markov automata. Zbl 1333.68162
Deng, Yuxin; Hennessy, Matthew
6
2011
A calculus for costed computations. Zbl 1213.68403
Hennessy, Matthew
5
2011
A testing theory for a higher-order cryptographic language (extended abstract). Zbl 1326.68200
Koutavas, Vasileios; Hennessy, Matthew
1
2011
Communicating transactions (extended abstract). Zbl 1287.68018
de Vries, Edsko; Koutavas, Vasileios; Hennessy, Matthew
15
2010
Testing finitary probabilistic processes (extended abstract). Zbl 1254.68166
Deng, Yuxin; van Glabbeek, Rob; Hennessy, Matthew; Morgan, Carroll
23
2009
Counting the cost in the picalculus (extended abstract). Zbl 1291.68288
Hennessy, Matthew; Gaur, Manish
5
2009
Characterising testing preorders for finite probabilistic processes. Zbl 1161.68035
Deng, Yuxin; van Glabbeek, Robert J.; Hennessy, Matthew; Morgan, Carroll C.
34
2008
A theory of system behaviour in the presence of node and link failure. Zbl 1152.68037
Francalanza, Adrian; Hennessy, Matthew
6
2008
A distributed pi-calculus. Zbl 1125.68082
Hennessy, Matthew
32
2007
Remarks on testing probabilistic processes. Zbl 1277.68121
Deng, Yuxin; Van Glabbeek, Rob; Hennessy, Matthew; Morgan, Carroll; Zhang, Chenyi
10
2007
A theory for observational fault tolerance. Zbl 1123.68080
Francalanza, Adrian; Hennessy, Matthew
6
2007
A fault tolerance bisimulation proof for consensus (extended abstract). Zbl 1187.68326
Francalanza, Adrian; Hennessy, Matthew
4
2007
Adding recursion to Dpi. Zbl 1111.68083
Hym, Samuel; Hennessy, Matthew
2
2007
A theory for observational fault tolerance. (Extended abstract). Zbl 1180.68114
Francalanza, Adrian; Hennessy, Matthew
3
2006
safeDpi: a language for controlling mobile code. Zbl 1081.68003
Hennessy, Matthew; Rathke, Julian; Yoshida, Nobuko
8
2005
A theory of system behaviour in the presence of node and link failures (extended abstract). Zbl 1134.68340
Francalanza, Adrian; Hennessy, Matthew
8
2005
Security policies as membranes in systems for global computing. Zbl 1272.68062
Gorla, Daniele; Hennessy, Matthew; Sassone, Vladimiro
5
2005
The security pi-calculus and non-interference. Zbl 1067.68096
Hennessy, Matthew
5
2005
Proof methodologies for behavioural equivalence in DPI. Zbl 1169.68538
Ciaffaglione, Alberto; Hennessy, Matthew; Rathke, Julian
2
2005
Typed behavioural equivalences for processes in the presence of subtyping. Zbl 1093.68062
Henessy, Matthew; Rathke, Julian
11
2004
Towards a behavioural theory of access and mobility control in distributed systems. Zbl 1071.68009
Hennessy, Matthew; Merro, Massimo; Rathke, Julian
10
2004
SafeDpi: A language for controlling mobile code (extended abstract). Zbl 1126.68501
Hennessy, Matthew; Rathke, Julian; Yoshida, Nobuko
1
2004
Trust and partial typing in open systems of mobile agents. Zbl 1069.68076
Riely, James; Hennessy, Matthew
12
2003
Towards a behavioural theory of access and mobility control in distributed systems. Zbl 1029.68109
Hennessy, Matthew; Merro, Massimo; Rathke, Julian
2
2003
The security picalculus and non-interference (extended abstract). Zbl 1337.68183
Hennessy, Matthew
1
2003
Resource access control in systems of mobile agents. Zbl 1009.68081
Hennessy, Matthew; Riely, James
42
2002
Bisimulation congruences in safe ambients. Zbl 1323.68412
Merro, Massimo; Hennessy, Matthew
23
2002
A fully abstract denotational semantics for the \(\pi\)-calculus. Zbl 1014.68105
Hennessy, Matthew
10
2002
Assigning types to processes. Zbl 1009.68085
Yoshida, Nobuko; Hennessy, Matthew
8
2002
Typed behavioural equivalences for processes in the presence of subtyping. Zbl 1268.68127
Hennessy, Matthew; Rathke, Julian
4
2002
Distributed processes and location failures. Zbl 0989.68007
Riely, J.; Hennessy, M.
12
2001
Unique fixpoint induction for message-passing process calculi. Zbl 0998.68089
Hennessy, M.; Lin, H.; Rathke, J.
3
2001
Information flow vs. resource access in the asynchronous pi-calculus. (Extended abstract). Zbl 0973.68519
Hennessy, Matthew; Riely, James
12
2000
Subtyping and locality in distributed higher order processes. Zbl 0940.68024
Yoshida, Nobuko; Hennessy, Matthew
6
1999
A behavioural theory of first-order CML. Zbl 0915.68111
Ferreira, William; Hennessy, Matthew
1
1999
Proof systems for message-passing process calculi. Zbl 0963.68115
Hennessy, Matthew
1
1999
Resource access control in systems of mobile agents. Zbl 0917.68047
Hennessy, M.; Riely, J.
16
1998
Bisimulations for a calculus of broadcasting systems. Zbl 0915.68065
Hennessy, M.; Rathke, J.
12
1998
A theory of weak bisimulation for core CML. Zbl 0916.68093
Ferreira, William; Hennessy, Matthew; Jeffrey, Alan
5
1998
Full abstractness for a functional/concurrent language with higher-order value-passing. Zbl 0912.68114
Hartonas, Chrysafis; Hennessy, Matthew
2
1998
A survey of location calculi. Zbl 0917.68066
Hennessy, M.
1
1998
Distributed processes and location failures. Zbl 1401.68233
Riely, James; Hennessy, Matthew
4
1997
Local model checking for value-passing processes. (Extended abstract). Zbl 0885.03021
Rathke, J.; Hennessy, M.
2
1997
On the decidability of non-interleaving process equivalences. Zbl 0883.68059
Kiehn, Astrid; Hennessy, Matthew
1
1997
Proof systems for message-passing process algebras. Zbl 0857.68040
Hennessy, M.; Lin, H.
13
1996
A theory of weak bisimulation for core CML. Zbl 1345.68049
Ferreira, William; Hennessy, Matthew; Jeffrey, Alan
5
1996
Symbolic bisimulations. Zbl 0874.68187
Hennessy, M.; Lin, H.
64
1995
A process algebra for timed systems. Zbl 0826.68068
Hennessy, Matthew; Regan, Tim
63
1995
Concurrent testing of processes. Zbl 0835.68074
Hennessy, M.
5
1995
A modal logic for message passing processes. Zbl 0827.68102
Hennessy, M.; Liu, Xin Xin
5
1995
Towards a semantic theory of CML. Zbl 1193.68068
Ferreira, W.; Hennessy, M.
2
1995
A theory of processes with localities. Zbl 0806.68070
Boudol, G.; Castellani, I.; Hennessy, M.; Kiehn, A.
25
1994
A fully abstract denotational model for higher-order processes. Zbl 0806.68071
Hennessy, M.
18
1994
Adding action refinement to a finite process algebra. Zbl 0834.68077
Aceto, L.; Hennessy, M.
13
1994
Higher-order processes and their models. Zbl 1418.68143
Hennessy, M.
2
1994
Testing equivalence as a bisimulation equivalence. Zbl 0797.68058
Cleaveland, Rance; Hennessy, Matthew
30
1993
A theory of communicating processes with value passing. Zbl 0794.68098
Hennessy, M.; Ingólfsdóttir, A.
22
1993
Observing localities. Zbl 0783.68072
Boudol, G.; Castellani, I.; Hennessy, M.; Kiehn, A.
17
1993
Towards action-refinement in process algebras. Zbl 0779.68028
Aceto, L.; Hennessy, M.
14
1993
Communicating processes with value-passing and assignments. Zbl 0784.68055
Hennessy, M.; Ingólfsdóttir, A.
7
1993
An efficiency preorder for processes. Zbl 0790.68039
Arun-Kumar, S.; Hennessy, M.
40
1992
Termination, deadlock, and divergence. Zbl 0799.68131
Aceto, L.; Hennessy, M.
33
1992
A proof system for communicating processes with value-passing. Zbl 0736.68057
Hennessy, M.
12
1991
Observing localities. (Extended abstract). Zbl 0778.68055
Boudol, G.; Castellani, I.; Hennessy, M.; Kiehn, A.
8
1991
Adding action refinement to a finite process algebra. Zbl 0786.68055
Aceto, Luca; Hennessy, Matthew
5
1991
Priorities in process algebras. Zbl 0726.68053
Cleaveland, Rance; Hennessy, Matthew
28
1990
The semantics of programming languages. An elementary introduction using structural operational semantics. Zbl 0723.68067
Hennessy, Matthew
18
1990
A theory of communicating processes with value-passing. Zbl 0765.68105
Hennessy, M.; Ingólfsdóttir, A.
2
1990
Distributed bisimulations. Zbl 0697.68076
Castellani, Ilaria; Hennessy, Matthew
20
1989
Towards action-refinement in process algebras. Zbl 0716.68034
Aceto, L.; Hennessy, M.
9
1989
Observing processes. (Tutorial). Zbl 0683.68021
Hennessy, M.
3
1989
A proof system for communicating processes with value-passing. Zbl 0729.68020
Hennessy, M.
2
1989
Algebraic theory of processes. Zbl 0744.68047
Hennessy, Matthew
140
1988
Axiomatising finite concurrent processes. Zbl 0666.68024
Hennessy, Matthew
14
1988
An algebraic theory of fair asynchronous communicating processes. Zbl 0612.68026
Hennessy, Matthew
8
1987
CCS without \(\tau\) ’s. Zbl 0614.68025
De Nicola, Rocco; Hennessy, Matthew
8
1987
Finite conjunctive nondeterminism. Zbl 0649.03013
Hennessy, M.; Plotkin, G.
5
1987
Proving systolic systems correct. Zbl 0598.68030
Hennessy, Matthew
5
1986
Algebraic laws for nondeterminism and concurrency. Zbl 0629.68021
Hennessy, Matthew; Milner, Robin
308
1985
Acceptance trees. Zbl 0633.68074
Hennessy, M.
28
1985
The power of the future perfect in program logics. Zbl 0582.68010
Hennessy, Matthew; Stirling, Colin
14
1985
An algebraic theory of fair asynchronous communicating processes. Zbl 0566.68022
Hennessy, Matthew
2
1985
Testing equivalences for processes. Zbl 0985.68518
De Nicola, R.; Hennessy, M. C. B.
245
1984
Axiomatising finite delay operators. Zbl 0521.68047
Hennessy, Matthew
8
1984
The power of the future perfect in program logics. Zbl 0557.68029
Hennessy, M.; Stirling, C.
4
1984
Testing equivalences for processes. Zbl 0515.68029
de Nicola, R.; Hennessy, M. C. B.
8
1983
...and 11 more Documents
all top 5

Cited by 1,142 Authors

42 Aceto, Luca
41 Hennessy, Matthew C. B.
38 Ingólfsdóttir, Anna
21 De Nicola, Rocco
21 van Glabbeek, Robert Jan
19 Montanari, Ugo G.
19 Vogler, Walter
18 Deng, Yuxin
17 Sangiorgi, Davide
16 Fokkink, Willem Jan
15 Larsen, Kim Guldstrand
14 Bernardo, Marco
14 Corradini, Flavio
14 Fu, Yuxi
14 Luttik, Bas
13 Bravetti, Mario
13 Dezani-Ciancaglini, Mariangiola
13 Gorla, Daniele
13 Merro, Massimo
12 Cleaveland, Rance
12 Gorrieri, Roberto
12 Gregorio-Rodríguez, Carlos
12 Pugliese, Rosario
12 Tini, Simone
12 Yoshida, Nobuko
11 Bergstra, Jan A.
11 de Frutos-Escrig, David
11 Reniers, Michel Adriaan
10 Boreale, Michele
10 Groote, Jan Friso
10 Nestmann, Uwe
9 Castellani, Ilaria
9 Degano, Pierpaolo
9 Francalanza, Adrian
9 Phillips, Iain W.
9 Priami, Corrado
9 Schröder, Lutz
8 Baeten, Jos C. M.
8 Bonchi, Filippo
8 Bruni, Roberto
8 Castiglioni, Valentina
8 Ferrari, Gian Luigi
8 Lanotte, Ruggero
8 Lüttgen, Gerald
8 Martí-Oliet, Narciso
8 Padovani, Luca
8 Smolka, Scott A.
7 Abramsky, Samson
7 de Bakker, Jacobus W.
7 de’Liguoro, Ugo
7 Kok, Joost N.
7 Legay, Axel
7 Milner, Robin
7 Palamidessi, Catuscia
7 Panangaden, Prakash
7 Pérez, Jorge A.
7 Rathke, Julian
7 Rutten, Jan J. M. M.
7 Tuosto, Emilio
7 Winskel, Glynn
6 Boudol, Gérard
6 Crafa, Silvia
6 Gutierrez, Julian
6 Hermanns, Holger
6 Honda, Kohei
6 Loreti, Michele
6 Malik, Robi
6 Meyer, John-Jules Charles
6 Nunez, Manuel A.
6 Parrow, Joachim
6 Silva, Alexandra
6 Stirling, Colin
6 Ulidowski, Irek
6 Ying, Mingsheng
6 Zavattaro, Gianluigi
5 Abadi, Martín
5 Amadio, Roberto M.
5 Barbanera, Franco
5 Berger, Martin J.
5 Buchholz, Peter
5 Caires, Luís
5 Cao, Yongzhi
5 Chen, Taolue
5 Ciobanu, Gabriel
5 Dam, Mads
5 de Vink, Erik P.
5 Fahrenberg, Uli
5 Gardner, Philippa Anne
5 Ghilezan, Silvia
5 Horne, Ross
5 Inverardi, Paola
5 Jeffrey, Alan S. A.
5 Labella, Anna
5 Lin, Huimin
5 Ma, Yanfang
5 Maffeis, Sergio
5 Meseguer Guaita, José
5 Middelburg, Cornelis A.
5 Pantović, Jovanka
5 Piazza, Carla
...and 1,042 more Authors
all top 5

Cited in 74 Serials

299 Theoretical Computer Science
127 Information and Computation
61 Formal Aspects of Computing
53 Acta Informatica
47 The Journal of Logic and Algebraic Programming
39 Journal of Logical and Algebraic Methods in Programming
38 MSCS. Mathematical Structures in Computer Science
25 Logical Methods in Computer Science
21 Information Processing Letters
13 Journal of Computer and System Sciences
10 Formal Methods in System Design
9 Science of Computer Programming
7 Artificial Intelligence
7 Annals of Pure and Applied Logic
7 Discrete Event Dynamic Systems
5 Programming and Computer Software
5 Distributed Computing
5 RAIRO. Informatique Théorique et Applications
4 Information Sciences
4 Studia Logica
4 Journal of Computer Science and Technology
4 International Journal of Parallel Programming
4 International Journal of Approximate Reasoning
4 International Journal of Foundations of Computer Science
4 Journal of Applied Non-Classical Logics
4 Computer Languages, Systems & Structures
4 ACM Transactions on Computational Logic
3 Fuzzy Sets and Systems
3 Journal of Automated Reasoning
3 Annals of Mathematics and Artificial Intelligence
3 RAIRO. Theoretical Informatics and Applications
3 Journal of Applied Logic
2 International Journal of Theoretical Physics
2 Journal of Pure and Applied Algebra
2 Topology and its Applications
2 International Journal of Computer Mathematics
2 Applicable Algebra in Engineering, Communication and Computing
2 Journal of Functional Programming
2 The Bulletin of Symbolic Logic
2 Science in China. Series E
2 Mathematical Problems in Engineering
2 Theory of Computing Systems
2 Journal of the ACM
2 Fundamenta Informaticae
2 Sādhanā
2 Sibirskie Èlektronnye Matematicheskie Izvestiya
2 Science China. Information Sciences
1 Discrete Mathematics
1 Applied Mathematics and Computation
1 Automatica
1 BIT
1 Journal of the Association for Computing Machinery
1 Journal of Computational and Applied Mathematics
1 Journal of Philosophical Logic
1 Journal of Soviet Mathematics
1 Kybernetes
1 Mathematical Systems Theory
1 Notre Dame Journal of Formal Logic
1 RAIRO, Informatique Théorique
1 New Generation Computing
1 Annals of Operations Research
1 Cybernetics and Systems Analysis
1 Journal of Logic, Language and Information
1 Applied Categorical Structures
1 Topoi
1 Soft Computing
1 Wuhan University Journal of Natural Sciences (WUJNS)
1 International Journal of Applied Mathematics and Computer Science
1 New Mathematics and Natural Computation
1 Journal of Shanghai Jiaotong University (Science)
1 Algorithms
1 RAIRO. Theoretical Informatics and Applications
1 Frontiers of Computer Science in China
1 Frontiers of Computer Science

Citations by Year

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.