EUVIMEDEUVIMED entdecken
Crossref

Symbolic semantic rules for producing compact STGLAs from value passing process descriptions

Marco Bernardo

ACM Transactions on Computational Logic · 2004

DOI: 10.1145/1013560.1013563 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Computational Logic, 2004. Verfasst von Marco Bernardo. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 12 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Value passing process algebras with infinite data domains need to be equipped with symbolic semantic models in order for their analysis to be possible. This means that appropriate symbolic models and the related verification algorithms must be developed, together with suitable semantic rules mapping the value passing process descriptions to such symbolic models. In this article, we first introduce the model of the symbolic transition graphs with lookahead assignment (STGLAs), a variant of the symbolic transition graphs with assignment (STGAs) of Lin that can undergo to the strong, weak and observational bisimulation equivalence checking algorithms of Li and Chen. We then define a set of symbolic semantic rules that map a useful fragment of value passing CCS to finite STGLAs without making any assumption about the variable names. We demonstrate that the symbolic semantic rules are correct with respect to both the usual concrete semantic rules and the novel issue of the assignment application order. Finally, we prove that, for the considered fragment of value passing CCS, the STGLAs produced by the symbolic semantic rules are optimal with respect to a certain compactness criterion, thus improving on the symbolic models and the semantic rules previously proposed in the literature.

Zitieren

APA

Bernardo, M. (2004). Symbolic semantic rules for producing compact STGLAs from value passing process descriptions. ACM Transactions on Computational Logic. https://doi.org/10.1145/1013560.1013563

Vancouver

Bernardo M. Symbolic semantic rules for producing compact STGLAs from value passing process descriptions. ACM Transactions on Computational Logic. 2004. doi:10.1145/1013560.1013563

BibTeX
@article{Bernardo2004,
  author = {Bernardo, Marco},
  title = {Symbolic semantic rules for producing compact STGLAs from value passing process descriptions},
  journal = {ACM Transactions on Computational Logic},
  year = {2004},
  doi = {10.1145/1013560.1013563}
}
Kostenlos starten →