Modular construction of the symbolic observation graph

Proceedings - International Conference on Application of Concurrency to System Design, ACSD

Volumn , Issue , 2008, Pages 88-97

  Klai, Kais ^a   Petrucci, Laure ^a  

^a Laboratoire d'Informatique de Paris Nord Villetaneuse   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER NETWORKS; GRAPH THEORY; MODULAR CONSTRUCTION; SYSTEMS ANALYSIS; TRANSLATION (LANGUAGES);

INTERNATIONAL CONFERENCES; SYSTEM DESIGNS; TIME COMPLEXITIES;

MODEL CHECKING;

EID: 51549098353     PISSN: 15504808     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSD.2008.4574600     Document Type: Conference Paper

References (20)

1. Randal E. Bryant. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, 1992.
2. Ufuk Celikkan and Rance Cleaveland. Computing diagnostic test for incorrect processes. In Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII, pages 263-277, Amsterdam, The Netherlands, The Netherlands, 1992. North-Holland Publishing Co.
3. Sagar Chaki, Edmund M. Clarke, Joël Ouaknine, Natasha Sharygina, and Nishant Sinha. Concurrent software verification with states, events, and deadlocks. Formal Asp. Comput., 17(4):461-483, 2005.
4. Søren Christensen and Laure Petrucci. Modular analysis of Petri nets. Computer Journal, 43(3):224-242, 2000.
5. Edmund M. Clarke, Kenneth L. McMillan, Sérgio Vale Aguiar Campos, and Vassili Hartonas-Garmhausen. Symbolic model checking. In Int. Conf. on Computer Aided Verification (CAV), volume 1102 of Lecture Notes in Computer Science, pages 419-427. Springer, 1996.
6. R. Cleaveland and M. Hennessy. Testing equivalence as a bisimulation equivalence. In Proceedings of the international workshop on Automatic verification methods for finite state systems, pages 11-23, New York, NY, USA, 1990. Springer-Verlag New York, Inc.
7. Jean-Michel Couvreur. A BDD-like implementation of an automata package. In Int. Conf. on Implementation and Application of Automata (CIAA), volume 3317 of Lecture Notes in Computer Science, pages 310-311. Springer, 2004.
8. Jaco Geldenhuys and Antti Valmari. Techniques for smaller intermediary BDDs. In Int. Conf. on Concurrency Theory (CONCUR), volume 2154 of Lecture Notes in Computer Science, pages 233-247. Springer, 2001.
9. Ursula Goltz, Ruurd Kuiper, and Wojciech Penczek. Propositional temporal logics and equivalences. In CONCUR, pages 222-236, 1992.
10. Serge Haddad, Jean-Michel Ilié, and Kais Klai. Design and evaluation of a symbolic and abstraction-based model checker. In Int. Conf. on Automated Technology for Verification and Analysis (ATVA), volume 3299 of Lecture Notes in Computer Science. Springer, 2004.
11. Roope Kaivola and Antti Valmari. The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic. In CONCUR, pages 207-221, 1992.
12. Ferhat Khendek and Gregor von Bochmann. Merging behavior specifications. Formal Methods in System Design, 6(3):259-293, 1995.
13. Kais Klai, Serge Haddad, and Jean-Michel Ilié. Modular verification of Petri nets properties: A structure-based approach. In Int. Conf. on Formal Techniques for Networked and Distributed Systems (FORTE), volume 3731 of Lecture Notes in Computer Science, pages 189-203. Springer, 2005.
14. Charles Lakos and Laure Petrucci. Modular analysis of systems composed of semiautonomous subsystems. In Int. Conf. on Application of Concurrency to System Design (ACSD), pages 185-194. IEEE Comp. Soc. Press, 2004.
15. Zohar Manna and Amir Pnueli. The temporal logic of reactive and concurrent systems. Springer-Verlag New York, Inc., New York, NY, USA, 1992.
16. Laure Petrucci. Cover picture story: Experiments with modular state spaces. In Petri Net newsletter, pages 5-10, 2005.
17. Antti Puhakka and Antti Valmari. Weakest-congruence results for livelock-preserving equivalences. In CONCUR, pages 510-524, 1999.
18. A. W. Roscoe, Paul H. B. Gardiner, Michael Goldsmith, J. R. Hulance, D. M. Jackson, and J. B. Scattergood. Hierarchical compression for model-checking csp or how to check 1020 dining philosophers for deadlock. In TACAS, pages 133-152, 1995.
19. Z. P. Tao, G. von Bochmann, and R. Dssouli. Verification and diagnosis of testing equivalence and reduction relation. In ICNP '95: Proceedings of the 1995 International Conference on Network Protocols, page 14, Washington, DC, USA, 1995. IEEE Computer Society.
20. Antti Valmari. Composition and abstraction. In MOVEP, volume 2067 of Lecture Notes in Computer Science, pages 58-98. Springer, 2000.