Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
Theoretical Computer Science
Congruent Weak Conformance, a Partial Order among Processes
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
A Faster-than Relation for Asynchronous Processes
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
A pi-calculus Process Semantics of Concurrent Idealised ALGOL
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Verifying Performance Equivalence for Timed Basic Parallel Processes
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Locality and Polyadicity in Asynchronous Name-Passing Calculi
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Communication Interference in Mobile Boxed Ambients
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Comparing the Efficiency of Asynchronous Systems
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
An Algebraic Theory of Process Efficiency
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Information and Computation
Bisimulation on speed: worst-case efficiency
Information and Computation
On asynchrony in name-passing calculi
Mathematical Structures in Computer Science
Formalising Java RMI with explicit code mobility
OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
Communication and mobility control in boxed ambients
Information and Computation
Bisimulation on speed: a unified approach
Theoretical Computer Science
New up-to techniques for weak bisimulation
Theoretical Computer Science
Synchrony vs Asynchrony in Communication Primitives
Electronic Notes in Theoretical Computer Science (ENTCS)
An Operational Semantics for Shared Messaging Communication
Electronic Notes in Theoretical Computer Science (ENTCS)
Formalising Java RMI with explicit code mobility
Theoretical Computer Science
Using bisimulation proof techniques for the analysis of distributed abstract machines
Theoretical Computer Science
Comparing communication primitives via their relative expressive power
Information and Computation
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
The Calculus of Handshake Configurations
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Counting the Cost in the Picalculus (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Communication and mobility control in boxed ambients
Information and Computation
Complete lattices and up-to techniques
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
Beyond bisimulation: the "up-to" techniques
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
A logical characterization of efficiency preorders
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Up-to techniques for weak bisimulation
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Bisimulation on speed: a unified approach
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Weak bisimulation up to elaboration
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
On decidability of prebisimulation for timed automata
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
| Hi-index | 0.00 |