15 search results - page 1 / 3 » Achieving Discrete Relative Timing with Untimed Process Alge... |
ICECCS
2007
IEEE
13 years 8 months ago
2007
IEEE
For many systems, timing aspects are essential. Therefore, when modelling these systems, time should somehow be represented. In the past, many timed process algebras have been dev...
CSFW
2000
IEEE
13 years 9 months ago
2000
IEEE
Some of the non interference properties studied in [4, 6, 18] for information flow analysis in computer systems, notably Æ , are reformulated here in a realtime setting. This is...
SAC
2006
ACM
13 years 11 months ago
2006
ACM
Most previous work on information flow in process algebras has been based on untimed models of concurrency. It is obvious, however, that an observer might well use time to gain i...
AMAST
2000
Springer
13 years 9 months ago
2000
Springer
In the paper we present an ACP-like process algebra which can be used to model both probabilistic and time behaviour of parallel systems. This process algebra is obtained by extens...
SFM
2004
Springer
13 years 10 months ago
2004
Springer
We treat theory and application of timed process algebra. We focus on a variant that uses explicit termination and action prefixing. This variant has some advantages over other va...