Sciweavers

188 search results - page 14 / 38
» Forgetting the Time in Timed Process Algebra
Sort
View
FORTE
2004
13 years 10 months ago
Symbolic Performance and Dependability Evaluation with the Tool CASPA
This paper describes the tool CASPA, a new performance evaluation tool which is based on a Markovian stochastic process algebra. CASPA uses multi-terminal binary decision diagrams ...
Matthias Kuntz, Markus Siegle, Edith Werner
TCOS
2008
13 years 8 months ago
On Contemporary Denotational Mathematics for Computational Intelligence
Denotational mathematics is a category of expressive mathematical structures that deals with high-level mathematical entities beyond numbers and sets, such as abstract objects, com...
Yingxu Wang
JLP
2006
113views more  JLP 2006»
13 years 8 months ago
Continuity controlled hybrid automata
We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of hybrid automata of Henzinger et al. We give interpreta...
Jan A. Bergstra, C. A. Middelburg
CALCO
2007
Springer
112views Mathematics» more  CALCO 2007»
14 years 2 months ago
Impossibility Results for the Equational Theory of Timed CCS
We study the equational theory of Timed CCS as proposed by Wang Yi in CONCUR’90. Common to Wang Yi’s paper, we particularly focus on a class of linearly-ordered time domains ex...
Luca Aceto, Anna Ingólfsdóttir, Moha...
ICLP
2003
Springer
14 years 1 months ago
Concurrency, Time, and Constraints
Concurrent constraint programming (ccp) is a model of concurrency for systems in which agents (also called processes) interact with one another by telling and asking information in...
Frank D. Valencia