Sciweavers

2171 search results - page 212 / 435
» A Generic Process Algebra
Sort
View
LICS
1994
IEEE
15 years 10 months ago
Foundations of Timed Concurrent Constraint Programming
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of pro...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta
CONCUR
1993
Springer
15 years 10 months ago
Modular Completeness for Communication Closed Layers
The Communication Closed Layers law is shown to be modular complete for a model related to that of Mazurkiewicz. It is shown that in a modular style of program development the CCL...
Maarten M. Fokkinga, Mannes Poel, Job Zwiers
CASC
2006
Springer
106views Mathematics» more  CASC 2006»
15 years 10 months ago
Simplicial Perturbation Techniques and Effective Homology
In this paper, we deal with the problem of the computation of the homology of a finite simplicial complex after an "elementary simplicial perturbation" process such as th...
Rocío González-Díaz, Bel&eacu...
CMSB
2006
Springer
15 years 10 months ago
Stronger Computational Modelling of Signalling Pathways Using Both Continuous and Discrete-State Methods
Abstract. Starting from a biochemical signalling pathway model expressed in a process algebra enriched with quantitative information we automatically derive both continuous-space a...
Muffy Calder, Adam Duguid, Stephen Gilmore, Jane H...
CONCUR
2006
Springer
15 years 10 months ago
On Finite Alphabets and Infinite Bases III: Simulation
This paper studies the (in)equational theory of simulation preorder and equivalence over the process algebra BCCSP. We prove that in the presence of a finite alphabet with at least...
Taolue Chen, Wan Fokkink