Predicate calculus and program semantics
Predicate calculus and program semantics
Theoretical Computer Science
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
Simulation, verification and automated composition of web services
Proceedings of the 11th international conference on World Wide Web
Minimum-Cost Reachability for Priced Timed Automata
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Optimal Paths in Weighted Timed Automata
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Describing and Reasoning on Web Services using Process Algebra
ICWS '04 Proceedings of the IEEE International Conference on Web Services
Model Checking Timed Systems with Priorities
RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Optimal reachability for multi-priced timed automata
Theoretical Computer Science
Applied Ontology
REMES: A Resource Model for Embedded Systems
ICECCS '09 Proceedings of the 2009 14th IEEE International Conference on Engineering of Complex Computer Systems
Beyond soundness: on the verification of semantic business process models
Distributed and Parallel Databases
REMES tool-chain: a set of integrated tools for behavioral modeling and analysis of embedded systems
Proceedings of the IEEE/ACM international conference on Automated software engineering
Modeling and reasoning about service behaviors and their compositions
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
Non-functional properties in the model-driven development of service-oriented systems
Software and Systems Modeling (SoSyM)
Model checking timed automata with priorities using DBM subtraction
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Automatic translation of WS-CDL choreographies to timed automata
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
| Hi-index | 0.00 |
Service-Oriented Systems (SOS) have gained importance in different application domains thanks to their ability to enable reusable functionality provided via well-defined interfaces, and the increased opportunities to compose existing units, called services, into various configurations. Developing applications in such a setup, by reusing existing services, brings some concerns regarding the assurance of the expected Quality-of-Service (QoS), and correctness of the employed services. In this paper, we describe a formal mechanism of computing service guarantees, automatically. We assume service models annotated with pre- and postconditions, with their semantics given as Priced Timed Automata (PTA), and the forward analysis method for checking the service correctness w.r.t. given requirements. Under these assumptions, we show how to compute the strongest postcondition of the corresponding automata algorithmically, with respect to the specified precondition. The approach is illustrated on a small example of a service modeled as Priced Timed Automaton (PTAn).