Towards verification of computation orchestration
From MaRDI portal
Publication:736807
Recommendations
Cites work
- scientific article; zbMATH DE number 1696471 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1296290 (Why is no real title available?)
- scientific article; zbMATH DE number 1512619 (Why is no real title available?)
- scientific article; zbMATH DE number 2143087 (Why is no real title available?)
- A Language for Task Orchestration and Its Semantic Properties
- A brief history of Timed CSP
- A denotational semantical model for Orc language
- A theory of timed automata
- A timed semantics of Orc
- CONCUR 2005 – Concurrency Theory
- Executable rewriting logic semantics of Orc and formal analysis of Orc programs
- Integrated Formal Methods
- Logic Programming
- Model-checking for real-time systems
- Modeling and model checking web services
- Symbolic model checking for real-time systems
- Timed CSP = closed timed automata
- Uppaal in a nutshell
Cited in
(10)- Abstract Processes in Orchestration Languages
- scientific article; zbMATH DE number 1701756 (Why is no real title available?)
- Simulation Using Orchestration
- Comparing goal-oriented and procedural service orchestration
- SHIP -- a logic-based language and tool to program smart environments
- The computational complexity of QoS measures for orchestrations. The computational complexity of QoS measures
- A formal framework for specifying and verifying microservices based process flows
- Executable rewriting logic semantics of Orc and formal analysis of Orc programs
- A timed semantics of Orc
- A UTP semantic model for Orc language with execution status and fault handling
This page was built for publication: Towards verification of computation orchestration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q736807)