Realizability of high-level message sequence charts: closing the gaps

@article{Lohrey2003RealizabilityOH,
  title={Realizability of high-level message sequence charts: closing the gaps},
  author={Markus Lohrey},
  journal={Theor. Comput. Sci.},
  year={2003},
  volume={309},
  pages={529-554}
}
We study the notion of safe realizability for high-level message sequence charts (HMSCs) (Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP 2001), Crete (Greece), Lecture Notes in Computer Science, Vol. 2076, Springer, Berlin, 2001, pp. 797–808). We show that safe realizability is EXPSPACE-complete for bounded HMSCs but undecidable for the class of all HMSCs. This solves two open problems from Alur et al. Moreover we prove that safe realizability is… CONTINUE READING
Highly Cited
This paper has 24 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Za > ropulo , On communicating > nitestate machines

  • P. D. Brand
  • J . Assoc . Comput . Mach .
  • 2003

Similar Papers

Loading similar papers…