A domain equation for bisimulation
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date1991/06/01
-
Journal
-
Indian UGC (journal)
-
Refrences48
-
Citations62
-
Samson Abramsky
Cite
Abramsky, Samson. “A Domain Equation for Bisimulation”. Information and Computation, vol. 92, no. 2, 1991, pp. 161-18, https://doi.org/10.1006/inco.1991.9999.
Abramsky, S. (1991). A domain equation for bisimulation. Information and Computation, 92(2), 161-218. https://doi.org/10.1006/inco.1991.9999
Abramsky, Samson. “A Domain Equation for Bisimulation”. Information and Computation 92, no. 2 (1991): 161-218. https://doi.org/10.1006/inco.1991.9999.
Abramsky S. A domain equation for bisimulation. Information and Computation. 1991;92(2):161-218.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
Countable nondeterminism and random assignment | Journal of the ACM |
| 64 | 1986 |
| Concurrent Processes and Their Syntax | Journal of the ACM |
| 56 | 1979 |
| Observation equivalence as a testing equivalence | Theoretical Computer Science |
| 1987 | |
| Modal logics for communicating systems | Theoretical Computer Science |
| 41 | 1987 |
| Higher-level synchronising devices in Meije-SCCS | Theoretical Computer Science |
| 104 | 1985 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Distinguishing between communicating transactions | Information and Computation |
| 2018 | |
A case study in programming coinductive proofs: Howe’s method | Mathematical Structures in Computer Science |
| 2018 | |
| A unified rule format for bounded nondeterminism in SOS with terms as labels | Journal of Logical and Algebraic Methods in Programming |
| 2017 | |
| Lifting non-finite axiomatizability results to extensions of process algebras | Acta Informatica |
| 3 | 2010 |
Connection between logical and algebraic approaches to concurrent systems | Mathematical Structures in Computer Science |
| 2010 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 40
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Domain theory in logical form* and was published in 1991. The most recent citation comes from a 2018 study titled A case study in programming coinductive proofs: Howe’s method. This article reached its peak citation in 2001, with 7 citations. It has been cited in 20 different journals, 5% of which are open access. Among related journals, the Theoretical Computer Science cited this research the most, with 17 citations. The chart below illustrates the annual citation trends for this article.