Information and Computation
ACM Transactions on Computational Logic (TOCL)
An omega-Complete Equational Specification of Interleaving
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
A format for semantic equivalence comparison
Theoretical Computer Science
Varieties generated by languages with poset operations
Mathematical Structures in Computer Science
Relating communicating processes with different interfaces
Fundamenta Informaticae
Decomposition orders: another generalisation of the fundamental theorem of arithmetic
Theoretical Computer Science - Process algebra
Behaviour Abstraction for Communicating Sequential Processes
Fundamenta Informaticae
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
Concurrency, Graphs and Models
Compositional Properties of Sequential Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Using coupled simulations in non-atomic refinement
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
A non-interleaving denotational semantics of value passing CCS with action refinement
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Implementing cryptographic primitives in the symbolic model
NFM'11 Proceedings of the Third international conference on NASA Formal methods
A timed calculus for wireless systems
Theoretical Computer Science
A timed calculus for wireless systems
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
On using syntactic action refinement to derive compositionally a timed efficient implementation
FAC-RW'96 Proceedings of the BCS-FACS 7th conference on Refinement
Relating Communicating Processes with Different Interfaces
Fundamenta Informaticae
Behaviour Abstraction for Communicating Sequential Processes
Fundamenta Informaticae
Full Abstractness of a Metric Semantics for Action Refinement
Fundamenta Informaticae
On the Decidability of Non-Interleaving Process Equivalences
Fundamenta Informaticae
Hi-index | 0.00 |