Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014, Article ID 352152, 20 pages
http://dx.doi.org/10.1155/2014/352152
Research Article

Unified Mathematical Framework for Slicing and Symmetry Reduction over Event Structures

1G&S Labs, School of Software, Dalian University of Technology, Dalian 116620, China
2School of Electronic and Information Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China
3School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China

Received 28 January 2014; Accepted 27 April 2014; Published 12 June 2014

Academic Editor: Xiaoyu Song

Copyright © 2014 Xinyan Gao et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. Alagar and S. Venkatesan, “Techniques to tackle state explosion in global predicate detection,” IEEE Transactions on Software Engineering, vol. 27, no. 8, pp. 704–714, 2001. View at Publisher · View at Google Scholar · View at Scopus
  2. E. M. Clarke, R. Enders, T. Filkorn, and S. Jha, “Exploiting symmetry in temporal logic model checking,” Formal Methods in System Design, vol. 9, pp. 77–104, 1996. View at Google Scholar
  3. J. Jiang and J. Wu, “Symmetry and autobisimulation,” in Proceedings of the 6th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT '05), pp. 866–870, IEEE Computer Society Press, December 2005. View at Publisher · View at Google Scholar · View at Scopus
  4. J.-Z. Wu and H. Fecher, “Symmetric structure in logic programming,” Journal of Computer Science and Technology, vol. 19, no. 6, pp. 803–811, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  5. M. Weiser, Program slices: formal, psychological, and practical investigations of an automatic program abstraction method [Ph.D. thesis], University of Michigan, 1979.
  6. M. Weiser, “Programmers use slices when debugging,” Communications of the ACM, vol. 25, no. 7, pp. 446–452, 1982. View at Publisher · View at Google Scholar · View at Scopus
  7. V. K. Garg and N. Mittal, “On slicing a distributed computation,” in Proceedings of the 21st IEEE International Conference on Distributed Computing Systems (ICDCS '01), D. Harel, D. Kozen, and J. Tiuryn, Eds., Dynamic Logic, pp. 322–329, MIT Press, Phoenix, Ariz, USA, 2001.
  8. A. Sen and V. K. Garg, “Formal verification of simulation traces using computation slicing,” IEEE Transactions on Computers, vol. 56, no. 4, pp. 511–527, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  9. E. Duesterwald, R. Gupta, and M. L. Soffa, “Distributed slicing and partial re-execution for distributed programs,” in Proceedings of the 5th Workshop on Language and Compilers for Parallel Computing, pp. 329–337, 1992.
  10. J. W. de Bakker, W. P. de Roever, and G. Rozenberg, Eds., Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, vol. 354 of Lecture Notes in Computer Science, Springer, Berlin, Germany, 1989. View at Publisher · View at Google Scholar · View at MathSciNet
  11. G. Winskel, “Event structures,” in Petri Nets: Applications and Relationships to Other Models of Concurrency, Advances in Petri Nets 1986, Part II; Proceedings of an Advanced Course, Bad Honnef, September 1986, W. Brauer, W. Reisig, and G. Rozenberg, Eds., vol. 255 of Lecture Notes in Computer Science, pp. 325–392, Springer, Berlin, Germany, 1987. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. P. Madhusudan, “Model-checking trace event structures,” in Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science (LICS '03), pp. 371–380, June 2003. View at Scopus
  13. M. Mukund and P. S. Thiagarajan, “An axiomatization of event structures,” in Foundations of Software Technology and Theoretical Computer Science (Bangalore, 1989), vol. 405 of Lecture Notes in Computer Science, pp. 143–160, Springer, Berlin, Germany, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. R. J. van Glabbeek and U. Goltz, “Refinement of actions and equivalence notions for concurrent systems,” Hildesheimer Informatik-Bericht 6/98, University of Hildesheim, 1998. View at Google Scholar
  15. H. Hermanns and M. Ribaudo, “Exploiting symmetries in stochastic process algebras,” in Proceedings of the European Simulation Multiconference (ESM '98), pp. 763–770, SCS Europe, 1998.
  16. M. Nielsen, G. Plotkin, and G. Winskel, “Petri nets, event structures and domains. I,” Theoretical Computer Science, vol. 13, no. 1, pp. 85–108, 1981. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. M. Nielsen, G. Plotkin, and G. Winskel, “Petri nets, event structures and domains. I,” Theoretical Computer Science, vol. 13, no. 1, pp. 85–108, 1981. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. R. Loogen and U. Goltz, “Modelling nondeterministic concurrent processes with event structures,” Fundamenta Informaticae, vol. 14, no. 1, pp. 39–73, 1991. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. A. Sen, J. Bhadra, V. K. Garg, and J. A. Abraham, “Formal verification of a system-on-chip using computation slicing,” in Proceedings of the International Test Conference (ITC '04), pp. 810–819, October 2004. View at Scopus
  20. A. Sen, Techniques for formal verification of concurrent and distributed program traces [Ph.D. thesis], The University of Texas at Austin, Austin, Tex, USA, 2004, http://www.library.utexas.edu/etd/d/2004/senma042/senma042.pdf.
  21. E. A. Emerson and A. P. Sistla, “Symmetry and model checking,” in Computer Aided Verification (Elounda, 1993), vol. 697 of Lecture Notes in Computer Science, pp. 463–478, Springer, Berlin, Germany, 1993. View at Publisher · View at Google Scholar · View at MathSciNet
  22. A. Miller, A. Donaldson, and M. Calder, “Symmetry in temporal logic model checking,” ACM Computing Surveys, vol. 38, no. 3, article 8, 2006. View at Publisher · View at Google Scholar · View at Scopus
  23. G. Winskel, “Event structures with symmetry,” in Computation, Meaning, and Logic: Articles Dedicated to Gordon Plotkin, vol. 172 of Electronic Notes in Theoretical Computer Science, pp. 611–652, Elsevier, Amsterdam, The Netherlands, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  24. X. Gao, J. Wu, R. Qiao, and J. Chen, “Theory framework for event structure slicing,” in Proceedings of the 13th IEEE Symposium on Computers and Communications (ISCC '08), pp. 714–721, IEEE, Marrakech, Morocco, July 2008. View at Publisher · View at Google Scholar · View at Scopus
  25. G. Winskel, “An introduction to event structures,” in Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency (Noordwijkerhout, 1988), J. W. de Bakker, W. P. de Roever, and G. Rozenberg, Eds., vol. 354 of Lecture Notes in Computer Science, pp. 364–397, Springer, Berlin, Germany, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  26. G. Winskel, “An introduction to event structures,” in Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency (Noordwijkerhout, 1988), vol. 354 of Lecture Notes in Computer Science, pp. 364–397, Springer, Berlin, Germany, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  27. G. Winskel and M. Nielsen, “Models for concurrency,” in Handbook of Logic in Computer Science, vol. 4, pp. 1–148, Oxford University Press, New York, NY, USA, 1995. View at Google Scholar · View at MathSciNet
  28. N. Mittal and V. K. Garg, “On detecting global predicates in distributed computations,” in Proceedings of the 21st IEEE International Conference on Distributed Computing Systems, pp. 3–10, Phoenix, Ariz, USA, April 2001. View at Scopus
  29. V. K. Garg, “Algorithmic combinatorics based on slicing posets,” Theoretical Computer Science, vol. 359, no. 1–3, pp. 200–213, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  30. E. M. Clarke, E. A. Emerson, and A. P. Sistla, “Automatic verification of finite state concurrent systems using temporal logic,” ACM Transactions on Programming Languages and Systems, vol. 8, no. 2, pp. 244–263, 1986. View at Google Scholar · View at Scopus
  31. B. A. Davey and H. A. Priestley, Introduction to Lattices and Order, Cambridge Mathematical Textbooks, Cambridge University Press, Cambridge, UK, 1990. View at MathSciNet
  32. A. Sen and V. K. Garg, “Detecting temporal logic predicates in distributed programs using computation slicing,” in Proceedings of the 7th International Conference on Principles of Distributed Systems (OPODIS '03), December 2003.
  33. N. Mittal, A. Sen, V. K. Garg, and R. Atreya, “Finding satisfying global states: all for one and one for all,” in Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS '04), Santa Fe, NM, USA, April 2004.
  34. G. Boudol, “Flow event structures and flow nets,” in Semantics of Systems of Concurrent Processes (La Roche Posay, 1990), vol. 469 of Lecture Notes in Computer Science, pp. 62–95, Springer, Berlin, Germany, 1990. View at Publisher · View at Google Scholar · View at MathSciNet
  35. H. Fecher, M. Majster-Cederbaum, and J. Wu, “Bundle event structures: a revised cpo approach,” Information Processing Letters, vol. 83, no. 1, pp. 7–12, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  36. R. Langerak, “Bundle event structures: a non-interleaving semantics for LOTOS,” in Formal Description Techniques V, M. Diaz and R. Groz, Eds., pp. 331–346, 1992. View at Google Scholar