CONCUR
1991
Springer
13 years 8 months ago
1991
Springer
We propose a process algebra obtained by adapting the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, 2002, Chap....
EEF
2000
13 years 8 months ago
2000
This paper surveys and relates the basic concepts of process algebra and the modelling of continuous time Markov chains. It provides
COMPSAC
2004
IEEE
13 years 8 months ago
2004
IEEE
Many developers who could benefit from building and analysing formal models of their systems are deterred from doing so by the process algebra style input languages of formal mode...
ACSD
2006
IEEE
13 years 8 months ago
2006
IEEE
Asynchronous circuits have received much attention recently due to their potential for energy savings. Process algebras have been extensively used in the modelling, analysis and sy...
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...
FMICS
2009
Springer
13 years 8 months ago
2009
Springer
In this paper we show how Rate Transition Systems (RTSs) can be used as a unifying framework for the definition of the semantics of stochastic process algebras. RTSs facilitate the...
LPNMR
1990
Springer
13 years 8 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
SOSL
1993
13 years 8 months ago
1993
In this paper we study automatic veri cation of proofs in process algebra. Formulas of process algebra are represented by types in typed -calculus. Inhabitants (terms) of these ty...
ICFP
1996
ACM
13 years 9 months ago
1996
ACM
Concurrent ML (CML) is an extension of Standard ML of New Jersey with concurrent features similar to those of process algebra. In this paper, we build upon John Reppy's reduc...
CONCUR
1998
Springer
13 years 9 months ago
1998
Springer
PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest viewing PA-processes as trees, and using treeautomata technique...