ICALP
2000
Springer
15 years 7 months ago
2000
Springer
117
click to vote
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...
116
click to vote
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
We introduce a generic type system (based on Milner's sort system) for the synchronous polyadic -calculus, allowing us to mechanise the analysis of input/output capabilities o...
138
click to vote
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
116
click to vote
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
In this paper, we recall how the syntax of diagrams is captured by the diagram editor generator DIAGEN, and outline a visual, rule-based, and objectoriented programming language b...