TCS
2010
13 years 6 months ago
2010
Markovian process algebras, such as PEPA and stochastic -calculus, bring a powerful compositional approach to the performance modelling of complex systems. However, the models gen...
ENTCS
2010
13 years 8 months ago
2010
We introduce Process Algebra with Hooks (PAH). In PAH processes represent different layers action, from biochemistry to tissue, and special synchronisations via hook actions ensur...
APIN
1998
13 years 11 months ago
1998
Process algebra are formal languages used for the rigorous specification and analysis of concurrent systems. By using a process algebra as the target language of a genetic program...
FUIN
2002
13 years 11 months ago
2002
The possibility of two or more actions to be performed consecutively at the same point in time is not excluded in the process algebras from the framework of process algebras with t...
CUZA
2002
13 years 11 months ago
2002
This paper presents Process Algebra for Predictible Control Systems (PAPCS) as a model for specifying and analysis of concurrent, time and resource dependent, distributed control s...
JLP
2007
13 years 11 months ago
2007
We present a process algebra with conditional expressions of which the conditions concern the enabledness of actions in the context in which a process is placed. With those conditi...
JUCS
2006
13 years 11 months ago
2006
: Emerging interaction paradigms, such as service-oriented computing, and new technological challenges, such as exogenous component coordination, suggest new roles and application ...
ENTCS
2007
13 years 11 months ago
2007
In the context of process algebras it is customary to define semantics in the form of a reaction relation supported by a structural congruence relation. Recently process algebras...
JLP
2006
13 years 11 months ago
2006
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...
ENTCS
2006
13 years 11 months ago
2006
A process is extensionally deterministic if, after any trace s and given any event a, it is either certain to accept or certain to refuse a (stably) after s. We show how several p...