Periodicity based decidable classes in a first order timed logic

DOI10.1016/j.apal.2005.03.003zbMath1094.03017OpenAlexW2043383965MaRDI QIDQ2368906

Danièle Beauquier, Anatol Slissenko

Publication date: 28 April 2006

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2005.03.003

zbMATH Keywords

verificationdecidabilityperiodic modelsfirst-order timed logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Distributed systems (68M14) Temporal logic (03B44)

Related Items (1)

Decidable properties for monadic abstract state machines

Cites Work

• A theory of timed automata
• Decidable verification for reducible timed automata specified in a first order logic with time
• Introduction to Distributed Algorithms
• Evolving Algebras 1993: Lipari Guide
• Tools and Algorithms for the Construction and Analysis of Systems
• Sequential abstract-state machines capture sequential algorithms
• Verification, Model Checking, and Abstract Interpretation
• A first order logic for specification of timed algorithms: Basic properties and a decidable class
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Periodicity based decidable classes in a first order timed logic