Parallel complexity in the design and analysis of concurrent systems
PARLE '91 Proceedings on Parallel architectures and languages Europe : volume I: parallel architectures and algorithms: volume I: parallel architectures and algorithms
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Modal logic
Dynamic Logic
Games for synthesis of controllers with partial observation
Theoretical Computer Science - Logic and complexity in computer science
Counterexample-guided abstraction refinement for symbolic model checking
Journal of the ACM (JACM)
Synthesis of underspecified composite e-services based on automated reasoning
Proceedings of the 2nd international conference on Service oriented computing
Automatic composition of transition-based semantic web services with messaging
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Automated composition of web services by planning at the knowledge level
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A lower bound on web services composition
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Automatic behavior composition synthesis
Artificial Intelligence
Hi-index | 0.00 |
The present paper is interested in the following decision problems: (1) given finite frames F, F^', determine if there exists a frame F^'' such that F and F^'@?F^'', the synchronous product of F^' and F^'', are bisimilar; (2) given finite frames F, F^', determine if there exists a frame F^'' such that F and F^'@?F^'', the asynchronous product of F^' and F^'', are bisimilar. It shows that variants of the filtration method are adequate for solving them.