Name
Abstract | ||
|---|---|---|
A procedure is given for extracting from a GSOS specification of an arbitrary process algebra a complete axiom system for bisimulation equivalence (equational, except for possibly one conditional equation). The methods apply to almost all SOSs for process algebras that have appeared in the literature, and the axiomatizations compare reasonably well with most axioms that have been presented. In particular, they discover the L characterization of parallel composition. It is noted that completeness results for equational axiomatizations are tedious and have become rather standard in many cases. A generalization of extant completeness results shows that in principle this burden can be completely removed if one gives a GSOS description of a process algebra |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1006/inco.1994.1040 | Information and Computation/information and Control |
Keywords | DocType | Volume |
turning sos rule,computer science,formal languages,logic,process algebra,algebra,hardware | Conference | 111 |
Issue | ISSN | Citations |
1 | Information and Computation | 80 |
PageRank | References | Authors |
3.77 | 16 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luca Aceto | 1 | 1125 | 101.87 |
| Bard Bloom | 2 | 664 | 56.46 |
| Frits Vaandrager | 3 | 1571 | 105.12 |