The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Three partition refinement algorithms
SIAM Journal on Computing
UPPAAL—a tool suite for automatic verification of real-time systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Property specification patterns for finite-state verification
FMSP '98 Proceedings of the second workshop on Formal methods in software practice
Communications of the ACM
On Expressing and Monitoring Behaviour in Contracts
EDOC '02 Proceedings of the 6th International Enterprise Distributed Object Computing Conference
Bisimulation Minimization in an Automata-Theoretic Verification Framework
FMCAD '98 Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design
Fast LTL to Büchi Automata Translation
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
An n log n algorithm for minimizing states in a finite automaton
An n log n algorithm for minimizing states in a finite automaton
The business case for B2B e-contracting
ICEC '04 Proceedings of the 6th international conference on Electronic commerce
Web Service Discovery Based on Behavior Signatures
SCC '05 Proceedings of the 2005 IEEE International Conference on Services Computing - Volume 01
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Behavioral matchmaking for service retrieval
ICWS '06 Proceedings of the IEEE International Conference on Web Services
Similarity search for web services
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Reasoning about infinite computation paths
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Run-Time Monitoring of Electronic Contracts
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Querying structural and behavioral properties of business processes
DBPL'07 Proceedings of the 11th international conference on Database programming languages
ICWE'05 Proceedings of the 5th international conference on Web Engineering
Hi-index | 0.00 |
Considering a broad definition for service contracts (beyond web services and software, e.g. airline tickets and insurance policies), we tackle the challenges of building a high performance broker in which contracts are both specified and queried through their temporal behavior. The temporal dimension, in conjunction with traditional relational attributes, enables our system to better address difficulties arising from the great deal of information regarding the temporal interaction of the various events cited in contracts (e.g. "No refunds are allowed after a reschedule of the flight, which can be requested only before any flight leg has been used"). On the other hand, querying large repositories of temporal specifications poses an interesting indexing challenge. In this paper, we introduce two distinct and complementary indexing techniques that enable our system to scale the evaluation of a novel and theoretically sound notion of permission of a temporal query by a service contract. Our notion of permission is inspired by previous work on model checking but, given the specific characteristic of our problem, does not reduce to it. We evaluate experimentally our implementation, showing that it scales well with both the number and the complexity of the contracts.