4353 search results - page 3 / 871 » Expressiveness of Process Algebras |
ENTCS
2006
13 years 5 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...
ENTCS
2007
13 years 5 months ago
2007
Process algebras are standard formalisms for compositionally describing systems by the dependencies of their observable synchronous communication. In concurrent systems, parallel ...
JCSS
2008
13 years 5 months ago
2008
Internet worms are classically described using SIR models and simulations, to capture the massive dynamics of the system. Here we are able to generate a differential equation-base...
ECSA
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Architectural description languages are a useful tool for modmplex software systems at a high level of abstraction and, if based on formal methods, for enabling the early...
ENTCS
2006
13 years 5 months ago
2006
The three classical process algebras CCS, CSP and ACP present several differences in their respective technical machinery. This is due, not only to the difference in their operato...