Approximating Markovian testing equivalence
Saved in:
| Title: | Approximating Markovian testing equivalence |
|---|---|
| Authors: | Aldini, Alessandro1 aldini@sti.uniurb.it |
| Source: | Theoretical Computer Science. Jan2012, Vol. 413 Issue 1, p73-86. 14p. |
| Subjects: | Algebraic topology, Markov processes, Orthogonal functions, Approximation theory, Bisimulation, Model theory |
| Abstract: | Abstract: Several approaches have been proposed to relax behavioral equivalences for fine-grain models including probabilities and time. All of them face two problems behind the notion of approximation, i.e., the lack of transitivity and the efficiency of the verification algorithm. While the typical equivalence under approximation is bisimulation, we present a relaxation of Markovian testing equivalence in a process algebraic framework. In this coarser setting, we show that it is particularly intuitive to manage separately three different dimensions of the approximation–execution time, event probability, and observed behavior–by illustrating in each case, results concerning the two problems mentioned above. Finally, a unified definition combining the three orthogonal aspects is provided in order to favor trade-off analyses. [Copyright &y& Elsevier] |
| Copyright of Theoretical Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 67625702 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Approximating Markovian testing equivalence – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Aldini%2C+Alessandro%22">Aldini, Alessandro</searchLink><relatesTo>1</relatesTo><i> aldini@sti.uniurb.it</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Theoretical+Computer+Science%22">Theoretical Computer Science</searchLink>. Jan2012, Vol. 413 Issue 1, p73-86. 14p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Algebraic+topology%22">Algebraic topology</searchLink><br /><searchLink fieldCode="DE" term="%22Markov+processes%22">Markov processes</searchLink><br /><searchLink fieldCode="DE" term="%22Orthogonal+functions%22">Orthogonal functions</searchLink><br /><searchLink fieldCode="DE" term="%22Approximation+theory%22">Approximation theory</searchLink><br /><searchLink fieldCode="DE" term="%22Bisimulation%22">Bisimulation</searchLink><br /><searchLink fieldCode="DE" term="%22Model+theory%22">Model theory</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Abstract: Several approaches have been proposed to relax behavioral equivalences for fine-grain models including probabilities and time. All of them face two problems behind the notion of approximation, i.e., the lack of transitivity and the efficiency of the verification algorithm. While the typical equivalence under approximation is bisimulation, we present a relaxation of Markovian testing equivalence in a process algebraic framework. In this coarser setting, we show that it is particularly intuitive to manage separately three different dimensions of the approximation–execution time, event probability, and observed behavior–by illustrating in each case, results concerning the two problems mentioned above. Finally, a unified definition combining the three orthogonal aspects is provided in order to favor trade-off analyses. [Copyright &y& Elsevier] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Theoretical Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=67625702 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1016/j.tcs.2011.07.019 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 14 StartPage: 73 Subjects: – SubjectFull: Algebraic topology Type: general – SubjectFull: Markov processes Type: general – SubjectFull: Orthogonal functions Type: general – SubjectFull: Approximation theory Type: general – SubjectFull: Bisimulation Type: general – SubjectFull: Model theory Type: general Titles: – TitleFull: Approximating Markovian testing equivalence Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Aldini, Alessandro IsPartOfRelationships: – BibEntity: Dates: – D: 06 M: 01 Text: Jan2012 Type: published Y: 2012 Identifiers: – Type: issn-print Value: 03043975 Numbering: – Type: volume Value: 413 – Type: issue Value: 1 Titles: – TitleFull: Theoretical Computer Science Type: main |
| ResultId | 1 |
