Communicating sequential processes
Communicating sequential processes
Submodule construction as equation solving in CCS
Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Synthesis of finite state machines: logic optimization
Synthesis of finite state machines: logic optimization
On the Construction of Submodule Specifications and Communication Protocols
ACM Transactions on Programming Languages and Systems (TOPLAS)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Advanced Component Interface Specification
TPPP '94 Proceedings of the International Workshop on Theory and Practice of Parallel Programming
Solving Asynchronous Equations
FORTE XI / PSTV XVIII '98 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XI) and Protocol Specification, Testing and Verification (PSTV XVIII)
Submodule Construction and Supervisory Control: A Generalization
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Theory of Relational Databases
Theory of Relational Databases
The Simplification of Sequential Machines with Input Restrictions
IEEE Transactions on Computers
Proofs of Networks of Processes
IEEE Transactions on Software Engineering
Testing in context: framework and test derivation
Computer Communications
Testing Systems Specified as Partial Order Input/Output Automata
TestCom '08 / FATES '08 Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop
Scenario-based component behavior derivation
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
Submodule construction for extended state machine models
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Using logic to solve the submodule construction problem
Discrete Event Dynamic Systems
| Hi-index | 0.00 |
We consider the following problem: For a system consisting of two submodules, the behavior of one submodule is known as well as the desired behavior S of the global system. What should be the behavior of the second submodule such that the behavior of the composition of the two submodules conforms to S? - Solutions to this problem have been described in the context of various specification formalisms and various conformance relations. Here we present a generalization of this problem and its solution in the context of relational databases, and show that this general solution can be used to derive several of the known algorithms that solve the problem in the context of regular behavior specifications based on finite state automata with synchronous communication or interleaving semantics. The paper also provides a new solution formula for the case that the module behaviors are specified in a hypothesis-guarantee paradigm distinguishing between input and output. A new submodule construction algorithm for synchronous, partially defined input/output automata is also given.