Name
Title | ||
|---|---|---|
Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet |
Abstract | ||
|---|---|---|
This note shows that the complete and the ready simulation preorders do not have a finite inequational basis over the language BCCSP when the set of actions is a singleton. Moreover, the equivalences induced by those preorders do not have a finite (in)equational axiomatization either. These results are in contrast with a claim of finite axiomatizability for those semantics in the literature, which was based on the erroneous assumption that they coincide with complete trace semantics in the presence of a singleton set of actions. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.ipl.2011.01.015 | Inf. Process. Lett. |
Keywords | Field | DocType |
ready simulation semantics,erroneous assumption,language bccsp,singleton alphabet,equational axiomatization,finite inequational basis,ready simulation preorders,complete trace semantics,finite axiomatizability,concurrency,process algebra,equational logic | Discrete mathematics,Combinatorics,Information processing,Concurrency,Equational logic,Singleton,Process calculus,Semantics,Mathematics,Alphabet | Journal |
Volume | Issue | ISSN |
111 | 9 | 0020-0190 |
Citations | PageRank | References |
2 | 0.37 | 16 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luca Aceto | 1 | 1125 | 101.87 |
| David de Frutos Escrig | 2 | 160 | 14.18 |
| Carlos Gregorio-rodríguez | 3 | 104 | 12.01 |
| Anna Ingolfsdottir | 4 | 39 | 4.89 |