Skip to main content
SpringerLink
Log in
Book cover

LOMAPS workshop on Analysis and Verification of Multiple-Agent Languages

LOMAPS 1996: Analysis and Verification of Multiple-Agent Languages pp 370–387Cite as

A non-standard semantics for generating reduced transition systems

  • Conference paper
  • First Online:

  • 181 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1192))

Abstract

In recent years many techniques have been developed for automatically verifying concurrent systems and most of them are based on a representation of the concurrent system by means of a finite state transition system. State explosion is one of the most serious problems of this approach: in fact often the prohibitive number of states renders the verification inefficient and, in some cases, impossible.

We propose an approach to the reduction of the state space of the transition system corresponding to a CCS process, which takes into account the deadlock freeness property. The reduced transition system is generated by means of a non-standard operational semantics containing a set of rules which are an abstraction, preserving deadlock freeness, of the inference rules of the standard semantics.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Bensalem, A. Bouajjani, C. Loiseaux, J. Sifakis. Property Preserving Simulations. In Proceedings of the Fourth Workshop on Computer Aided Verification, 1992.

    Google Scholar 

  2. T. Bolognesi, S. Smolka. Fundamental results for the verification of observational equivalence: a survey. In Proc. IFIP WG 6.1 7th Conference on Protocol Specification, Testing and Verification. Amsterdam: North-Holland 1987.

    Google Scholar 

  3. A. Bouajjani, J.C. Fernandez, N. Halbwachs, P. Raymond, C. Ratel. Minimal state graph generation. Science of Computer Programming, 1992. Vol. 18(3), pp. 247–271.

    Article  Google Scholar 

  4. A. Bouali, S. Gnesi, S. Larosa. The integration Project for JACK Environment. Bulletin of EATCS, n.54, October 1994, pp. 207–223.

    Google Scholar 

  5. G. Bruns. A Practical Technique for Process Abstraction. In Proceedings of th Fourth International Conference on Concurrency Theory (CONCUR'93), Lecture Notes in Computer Science, Springer-Verlag, 1993, pp. 37–49.

    Google Scholar 

  6. E.M. Clarke, O.Grumberg, D.E. Long. Model Checking and Abstraction. ACM Transactions on Programming Languages and Systems, 1994. Vol. 16 (5), pp. 1512–1542.

    Google Scholar 

  7. R. Cleaveland, J. Riely. Testing-Based Abstractions for Value-Passing Systems. Lecture Notes in Computer Science 836 (CONCUR'94), Springer-Verlag, 1994, pp. 417–432.

    Google Scholar 

  8. C. Courcoubetis, M. Vardi, P. Wolper, M. Yannakakis. Memory Efficient Algorithms for the Verification of Temporal Properties. In Workshop on Computer Aided Verification, DIMACS 90, June 1990.

    Google Scholar 

  9. P. Cousot and R. Cousot. Systematic Design of Program Analysis Frameworks. In Proc. 6th ACM Symp. Principles of Programming Languages (1979), pp. 269–282.

    Google Scholar 

  10. P. Cousot and R. Cousot. Inductive Definitions, Semantics and Abstract Interpretations. ACM Symp. Principles of Programming Languages, Albuquerque, 1992, pp. 83–94.

    Google Scholar 

  11. D. Dams, R. Gerth. G. Döhmen, R. Herrmann, P. Kelb, H. Pargmann. Model Checking Using Adaptive State and Data Abstraction. Lecture Notes in Computer Science 818 (CAV'94), Springer-Verlag, 1994, pp. 455–467.

    Google Scholar 

  12. N. De Francesco, A. Santone, G. Vaglini. Reducing State Space with Non-Standard Semantics. Internal Report IR-3/95, Dipartimento di Ingegneria dell'Informazione, Univ. of Pisa.

    Google Scholar 

  13. J.C. Fernandez, L. Mounier. Verifying bisimulation on the fly. In Third International Conference on Formal Description Techniques, FORTE'90, Madrid, November 1990.

    Google Scholar 

  14. J.C. Fernandez, L. Mounier. “On th Fly” Verification of Behavioural Equivalences and Preordes. In Proceedings of the Third International Conference on ComputerAided Verification, Lecture Notes in Computer Science, Springer-Verlag, vol. 575 pp. 181–191, 1991.

    Google Scholar 

  15. P. Godefroid, P. Wolper. A partial approach to model checking. In Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science (LICS), 1991.

    Google Scholar 

  16. P. Godefroid, P. Wolper. Using Partial Orders for Efficient Verification of Deadlock Freedom and Safety Properties. In Proceedings of the Third International Conference on Computer-Aided Verification, Lecture Notes in Computer Science, Springer-Verlag, vol. 575 pp. 332–342, 1991.

    Google Scholar 

  17. C. Jard, T. Jéron. On-Line Model-Checking for Finite Linear Temporal Logic Specifications. In International Workshop on Automatic Verification Methods for Finite State Systems, Lecture Notes in Computer Science, Springer-Verlag, vol. 407 pp. 189–196, 1989.

    Google Scholar 

  18. C. Jard, T. Jéron. Bounded-memory Algorithms for Verification On-the-fly. In Proceedings of the Third International Conference on Computer-Aided Verification, Lecture Notes in Computer Science, Springer-Verlag, vol. 575 pp. 192–201, 1991.

    Google Scholar 

  19. E. Madelaine, D. Vergamini. Finiteness conditions and structural construction of automata for all process algebras. In Proceedings, 2nd Workshop on ComputerAided Verification. DIMACS Technical report 90-31, June 1990.

    Google Scholar 

  20. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.

    Google Scholar 

  21. D. Peled. All from one, one for all, on model-checking using representatives. In Proceedings of the Fifth International Conference on Computer-Aided Verification, Lecture Notes in Computer Science, Springer-Verlag, 1993, pp. 409–423.

    Google Scholar 

  22. W.Reisig. Petri Nets. EATCS Monographs on Theoretical Computer Science 4 (Springer-Verlag, New York, 1985).

    Google Scholar 

  23. P. Rondogiannis, M.H.M Cheng. Petri-net-based deadlock analysis of Process Algebra programs. Science of Computer Programming, 1994. Vol. 23 (1), pp. 55–89.

    Google Scholar 

  24. J. Sifakis. Property Preserving Homomorphisms of Transition Systems. In Logics of Programs, Springer Verlag, 1983. Lecture Notes in Computer Science, vol. 164.

    Google Scholar 

  25. R.N. Taylor. Complexity of analyzing the synchronization structure of concurrent programs. Acta Informatica, 1983. Vol. 19, pp 57–84.

    Google Scholar 

  26. A. Valmari. A Stubborn Attack on State Explosion. In Proceedings of the Second International Conference on Computer-Aided Verification, Lecture Notes in Computer Science, Springer-Verlag, vol. 531 pp. 156–165, 1990.

    Google Scholar 

  27. A. Valmari, M. Clegg. Reduced Labelled Transition Systems Save Verification Effort. In Proceedings of the Second International Conference on Concurrency Theory (CONCUR'91), Lecture Notes in Computer Science, Springer-Verlag, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria dell'Informazione, Università di Pisa, I-56126, Pisa, Italy

    Nicoletta De Francesco, Antonella Santone & Gigliola Vaglini

Authors
  1. Nicoletta De Francesco
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antonella Santone
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gigliola Vaglini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mads Dam

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

De Francesco, N., Santone, A., Vaglini, G. (1997). A non-standard semantics for generating reduced transition systems. In: Dam, M. (eds) Analysis and Verification of Multiple-Agent Languages. LOMAPS 1996. Lecture Notes in Computer Science, vol 1192. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62503-8_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-62503-8_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62503-2

  • Online ISBN: 978-3-540-68052-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation