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.
Original language | English |
---|---|
Title of host publication | CONCUR 2007 - Concurrency Theory |
Editors | Luis Caires, Vasco T. Vasconcelos |
Place of Publication | Berlin |
Publisher | Springer |
Pages | 120-135 |
Number of pages | 16 |
ISBN (Electronic) | 978-3-540-74407-8 |
ISBN (Print) | 978-3-540-74406-1 |
DOIs | |
Publication status | Published - Sept 2007 |
Event | 18th International Conference on Concurrency Theory, CONCUR 2007 - Lisbon, Portugal Duration: 3 Sept 2007 → 8 Sept 2007 Conference number: 18 |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer |
Volume | 4703 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 18th International Conference on Concurrency Theory, CONCUR 2007 |
---|---|
Abbreviated title | CONCUR |
Country/Territory | Portugal |
City | Lisbon |
Period | 3/09/07 → 8/09/07 |
Keywords
- FMT-MC: MODEL CHECKING