EEMCS EPrints Service

Education

Research

Prospective Students

Jobs

Publications

Intranet (internal)

Nederlands

Contact

Sitemap

Organisation

11289 Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems

Home Policy Brochure Browse Search User Area Contact Help

Chen, Taolue and Ploeger, S.C.W. and van de Pol, J.C. and Willemse, T.A.C. (2007) Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems. In: CONCUR 2007 - Concurrency Theory, 3-8 Sep 2007, Lisbon, Portugal. pp. 120-135. Lecture Notes in Computer Science 4703. Springer Verlag. ISSN 0302-9743 ISBN 978-3-540-74406-1

Full text available as:

PDF (downloaded from SpringerLink)

- Univ. of Twente only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
468 Kb

Official URL: http://dx.doi.org/10.1007/978-3-540-74407-8_9

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 Paper (Full Paper, Talk)
Research Group:	EWI-FMT: Formal Methods and Tools
Research Program:	CTIT-DSN: Dependable Systems and Networks
ID Code:	11289
Status:	Published
Deposited On:	25 October 2007
Refereed:	Yes
International:	Yes
More Information:	statistics metis

Export this item as:

To request a copy of the PDF please email us request copy

To correct this item please ask your editor

Repository Staff Only: edit this item