The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
A brief history of process algebra
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Communicating Sequential Processes
Hoare, T. (1985) · Cited by 9,016
Milner, R. (1989) · Cited by 6,877
The temporal logic of programs
Pnueli, A. (1977) · 18th Annual Symposium on Foundations of Computer Science (sfcs 1977) · doi:10.1109/sfcs.1977.32 · Cited by 5,689
A Calculus of Communicating Systems
(1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10235-3 · Cited by 4,633
On observing nondeterminism and concurrency
Hennessy, M., & Milner, R. (1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10003-2_79 · Cited by 4,492
An axiomatic basis for computer programming
Hoare, C. A. R. (1969) · Communications of the ACM · doi:10.1145/363235.363259 · Cited by 4,002
Penczek, W. (1990) · Science of Computer Programming · doi:10.1016/0167-6423(90)90076-p · Cited by 3,954
A calculus of mobile processes, I
Milner, R., Parrow, J., & Walker, D. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90008-4 · Cited by 2,845
Communicating and Mobile Systems: the Pi-Calculus
Milner, R. (1999) · Cited by 2,256
Larsen, K. G., Pettersson, P., & Yi, W. (1997) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s100090050010 · Cited by 2,193
Communicating sequential processes
(1986) · Microprocessors and Microsystems · doi:10.1016/0141-9331(86)90196-1 · Cited by 2,167
Petri, C. A. (1962) · Cited by 2,159
Guarded commands, nondeterminacy and formal derivation of programs
Dijkstra, E. W. (1975) · Communications of the ACM · doi:10.1145/360933.360975 · Cited by 1,941
The algorithmic analysis of hybrid systems
Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T. A., Ho, P.-H., Nicollin, X., Olivero, A., Sifakis, J., & Yovine, S. (1995) · Theoretical Computer Science · doi:10.1016/0304-3975(94)00202-t · Cited by 1,876
An axiomatic basis for computer programming
Hoare, C. A. R. (1983) · Communications of the ACM · doi:10.1145/357980.358001 · Cited by 1,521
Assigning meanings to programs
Floyd, R. W. (1967) · Proceedings of Symposia in Applied Mathematics · doi:10.1090/psapm/019/0235771 · Cited by 1,408
A calculus for cryptographic protocols: the spi calculus
Abadi, M., & Gordon, A. D. (1997) · Proceedings of the 4th ACM conference on Computer and communications security · doi:10.1145/266420.266432 · Cited by 1,154
Assigning Meanings to Programs
Floyd, R. W. (1993) · Studies in Cognitive Systems · doi:10.1007/978-94-011-1793-7_4 · Cited by 1,079
Cardelli, L., & Gordon, A. D. (2000) · Theoretical Computer Science · doi:10.1016/s0304-3975(99)00231-5 · Cited by 1,046
Hennessy, M. (1988) · Figshare · Cited by 852
A Basis for a Mathematical Theory of Computation )
(1963) · Studies in Logic and the Foundations of Mathematics · doi:10.1016/s0049-237x(08)72018-4 · Cited by 692
A Calculus for Cryptographic Protocols: The Spi Calculus
Abadi, M., & Gordon, A. D. (1999) · Information and Computation · doi:10.1006/inco.1998.2740 · Cited by 668
Plotkin, G. D. (1976) · SIAM Journal on Computing · doi:10.1137/0205035 · Cited by 649
Priami, C., Regev, A., Shapiro, E., & Silverman, W. (2001) · Information Processing Letters · doi:10.1016/s0020-0190(01)00214-9 · Cited by 459
Concurrent and Real-time Systems: The CSP Approach
Schneider, S. A. (1999) · Open Research (University of Surrey) · Cited by 413
The origins of structural operational semantics
Plotkin, G. D. (2004) · The Journal of Logic and Algebraic Programming · doi:10.1016/j.jlap.2004.03.009 · Cited by 362
An Introduction to Formal Languages and Automata
Linz, P. (1990) · Cited by 329
A Basis for a Mathematical Theory of Computation
(1959) · Studies in Logic and the Foundations of Mathematics · doi:10.1016/s0049-237x(09)70099-0 · Cited by 321
A Classification of Security Properties for Process Algebras1
Focardi, R., & Gorrieri, R. (1995) · Journal of Computer Security · doi:10.3233/jcs-1994/1995-3103 · Cited by 314
Hybrid I/O automata: Extended abstract
Lynch, N., Segala, R., Vaandrager, F., & Weinberg, H. B. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0020971 · Cited by 269
Structural Operational Semantics
Aceto, L., Fokkink, W. J., & Verhoef, C. (1999) · BRICS Report Series · doi:10.7146/brics.v6i30.20099 · Cited by 220
Processes: A Mathematical Model of Computing Agents
Milner, R. (1975) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)71948-7 · Cited by 145
Algebraic Process Verification
Groote, J. F., & Reniers, M. A. (2001) · Elsevier eBooks · doi:10.1016/b978-044482830-9/50035-7 · Cited by 109
A process algebraic approach to the specification and analysis of resource-bound real-time systems
Lee, I., Brémond-Grégoire, P., & Gerber, R. A. (1994) · Proceedings of the IEEE · doi:10.1109/5.259433 · Cited by 104
Limited, C. (1980) · Computer-Aided Design · doi:10.1016/0010-4485(80)90015-9 · Cited by 73
An Approach to the Semantics of Parallel Programs
Milner, R. (1973) · Cited by 31
Cited by
Security, privacy and trust in Internet of Things: The road ahead
Sicari, S., Rizzardi, A., Grieco, L. A., & Coen-Porisini, A. (2015) · Computer Networks · doi:10.1016/j.comnet.2014.11.008 · Cited by 2,187
Rules for Modeling Signal-Transduction Systems
Hlavacek, W. S., Faeder, J. R., Blinov, M. L., Posner, R. G., Hucka, M., & Fontana, W. (2006) · Science's STKE · doi:10.1126/stke.3442006re6 · Cited by 350
Metadata
- Authors
- Baeten, J. C. M.
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 2005-05
- Volume
- 335
- Issue
- 2-3
- Pages
- 131-146
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W2101206446
- Cited by
- 323
- References
- 36
- FWCI
- 20.27
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.