Three partition refinement algorithms
SIAM Journal on Computing
A calculus of mobile processes, II
Information and Computation
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
An Automated Based Verification Environment for Mobile Processes
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
A First Order Coalgebraic Model of pi-Calculus Early Observational Equivalence
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Checking Bisimilarity for Finitary pi-Calculus
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
History-Dependent Automata
A model-checking verification environment for mobile processes
ACM Transactions on Software Engineering and Methodology (TOSEM)
About permutation algebras, (pre)sheaves and named sets
Higher-Order and Symbolic Computation
Coalgebraic minimization of HD-automata for the π-calculus using polymorphic types
Theoretical Computer Science - Formal methods for components and objects
Structured coalgebras and minimal HD-automata for the π-calculus
Theoretical Computer Science - Mathematical foundations of computer science 2000
A Name Abstraction Functor for Named Sets
Electronic Notes in Theoretical Computer Science (ENTCS)
Modelling fusion calculus using HD-Automata
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
| Hi-index | 0.00 |
We use History Dependent Automata(HD-Automata) as a syntax-indepentend formalism to check compatibility of services at binding time in Service-Oriented Computing.Informally speaking, service requests are modelled as pairs of HD-Automata $\langle{C_o,C_r}\rangle$; Crdescribes the (abstract) behaviour of the searched service and Cothe (abstract) behaviour guaranteed by the invoker. Symmetrically, service publication consists of a pair of HD-Automata $\langle{S_o,S_r}\rangle$ such that Soprovides an (abstraction of) of the behaviour guaranteed by the service and Sryields the requirement imposed to invokers. An invocation $\langle{C_o,C_r}\rangle$ matches a published interface $\langle{S_o,S_r}\rangle$ when Cosimulates Srand Sosimulates Cr.