Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
The liar; an essay in truth and circularity
The liar; an essay in truth and circularity
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Three partition refinement algorithms
SIAM Journal on Computing
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
Parallel complexity in the design and analysis of concurrent systems
PARLE '91 Proceedings on Parallel architectures and languages Europe : volume I: parallel architectures and algorithms: volume I: parallel architectures and algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS)
A type-theoretical alternative to ISWIM, CUCH, OWHY
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Infinite objects in type theory
TYPES '93 Proceedings of the international workshop on Types for proofs and programs
The discoveries of continuations
Lisp and Symbolic Computation - Special issue on continuations—part I
Vicious circles: on the mathematics of non-wellfounded phenomena
Vicious circles: on the mathematics of non-wellfounded phenomena
Two Families of Languages Related to ALGOL
Journal of the ACM (JACM)
Correspondence between ALGOL 60 and Church's Lambda-notation: part I
Communications of the ACM
A correspondence between ALGOL 60 and Church's Lambda-notations: Part II
Communications of the ACM
Modal logic
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Introduction to Mathematical Theory of Computation
Introduction to Mathematical Theory of Computation
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
A Method to Compare the Descriptive Power of Different Types of Petri Nets
MFCS '80 Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
Coinductive Axiomatization of Recursive Type Equality and Subtyping
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
On Backtracking and Greatest Fixpoints
Proceedings of the Fourth Colloquium on Automata, Languages and Programming
On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
The Linear Time-Branching Time Spectrum (Extended Abstract)
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
On Properties Preserved by Contraction of Concurrent Systems
Proceedings of the International Sympoisum on Semantics of Concurrent Computation
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
On the Semantics of Fair Parallelism
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School
On the Foundation of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders
Proceedings of the REX Workshop on Sematics: Foundations and Applications
On Observing Nondeterminism and Concurrency
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
The Y-combinator in Scott''s Lambda-calculus Models
The Y-combinator in Scott''s Lambda-calculus Models
Recursive definitions of partial functions and their computations
Recursive definitions of partial functions and their computations
Completeness and incompleteness theorems for hoare-like axiom systems.
Completeness and incompleteness theorems for hoare-like axiom systems.
On the bisimulation proof method
Mathematical Structures in Computer Science
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
Environmental Bisimulations for Higher-Order Languages
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Reactive Systems: Modelling, Specification and Verification
Reactive Systems: Modelling, Specification and Verification
Origins of recursive function theory
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
The equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Complete lattices and up-to techniques
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
On the expressiveness of interaction
Theoretical Computer Science
A fuzzy Petri-nets model for computing with words
IEEE Transactions on Fuzzy Systems - Special section on computing with words
Synoptic: summarizing system logs with refinement
SLAML'10 Proceedings of the 2010 workshop on Managing systems via log analysis and machine learning techniques
Bisimulation proof methods in a path-based specification language for polynomial coalgebras
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Model independent order relations for processes
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Leveraging existing instrumentation to automatically infer invariant-constrained models
Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering
On characterization, definability and ω-saturated models
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Set systems: Order types, continuous nondeterministic deformations, and quasi-orders
Theoretical Computer Science
On quantitative security policies
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
A unifying formal basis for the SENSORIA approach: a white paper
Rigorous software engineering for service-oriented systems
Bisimulations for fuzzy automata
Fuzzy Sets and Systems
Producing enactable protocols in artificial agent societies
PRIMA'11 Proceedings of the 14th international conference on Agents in Principle, Agents in Practice
Efficient external-memory bisimulation on DAGs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Computation of the greatest simulations and bisimulations between fuzzy automata
Fuzzy Sets and Systems
Deciding the bisimilarity relation between datalog goals
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Shall we juggle, coinductively?
CPP'12 Proceedings of the Second international conference on Certified Programs and Proofs
Weighted modal transition systems
Formal Methods in System Design
Regularities and dynamics in bisimulation reductions of big graphs
First International Workshop on Graph Data Management Experiences and Systems
Large-scale bisimulation of RDF graphs
Proceedings of the Fifth Workshop on Semantic Web Information Management
Generalizing simulation to abstract domains
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Nondeterministic automata: Equivalence, bisimulations, and uniform relations
Information Sciences: an International Journal
Electronic Notes in Theoretical Computer Science (ENTCS)
Adding coinduction into discrete mathematics
Journal of Computing Sciences in Colleges
| Hi-index | 0.01 |
The origins of bisimulation and bisimilarity are examined, in the three fields where they have been independently discovered: Computer Science, Philosophical Logic (precisely, Modal Logic), Set Theory. Bisimulation and bisimilarity are coinductive notions, and as such are intimately related to fixed points, in particular greatest fixed points. Therefore also the appearance of coinduction and fixed points is discussed, though in this case only within Computer Science. The paper ends with some historical remarks on the main fixed-point theorems (such as Knaster-Tarski) that underpin the fixed-point theory presented.