Towards verification of computation orchestration

DOI10.1007/s00165-013-0280-9zbMath1342.68209OpenAlexW2138133565MaRDI QIDQ736807

Xian Zhang, Jun Sun, Yang Liu, Jin-Song Dong

Publication date: 5 August 2016

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://ink.library.smu.edu.sg/sis_research/4977

zbMATH Keywords

verificationtimed automataconstraint logic programmingweb service orchestration\(\mathrm{CLP}(R)\)OrcUppaal

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17) Internet topics (68M11)

Related Items (2)

The computational complexity of QoS measures for orchestrations. The computational complexity of QoS measures ⋮ Executable rewriting logic semantics of Orc and formal analysis of Orc programs

Uses Software

• LoLA
• Uppaal
• Dist-Orc
• LTSA-WS
• PAT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A brief history of Timed CSP
• A timed semantics of Orc
• A theory of timed automata
• Symbolic model checking for real-time systems
• Uppaal in a nutshell
• Executable rewriting logic semantics of Orc and formal analysis of Orc programs
• Timed CSP = Closed Timed Automata1
• A Denotational Semantical Model for Orc Language
• Model-checking for real-time systems
• Logic Programming
• A Language for Task Orchestration and Its Semantic Properties
• CONCUR 2005 – Concurrency Theory
• Integrated Formal Methods

This page was built for publication: Towards verification of computation orchestration