Sciweavers

925 search results - page 33 / 185
» Typing Component-Based Communication Systems
Sort
View
IFIP
2004
Springer
15 years 10 months ago
Ensuring Termination by Typability
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
Yuxin Deng, Davide Sangiorgi
128
Voted
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
15 years 9 months ago
The standard parts problem and the complexity of control communication
The objective of the standard parts optimal control problem is to find a number, m, of control inputs to a given input-output system that can be used in different combinations to...
John Baillieul, Wing Shing Wong
CODES
2006
IEEE
15 years 11 months ago
Bounded arbitration algorithm for QoS-supported on-chip communication
Time-critical multi-processor systems require guaranteed services in terms of throughput, bandwidth etc. in order to comply to hard real-time constraints. However, guaranteedservi...
Mohammad Abdullah Al Faruque, Gereon Weiss, Jö...
MFCS
2004
Springer
15 years 10 months ago
Boxed Ambients with Communication Interfaces
We define BACI (Boxed Ambients with Communication Interfaces), an ambient calculus with a flexible communication policy. Traditionally, typed ambient calculi have a fixed commu...
Eduardo Bonelli, Adriana B. Compagnoni, Mariangiol...
ICFEM
1997
Springer
15 years 8 months ago
Refinement of Information Flow Architectures
A calculus is presented for the stepwise refinement of abstract information flow architectures. We give a mathematical model for information flow components based on relations bet...
Jan Philipps, Bernhard Rumpe