The DOI matches its Crossref record.
A Calculus of Communicating Systems
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
Cited by
Statecharts: a visual formalism for complex systems
Harel, D. (1987) · Science of Computer Programming · doi:10.1016/0167-6423(87)90035-9 · Cited by 6,751
Symbolic model checking: 1020 States and beyond
Burch, J. R., Clarke, E. M., McMillan, K. L., Dill, D. L., & Hwang, L. J. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90017-a · Cited by 2,703
Transfer Learning for Reinforcement Learning Domains: A Survey
Taylor, M. E., & Stone, P. (2009) · doi:10.5555/1577069.1755839 · Cited by 1,488
Harel, D. (1988) · Communications of the ACM · doi:10.1145/42411.42414 · Cited by 1,269
Formal Methods: State of the Art and Future Directions
Clarke, E., Wing, J. M., & Jones, C. B. (1996) · doi:10.25405/ncl.34123050 · Cited by 1,122
(2006) · Technical Report Series 936 · doi:10.2471/trs.02.935 · Cited by 1,096
Taming heterogeneity - the Ptolemy approach
Eker, J., Janneck, J. W., Lee, E. A., Liu, J., Liu, X., Ludvig, J., Neuendorffer, S., Sachs, S., & Xiong, Y. (2003) · Proceedings of the IEEE · doi:10.1109/jproc.2002.805829 · Cited by 1,074
Readings in Distributed Artificial Intelligence
(1988) · Elsevier eBooks · doi:10.1016/c2013-0-07700-6 · Cited by 986
Formal methods: state of the art and future directions
Clarke, E. M., & Wing, J. M. (1996) · ACM Computing Surveys · doi:10.1145/242223.242257 · Cited by 763
A specifier's introduction to formal methods
Wing, J. M. (1990) · Computer · doi:10.1109/2.58215 · Cited by 736
Tentative steps toward a development method for interfering programs
Jones, C. B. (1983) · ACM Transactions on Programming Languages and Systems · doi:10.1145/69575.69577 · Cited by 617
Cardelli, L., & Gordon, A. D. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0053547 · Cited by 455
Pnueli, A. (1986) · Lecture Notes in Computer Science · doi:10.1007/bfb0027047 · Cited by 450
The family of concurrent logic programming languages
Shapiro, E. (1989) · ACM Computing Surveys · doi:10.1145/72551.72555 · Cited by 440
Concepts and paradigms of object-oriented programming
Wegner, P. (1990) · ACM SIGPLAN OOPS Messenger · doi:10.1145/382192.383004 · Cited by 439
Characterizing finite Kripke structures in propositional temporal logic
Browne, M. C., Clarke, E. M., & Grümberg, O. (1988) · Theoretical Computer Science · doi:10.1016/0304-3975(88)90098-9 · Cited by 419
Executing temporal logic programs: preliminary version
Moszkowski, B. (1985) · Lecture Notes in Computer Science · doi:10.1007/3-540-15670-4_6 · Cited by 397
HCI Models, Theories, and Frameworks
(2003) · Elsevier eBooks · doi:10.1016/b978-1-55860-808-5.x5000-x · Cited by 373
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
Behavior protocols for software components
Plasil, F., & Visnovsky, S. (2002) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2002.1049404 · Cited by 346
A brief history of process algebra
Baeten, J. C. M. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2004.07.036 · Cited by 323
Bisimulation for Labelled Markov Processes
Desharnais, J., Edalat, A., & Panangaden, P. (2002) · Information and Computation · doi:10.1006/inco.2001.2962 · Cited by 304
Event‐oriented approaches to geographic phenomena
Worboys, M. (2005) · International Journal of Geographical Information Science · doi:10.1080/13658810412331280167 · Cited by 284
The space and motion of communicating agents
(2010) · Choice Reviews Online · doi:10.5860/choice.47-3212 · Cited by 276
Introduction to Process Algebra
Fokkink, W. (2000) · Texts in Theoretical Computer Science. An EATCS Series · doi:10.1007/978-3-662-04293-9 · Cited by 254
Rewriting Logic as a Logical and Semantic Framework
Martí-Oliet, N., & Meseguer, J. (2002) · Handbook of Philosophical Logic · doi:10.1007/978-94-017-0464-9_1 · Cited by 253
Plotkin, G., & Pretnar, M. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00590-9_7 · Cited by 225
Modeling formalisms in Systems Biology
Machado, D., Costa, R. S., Rocha, M., Ferreira, E. C., Tidor, B., & Rocha, I. (2011) · AMB Express · doi:10.1186/2191-0855-1-45 · Cited by 189
Metadata
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1980
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2137865376
- Cited by
- 4,633
- References
- 0
- FWCI
- 26.02
- Type
- conference paper
- 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.