The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Introduction to Process Algebra
Overview
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
Graph-Based Algorithms for Boolean Function Manipulation
Bryant (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676819 · Cited by 8,891
On computable numbers, with an application to the entscheidungsproblem
Turing, A. M. (1937) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s2-42.1.230 · Cited by 8,283
Milner, R. (1989) · Cited by 6,877
Alur, R., & Dill, D. L. (1994) · Theoretical Computer Science · doi:10.1016/0304-3975(94)90010-8 · Cited by 6,689
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
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
Baader, F., & Nipkow, T. (1998) · Cambridge University Press eBooks · doi:10.1017/cbo9781139172752 · Cited by 2,466
Design and synthesis of synchronization skeletons using branching time temporal logic
Clarke, E. M., & Emerson, E. A. (2005) · Lecture Notes in Computer Science · doi:10.1007/bfb0025774 · Cited by 2,219
Design and validation of computer protocols
Holzmann, G. J. (1991) · Cited by 1,926
The Esterel synchronous programming language: design, semantics, implementation
Berry, G., & Gonthier, G. (1992) · Science of Computer Programming · doi:10.1016/0167-6423(92)90005-v · Cited by 1,739
The well-founded semantics for general logic programs
Van Gelder, A., Ross, K. A., & Schlipf, J. S. (1991) · Journal of the ACM · doi:10.1145/116825.116838 · Cited by 1,652
Algebraic laws for nondeterminism and concurrency
Hennessy, M., & Milner, R. (1985) · Journal of the ACM · doi:10.1145/2455.2460 · Cited by 1,375
Simple Word Problems in Universal Algebras
Knuth, D. E., & BENDIX, P. B. (1983) · Springer eBooks · doi:10.1007/978-3-642-81955-1_23 · Cited by 1,368
Introduction to HOL: a theorem proving environment for higher order logic
Gordon, M., & Melham, T. (1993) · Cambridge University Press eBooks · Cited by 1,299
Introduction to formal language theory
(1980) · Computer Languages · doi:10.1016/0096-0551(80)90068-5 · Cited by 1,254
Bisimulation through probabilistic testing
Larsen, K. G., & Skou, A. (1991) · Information and Computation · doi:10.1016/0890-5401(91)90030-6 · Cited by 1,206
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
Huet, G. (1980) · Journal of the ACM · doi:10.1145/322217.322230 · Cited by 1,115
The complexity of propositional linear temporal logics
Sistla, A. P., & Clarke, E. M. (1985) · Journal of the ACM · doi:10.1145/3828.3837 · Cited by 1,095
Symbolic model checking: an approach to the state explosion problem
McMillan, K. L. (1992) · Defense Technical Information Center (DTIC) · Cited by 979
Hennessy, M. (1988) · Figshare · Cited by 852
On the Declarative Semantics of Deductive Databases and Logic Programs
Przymusinski, T. C. (1988) · Foundations of Deductive Databases and Logic Programming · doi:10.1016/b978-0-934613-40-8.50009-9 · Cited by 548
A note on reliable full-duplex transmission over half-duplex links
Bartlett, K. A., Scantlebury, R. A., & Wilkinson, P. T. (1969) · Communications of the ACM · doi:10.1145/362946.362970 · Cited by 445
Concurrent and Real-time Systems: The CSP Approach
Schneider, S. A. (1999) · Open Research (University of Surrey) · Cited by 413
HUGHES, G. E., & Cresswell, M. J. (1984) · Medical Entomology and Zoology · Cited by 378
Linear and branching structures in the semantics and logics of reactive systems
Pnueli, A. (2005) · Springer eBooks · doi:10.1007/bfb0015727 · Cited by 208
A modal characterisation of observable machine-behaviour
Milner, R. (1981) · Lecture notes in computer science · doi:10.1007/3-540-10828-9_52 · Cited by 154
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
A Conservative Look at Operational Semantics with Variable Binding
Fokkink, W. J., & Verhoef, C. (1998) · Information and Computation · doi:10.1006/inco.1998.2729 · Cited by 62
Self-citationRooted Branching Bisimulation as a Congruence
Fokkink, W. J. (2000) · Journal of Computer and System Sciences · doi:10.1006/jcss.1999.1663 · Cited by 50
Self-citationDistributed systems analysis with CCS
Bruns, G. (1997) · Prentice-Hall, Inc eBooks · Cited by 49
Isabelle: The next seven hundred theorem provers
Paulson, L. C. (2005) · Springer eBooks · doi:10.1007/bfb0012891 · Cited by 32
Cited by
Cloud computing service composition: A systematic literature review
Jula, A., Sundararajan, E., & Othman, Z. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2013.12.017 · Cited by 402
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
- Fokkink, W.
- Venue
- Texts in Theoretical Computer Science. An EATCS Series
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- ISSN
- 1862-4499 (ISSN-L)
- OpenAlex
- W2112320167
- Cited by
- 254
- References
- 33
- FWCI
- 2.99
- Type
- book
- Language
- en
- Open access
- closed
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.