| Contradiction-Tolerant Process Algebra with Propositional Signals. | 1 | 0.40 | 2015 |
| Transformation of fractions into simple fractions in divisive meadows | 0 | 0.34 | 2015 |
| Probabilistic Thread Algebra | 0 | 0.34 | 2015 |
| On Instruction Sets For Boolean Registers In Program Algebra | 2 | 0.46 | 2015 |
| A negative result on algebraic specifications of the meadow of rational numbers | 1 | 0.43 | 2015 |
| Instruction sequence processing operators | 10 | 0.80 | 2012 |
| On the Behaviours Produced by Instruction Sequences under Execution | 2 | 0.42 | 2012 |
| Thread algebra for poly-threading | 3 | 0.41 | 2011 |
| Short-circuit logic | 3 | 0.59 | 2010 |
| A Process Calculus with Finitary Comprehended Terms | 5 | 0.49 | 2009 |
| Meadows and the equational specification of division | 9 | 1.00 | 2009 |
| Machine structure oriented control code logic | 28 | 1.00 | 2009 |
| Partial Komori fields and imperative Komori fields | 5 | 0.50 | 2009 |
| On the Expressiveness of Single-Pass Instruction Sequences | 14 | 0.89 | 2008 |
| Distributed strategic interleaving with load balancing | 12 | 0.65 | 2008 |
| Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting | 10 | 0.46 | 2008 |
| Maurer computers for pipelined instruction processing† | 11 | 0.72 | 2008 |
| Division Safe Calculation in Totalised Fields | 27 | 1.31 | 2008 |
| Parallel Processes with Implicit Computational Capital | 19 | 0.67 | 2008 |
| Data Linkage Dynamics with Shedding | 8 | 0.42 | 2008 |
| A Thread Algebra with Multi-Level Strategic Interleaving | 16 | 0.95 | 2007 |
| A thread calculus with molecular dynamics | 8 | 0.63 | 2007 |
| On the operating unit size of load/store architectures† | 20 | 0.69 | 2007 |
| Synchronous cooperation for explicit multi-threading | 26 | 0.93 | 2007 |
| Thread Algebra for Strategic Interleaving | 48 | 2.09 | 2007 |
| The rational numbers as an abstract data type | 33 | 2.90 | 2007 |
| Splitting bisimulations and retrospective conditions | 16 | 0.83 | 2006 |
| Thread Algebra with Multi-Level Strategies | 24 | 1.14 | 2006 |
| Elementary algebraic specifications of the rational function field | 3 | 0.62 | 2006 |
| An upper bound for the equational specification of finite state services | 24 | 0.89 | 2005 |
| Process algebra for hybrid systems | 41 | 1.89 | 2005 |
| Polarized process algebra with reactive composition | 6 | 0.79 | 2005 |
| Strong splitting bisimulation equivalence | 4 | 0.49 | 2005 |
| Discrete time process algebra with silent step | 8 | 0.53 | 2000 |
| The discrete time TOOLBUS—a software coordination architecture | 50 | 5.52 | 1998 |
| Discrete time process algebra: absolute time, relative time and parametric time | 10 | 0.59 | 1997 |
| Toward a complete transformational toolkit for compilers | 10 | 0.88 | 1997 |
| Network Algebra For Asynchronous Dataflow | 3 | 0.45 | 1997 |
| Process algebra with propositional signals | 21 | 1.09 | 1997 |
| Processes with multiple entries and exits modulo isomorphism and modulo bisimulation | 0 | 0.34 | 1996 |
| Algebra Of Timed Frames | 1 | 0.38 | 1996 |
| Strategic directions in concurrency research | 21 | 3.04 | 1996 |
| Homomorphism preserving algebraic specifications require hidden sorts | 0 | 0.34 | 1995 |
| Equational specifications, complete term rewriting systems, and computable and semicomputable algebras | 20 | 1.42 | 1995 |
| Axiomatizing probabilistic processes: ACP with generative probabilities | 71 | 4.38 | 1995 |
| Which data types have &ohgr;-complete initial algebra specifications? | 4 | 0.41 | 1994 |
| Bisimulation is two-way simulation | 3 | 0.47 | 1994 |
| Decidability of bisimulation equivalence for processes generating context-free languages | 141 | 15.91 | 1993 |
| Recursive process definitions with the state operator | 4 | 0.54 | 1991 |
| Module algebra | 65 | 3.19 | 1990 |
