Abstract
The paper describes a decidable class of verification problems expressed in first order timed logic. To specify programs we use Abstract State Machines. It is known that Abstract State Machines and first order timed logic are two very powerful formalisms apt to represent verification problems for timed distributed systems. However, the general verification problem represented in this way is undecidable. Prior, some decidable classes of verification problems were described in semantical properties that are in their turn undecidable. The decidable class of the present paper is described in syntactical terms. Though it admits no functions, only predicates, it is of practical interest and we give an example illustrating possible applications.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
