Communicating sequential processes
Communicating sequential processes
Theoretical Computer Science
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
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
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Communication and Concurrency
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
A Proof System for Timed Automata
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
A Real-Time Animator for Hybrid Systems
LCTES '00 Proceedings of the ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems
Code synthesis for timed automata
Nordic Journal of Computing
Model checking for π-calculus using proof search
CONCUR 2005 - Concurrency Theory
A Survey of Formal Verification for Business Process Modeling
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part II
Efficient online monitoring of web-service SLAs
Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering
Synthesis of web services orchestrators in a timed setting
WS-FM'07 Proceedings of the 4th international conference on Web services and formal methods
Event structure semantics of Orc
WS-FM'07 Proceedings of the 4th international conference on Web services and formal methods
Verification of orchestration systems using compositional partial order reduction
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Model checking with fairness assumptions using PAT
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
Recently, a promising programming model called Orc has been proposed to support a structured way of orchestrating distributed web services. Orc is intuitive because it offers concise constructors to manage concurrent communication, time-outs, priorities, failure of sites or communication and so forth. The semantics of Orc is also precisely defined. However, there is no verification tool available to verify critical properties against Orc models. Instead of building one from scratch, we believe the existing mature model-checkers can be reused. In this work, we first define a Timed Automata semantics for the Orc language, which we prove is semantically equivalent to the original operational semantics of Orc. Consequently, Timed Automata models are systematically constructed from Orc models. The practical implication of the construction is that tool supports for Timed Automata, e.g., Uppaal, can be used to model check Orc models. An experimental tool is implemented to automate our approach.