CONCUR 2006 - PDF Preprint Papers

CONCUR 2006 Seminar on Concurrency

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CONCUR-2006 Paper

click to vote

CONCUR
2006
Springer

171views Distributed And Parallel Com...» more CONCUR 2006»

A Language for Task Orchestration and Its Semantic Properties

13 years 8 months ago

Download orc.csres.utexas.edu

Abstract. Orc is a new language for task orchestration, a form of concurrent programming with applications in workflow, business process management, and web service orchestration. ...

David Kitchin, William R. Cook, Jayadev Misra

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	171	A Language for Task Orchestration and Its Semantic Properties	claim
2	169	A Complete Axiomatic Semantics for the CSP Stable-Failures Model	claim
3	168	Model Checking Quantified Computation Tree Logic	claim
4	166	Controller Synthesis for MTL Specifications	claim
5	159	Strategy Improvement for Stochastic Rabin and Streett Games	claim
6	144	Concurrent Rewriting for Graphs with Equivalences	claim
7	133	A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems	claim
8	131	A New Type System for Deadlock-Free Processes	claim
9	129	Event Structure Semantics for Nominal Calculi	claim
10	128	Proving Liveness by Backwards Reachability	claim
11	127	Probabilistic I/O Automata: Theories of Two Equivalences	claim
12	121	Dynamic Access Control in a Concurrent Object Calculus	claim
13	117	A Capability Calculus for Concurrency and Determinism	claim
14	112	Reachability in Recursive Markov Decision Processes	claim
15	112	Probability and Nondeterminism in Operational Models of Concurrency	claim
16	112	Inference of Event-Recording Automata Using Timed Decision Trees	claim
17	104	Minimization, Learning, and Conformance Testing of Boolean Programs	claim
18	101	Modeling Timed Concurrent Systems	claim
19	96	Liveness, Fairness and Impossible Futures	claim
20	93	On Finite Alphabets and Infinite Bases III: Simulation	claim
21	91	Generic Forward and Backward Simulations	claim
22	89	Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words	claim
23	88	Sanity Checks in Formal Verification	claim
24	83	Weak Bisimulation Up to Elaboration	claim
25	81	Sortings for Reactive Systems	claim
26	80	On Interleaving in Timed Automata	claim
27	78	Some Remarks on Definability of Process Graphs	claim
28	66	Second-Order Simple Grammars	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers