From rewrite rules to bisimulation congruences
Theoretical Computer Science
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Comparison of Process Algebra Equivalences Using Formats
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Open Ended Systems, Dynamic Bisimulation and Tile Logic
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Concurrent Constraint Programming with Process Mobility
CL '00 Proceedings of the First International Conference on Computational Logic
A format for semantic equivalence comparison
Theoretical Computer Science
Observational congruences for dynamically reconfigurable tile systems
Theoretical Computer Science - Process algebra
Notions of bisimulation and congruence formats for SOS with data
Information and Computation
SOS for higher order processes
CONCUR 2005 - Concurrency Theory
Transition systems, link graphs and Petri nets
Mathematical Structures in Computer Science
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
On Well-Foundedness and Expressiveness of Promoted Tyft
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
A congruence rule format for name-passing process calculi
Information and Computation
A Hierarchy of SOS Rule Formats
Electronic Notes in Theoretical Computer Science (ENTCS)
A Congruence Format for Name-passing Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Notions of bisimulation and congruence formats for SOS with data
Information and Computation
Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
Information and Computation
Modular bisimulation theory for computations and values
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.01 |