Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems


Share/Save/Bookmark

Chen, Taolue and Ploeger, Bas and Pol van de, Jaco and Willemse, Tim A.C. (2007) Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems. In: 18th International Conference on Concurrency Theory, CONCUR 2007, September 3-8, 2007, Lisbon, Portugal.

[img]PDF
Restricted to UT campus only
: Request a copy
467Kb
Abstract:In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving Parameterized Boolean Equation Systems. We prove correctness, and illustrate the approach with an unbounded queue example. We also provide some adaptations to obtain similar transformations for weak bisimulation and simulation equivalence.
Item Type:Conference or Workshop Item
Copyright:© 2007 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/61980
Official URL:http://dx.doi.org/10.1007/978-3-540-74407-8_9
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 242021