CORR 2009 - PDF Preprint Papers

CORR 2009 Workshop on Service Oriented Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CORR-2009 Paper

click to vote

CORR
2009
Springer

242views Education» more CORR 2009»

Adaptive Scheduling of Data Paths using Uppaal Tiga

13 years 10 months ago

Download www.win.tue.nl

Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...

Israa AlAttili, Fred Houben, Georgeta Igna, Steffe...

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	242	Adaptive Scheduling of Data Paths using Uppaal Tiga	claim
2	137	Choreographies with Secure Boxes and Compromised Principals	claim
3	117	Automated Predicate Abstraction for Real-Time Models	claim
4	115	Testing the Equivalence of Regular Languages	claim
5	115	Bigraphical models for protein and membrane interactions	claim
6	114	Distributed Branching Bisimulation Minimization by Inductive Signatures	claim
7	109	Extensional and Intensional Strategies	claim
8	108	Adaptive Process Management in Highly Dynamic and Pervasive Scenarios	claim
9	106	A framework for protein and membrane interactions	claim
10	101	BioDiVinE: A Framework for Parallel Analysis of Biological Models	claim
11	100	Programming Idioms for Transactional Events	claim
12	99	Quotient Complexity of Regular Languages	claim
13	99	A compartmental model of the cAMP/PKA/MAPK pathway in Bio-PEPA	claim
14	95	Execution Models for Choreographies and Cryptoprotocols	claim
15	92	A Constraint-directed Local Search Approach to Nurse Rostering Problems	claim
16	92	Fair Exchange in Strand Spaces	claim
17	91	On the Number of Membranes in Unary P Systems	claim
18	88	An Inverse Method for Policy-Iteration Based Algorithms	claim
19	87	A Concurrent Language with a Uniform Treatment of Regions and Locks	claim
20	86	Studying Maximum Information Leakage Using Karush-Kuhn-Tucker Conditions	claim
21	86	Stream Productivity by Outermost Termination	claim
22	86	Rewriting Logic Semantics of a Plan Execution Language	claim
23	85	DiVinE-CUDA - A Tool for GPU Accelerated LTL Model Checking	claim
24	85	Type Inference for Deadlock Detection in a Multithreaded Polymorphic Typed Assembly Language	claim
25	85	Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems	claim
26	84	A User Model for Information Erasure	claim
27	80	A Type System for a Stochastic CLS	claim
28	80	Resource-Bound Quantification for Graph Transformation	claim
29	79	Characteristic Formulae for Fixed-Point Semantics: A General Framework	claim
30	79	Modelling an Ammonium Transporter with SCLS	claim
31	78	Hybrid Semantics of Stochastic Programs with Dynamic Reconfiguration	claim
32	76	An Improved Algorithm for Generating Database Transactions from Relational Algebra Specifications	claim
33	74	A Process Calculus for Molecular Interaction Maps	claim
34	74	Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs	claim
35	71	Heuristic Methods for Security Protocols	claim
36	71	Uniqueness Typing for Resource Management in Message-Passing Concurrency	claim
37	70	Causality in the Semantics of Esterel: Revisited	claim
38	70	A Type System for Tom	claim
39	69	Extending Context-Sensitivity in Term Rewriting	claim
40	68	How to Work with Honest but Curious Judges? (Preliminary Report)	claim
41	68	On the Interpretation of Delays in Delay Stochastic Simulation of Biological Systems	claim
42	68	How Creative Should Creators Be To Optimize the Evolution of Ideas? A Computational Model	claim
43	67	On Measuring Non-Recursive Trade-Offs	claim
44	67	Principal Typings in a Restricted Intersection Type System for Beta Normal Forms with De Bruijn Indices	claim
45	67	Towards the Safe Programming of Wireless Sensor Networks	claim
46	66	Mutation of Directed Graphs -- Corresponding Regular Expressions and Complexity of Their Generation	claim
47	64	A non-interleaving process calculus for multi-party synchronisation	claim
48	63	Modal Logic and the Approximation Induction Principle	claim
49	63	A Type System for Required/Excluded Elements in CLS	claim
50	63	An Intuitive Automated Modelling Interface for Systems Biology	claim
51	63	Integrated Structure and Semantics for Reo Connectors and Petri Nets	claim
52	62	Towards an embedding of Graph Transformation in Intuitionistic Linear Logic	claim
53	60	On Languages Accepted by P/T Systems Composed of joins	claim
54	59	Markovian Testing Equivalence and Exponentially Timed Internal Actions	claim
55	55	Security Theorems via Model Theory	claim
56	54	Session Types at the Mirror	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers