Distributed local resolution of Boolean Equation Systems

Proceedings - 13th Euromicro Conference on Parallel, Distributed and Network-Based Processing 2005, PDP 2005

Volumn 2005, Issue , 2005, Pages 264-273

  Joubert, Christophe ^a   Mateescu, Radu ^a  

^a INRIA RHÔNE ALPES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; COMPUTER PROGRAMMING; COMPUTER SYSTEMS; FORMAL LOGIC;

BOOLEAN EQUATION SYSTEMS (BES); CONCURRENT SYSTEMS; SEQUENTIAL ALGORITHMS;

BOOLEAN FUNCTIONS;

EID: 33646571887     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMPDP.2005.19     Document Type: Conference Paper

References (15)

1. H.R. Andersen. Model checking and boolean graphs. Theoretical Computer Science, 126(1):3-30, April 1994.
2. H. R. Andersen and B. Vergauwen. Efficient Checking of Behavioural Relations and Modal Assertions using Fixed-Point Inversion. In P. Wolper, editor, Proceedings of the 7th International Conference on Computer Aided Verification CAV '95 (Liege, Belgium), volume 939 of Lecture Notes in Computer Science, pages 142-154. Springer Verlag, July 1995.
3. A. Arnold and P. Crubillé. A linear algorithm to solve fixed-point equations on transition systems. Information Processing Letters. 29:57-66, 1988.
4. Benedict Bollig, Martin Leucker, and Michael Weber. Local Parallel Model Checking for the Alternation Free MuCalculus. In D. Bonaki and S Leue, editors, Proceedings of the 9th International SPIN Workshop on Model checking of Software (SPIN '02), volume 2318 of LNCS, pages 128-147. Springer Verlag, 2002.
5. R. Cleaveland and B. Steffen. A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal MuCalculus. Formal Methods in System Design, 2:121-147, 1993.
6. Christian Fecht and Helmut Seidl. An Even Faster Solver for General Systems of Equations. In Radhia Cousot and David A. Schmidt, editors, Proceedings of the 3rd International Symposium on Static Analysis SAS'96 (Aachen, Germany), volume 1145 of Lecture Notes in Computer Science. pages 189-204. Springer Verlag, September 1996.
7. Hubert Garavel. OPEN/CÆSAR: An Open Software Architecture for Verification, Simulation, and Testing. In Bernhard Steffen. editor. Proceedings of the First International Conference on Tools and Algorithms for the Construction and Analysis of Systems TACAS'98 (Lisbon, Portugal), volume 1384 of Lecture Notes in Computer Science, pages 68-84, Berlin, March 1998. Springer Verlag. Full version available as INRIA Research Report RR-3352.
8. Hubert Garavel, Frédéric Lang, and Radu Mateescu. An Overview of CADP 2001. European Association for Software Science and Technology (EASST) Newsletter, 4:13-24, August 2002.
9. Also available as INRIA Technical Report RT-0254 (December 2001).
10. X. Liu and S. A. Smolka. Simple Linear-Time Algorithms for Minimal Fixed Points. In Kim G. Larsen, Sven Skyum. and Glynn Winskel, editors. Proceedings of the 25th International Colloquium on Automata, Languages, and Programming ICALP'98 (Aalborg, Denmark), volume 1443 of Lecture Notes in Computer Science, pages 53-66. Springer Verlag, July 1998.
11. Angelika Mader. Verification of Modal Properties Using Boolean Equation Systems. VERSAL 8, Bertz Verlag, Berlin, 1997.
12. Radu Mateescu. A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems. In Hubert Garavel and John Hatcliff, editors, Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems TACAS'2003 (Warsaw, Poland), volume 2619 of Lecture Notes in Computer Science, pages 81-96. Springer Verlag, April 2003. Full version available as INRIA Research Report RR-4711.
13. J. Matocha and T. Camp. A taxonomy of distributed termination detection algorithms. Journal of Systems and Software, 43:207-221, 1998.
14. Gordon Pace. Frédéric Lang, and Radu Mateescu. Calculating T-Confluence Compositionally. In Jr Warren A. Hunt and Fabio Somenzi, editors, Proceedings of the 15th International Conference on Computer Aided Verification CAV'2003 (Boulder, Colorado, USA), volume 2725 of Lecture Notes in Computer Science, pages 446-459. Springer Verlag, July 2003. Full version available as INRIA Research Report RR-4918.
15. B. Vergauwen and J. Lewi. Efficient Local Correctness Checking for Single and Alternating Boolean Equation Systems. In S. Abiteboul and E. Shamir, editors, Proceedings of the 21st ICALP (Vienna), volume 820 of Lecture Notes in Computer Science, pages 304-315, Berlin, July 1994. Springer Verlag.