Extending Z with state transition constraints

Kenji Taguchi, Keijiro Araki

Research output: Contribution to journalConference articlepeer-review

1 Citation (Scopus)


This paper proposes an extended notation of Z by which one can explicitly specify the intended behavior of operation schemas in the form of state transitions. The notation is based on a labeled transition system which is tractable to analyze the operational behavior of Z. In this paper we mainly focus on the semantical framework which enables us to express constraints both locally and globally. Simple examples are presented and some research issues on operational interpretation of schemas are discussed with respect to our semantical framework.

Original languageEnglish
Pages (from-to)254-260
Number of pages7
JournalProceedings - IEEE Computer Society's International Computer Software & Applications Conference
Publication statusPublished - 1996
EventProceedings of the 1996 IEEE 20th Annual International Computer Software & Applications Conference, COMPSAC'96 - Seoul, S Korea
Duration: Aug 21 1996Aug 23 1996

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Science Applications


Dive into the research topics of 'Extending Z with state transition constraints'. Together they form a unique fingerprint.

Cite this