Complexity of Strong Satisfiability Problems for Reactive System Specifications

@article{Shimakawa2013ComplexityOS,
  title={Complexity of Strong Satisfiability Problems for Reactive System Specifications},
  author={Masaya Shimakawa and Shigeki Hagihara and Naoki Yonezaki},
  journal={IEICE Transactions},
  year={2013},
  volume={96-D},
  pages={2187-2193}
}
Many fatal accidents involving safety-critical reactive systems have occurred in unexpected situations, which were not considered during the design and test phases of system development. To prevent such accidents, reactive systems should be designed to respond appropriately to any request from an environment at any time. Verifying this property during the specification phase reduces the development costs of safety-critical reactive systems. This property of a specification is commonly known as… CONTINUE READING

Figures and Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 20 REFERENCES

Automating first-order relational logic

  • SIGSOFT FSE
  • 2000
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Completeness of verification methods for approaching to realizable reactive specifications

S. Hagihara, N. Yonezaki
  • Proc. 1st Asian Working Conference on Verified Software AWCVS’06, UNU-IIST, vol.348, pp.242–257, 2006.
  • 2006
VIEW 2 EXCERPTS

Temporal logic with forgettable past

  • Proceedings 17th Annual IEEE Symposium on Logic in Computer Science
  • 2002
VIEW 1 EXCERPT

Deterministic generators and games for LTL fragments

  • Proceedings 16th Annual IEEE Symposium on Logic in Computer Science
  • 2001
VIEW 2 EXCERPTS