Communicating sequential processes
Communicating sequential processes
Weak and strong fairness in CCS
Information and Computation
A timed model for communicating sequential processes
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
A temporal calculus of communicating systems
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
A semantic approach to fairness
Fundamenta Informaticae
A compositional approach to performance modelling
A compositional approach to performance modelling
A process algebra of communicating shared resources with dense time and priorities
Theoretical Computer Science
Process algebra for performance evaluation
Theoretical Computer Science
The verification of an industrial payment protocol: the SET purchase phase
Proceedings of the 9th ACM conference on Computer and communications security
Acceptance Trees for Probabilistic Processes
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
A Sound and Complete Proof System for Probabilistic Processes
ARTS '97 Proceedings of the 4th International AMAST Workshop on Real-Time Systems and Concurrent and Distributed Software: Transformation-Based Reactive Systems Development
A Formal Specification and Performance Evaluation of the Purchase Phase in the SET Protocol
SYNASC '05 Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
A protocol for secure transactions
WOEC'96 Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2
Verifying the SET registration protocols
IEEE Journal on Selected Areas in Communications
Privacy-preserving e-payments using one-time payment details
Computer Standards & Interfaces
Enabling privacy-preserving e-payment processing
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
| Hi-index | 0.00 |
A formal specification of the purchase phase in the SET protocol (Secure Electronic Transaction), an e-commerce protocol by Visa and MasterCard, is presented. It is modelled by means of a True Concurrency Timed Process Algebra called BTC which takes into account that the (limited amount of) available resources in a system have to be shared by all the processes. We have considered heterogeneous resources and we extend the algebra with the intention of representing the actions which use the shared resources and how many resources of each type the system has at its disposal.