Petri nets: an introduction
The Cellar Principle of State Transition and Storage Allocation
IEEE Annals of the History of Computing - Special issue on the history of computing in France—machines
Design and validation of computer protocols
Design and validation of computer protocols
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
TCP/IP illustrated (vol. 1): the protocols
TCP/IP illustrated (vol. 1): the protocols
Regular types for active objects
OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
A behavioral notion of subtyping
ACM Transactions on Programming Languages and Systems (TOPLAS)
Protocol specifications and component adaptors
ACM Transactions on Programming Languages and Systems (TOPLAS)
A formal basis for architectural connection
ACM Transactions on Software Engineering and Methodology (TOSEM)
Specification matching of software components
ACM Transactions on Software Engineering and Methodology (TOSEM)
Component software: beyond object-oriented programming
Component software: beyond object-oriented programming
Regularity and Related Problems for Deterministic Pushdown Automata
Journal of the ACM (JACM)
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computer
Proceedings of the Workshop on Object-Oriented Technology
Dynamically Adapting the Behaviour of Software Components
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
Generating adapters for concurrent component protocol synchronisation
FMOODS '02 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems V
Enhanced Component Interfaces to Support Dynamic Adaption and Extension
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
Bounding Component Behavior via Protocols
TOOLS '99 Proceedings of the Technology of Object-Oriented Languages and Systems
Decision Procedures for Families of Deterministic Pushdown Automata
Decision Procedures for Families of Deterministic Pushdown Automata
Computation: finite and infinite machines
Computation: finite and infinite machines
Automatic Protocol Conformance Checking of Recursive and Parallel Component-Based Systems
CBSE '08 Proceedings of the 11th International Symposium on Component-Based Software Engineering
Model Checking of Component Protocol Conformance -- Optimizations by Reducing False Negatives
Electronic Notes in Theoretical Computer Science (ENTCS)
A model of components with non-regular protocols
SC'05 Proceedings of the 4th international conference on Software Composition
Automatic checking of component protocols in component-based systems
SC'06 Proceedings of the 5th international conference on Software Composition
| Hi-index | 0.00 |
This paper deals with the specification of software component protocols (i. e., the set of service call sequences). The contribution of this paper is twofold: (a) We discuss specific requirements of real-world protocols, especially in the presence of components which make use of limited resources. (b) We define counter-constrained finite state machines, a novel extension of finite state machines, specifically created to model protocols containing dependencies between services due to their access to shared resources. Opposed to other approaches like classical finite state machines, this newmo del combines two valuable properties: (a) it is powerful enough to model realistic component protocols with resource allocation, -usage, and -deallocation dependencies between methods (as occurring in common abstract data-types such as stacks or queues) and (b) allows efficient checking of interoperability and substitutability.