Name
Abstract | ||
|---|---|---|
Process algebras formalism is highly suitable for producing succinct descriptions of reactive concurrent systems. Process algebras allow to represent them in a compositional way, as processes that run in parallel and interact, for example, through synchronisation or message passing. On the other hand, checking properties on process algebraic descriptions is often hard, while “unfolding” them into the Labelled Transition Systems can lead to the infamous state space explosion problem. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.jlap.2012.03.011 | The Journal of Logic and Algebraic Programming |
Keywords | Field | DocType |
Process algebras,Data Flow Analysis,Pathway Analysis,IMC | Transition system,Discrete mathematics,Static analysis,Data-flow analysis,Reachability,Theoretical computer science,State space,Abstract process,Mathematics,Message passing,Bounded function | Journal |
Volume | Issue | ISSN |
81 | 4 | 1567-8326 |
Citations | PageRank | References |
1 | 0.63 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nataliya Skrypnyuk | 1 | 2 | 1.35 |
| flemming nielson | 2 | 1769 | 172.05 |
| henrik pilegaard | 3 | 100 | 7.73 |