An embedding of Timed Transition Systems in HOL

Hale, Roger; Cardell-Oliver, Rachel; Herbert, John

doi:10.1007/bf01383987

Cited by 11 publications

(3 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…All definitions and theorems presented in the following are directly derived from a mechanization developed in Coq. This part of our contributions connects to the previous work of R. Cardell-Oliver et al [14] about the embedding in hol of [16] and C. Paulin-Mohring about the formalization of timed automata in Coq [20]. With respect to the Petri Net community, our work is in the spirit of B. Berard et al [4].…”

Section: Timed Semantics Of Component-based Languagessupporting

confidence: 69%

A Mechanized Semantic Framework for Real-Time Systems

Garnacho

Bodeveix

Filali-Amine

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Concurrent systems consist of many components which may execute in parallel and are complex to design, to analyze, to verify, and to implement. The complexity increases if the systems have real-time constraints, which are very useful in avionic, spatial and other kind of embedded applications. In this paper we present a logical framework for defining and validating real-time formalisms as well as reasoning methods over them. For this purpose, we have implemented in the Coq proof assistant well known semantic domains for real-time systems based on labelled transitions systems and timed runs. We experiment our framework by considering the real-time CSP-based language fiacre, which has been defined as a pivot formalism for modeling languages (aadl, sdl, ...) used in the TOPCASED project. Thus, we define an extension to the formal semantic models mentioned above that facilitates the modeling of fine-grained time constraints of fiacre. Finally, we implement this extension in our framework and provide a proof method environment to deal with real-time system in order to achieve their formal certification. ⋆. This work has been partly funded by the FNRAE project Quarteft.

show abstract

Section: Timed Semantics Of Component-based Languagessupporting

confidence: 69%

A Mechanized Semantic Framework for Real-Time Systems

Garnacho

Bodeveix

Filali-Amine

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Timed automata [1] support both discrete events and measuring durations on a time scale, with several mechanization approaches of their semantics [11,27,14]. However, this time scale is global and uniform: all clocks in a timed automaton progress at the same rate.…”

Section: Related Workmentioning

confidence: 99%

On the Semantics of Polychronous Polytimed Specifications

Van

Balabonski

Boulanger

et al. 2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this paper, we study the semantics of a specification language for the coordination of concurrent systems, which supports time at different levels: various time domains, polychrony, and mixed metric/logical time constraints. The language itself is defined by a denotational semantics. In order to be able to construct the possible timelines for verification purposes, we also define a symbolic operational semantics, which is the reference for an efficient implementation of a tool for runtime-testing of heterogeneous systems. This study presents a novel way to link these two semantics by taking advantage of a coinductive unfolding principle of these timelines. Furthermore, these semantics and their equivalence have been formalized in the Isabelle/HOL proof assistant, together with proofs for soundness, completeness and progress.

show abstract

“…This relation can be integrated with any other concurrent languages. Formal mechanization of time models has already been done using other formal methods, for example [19] uses Higher Order Logic in Isabelle/HOL; [17] and [34] use the Calculus of Inductive Constructions in Coq, see [8]. The use of Agda in this development is motivated by the expressiveness of the language and its underlying unification mechanism, which provides an efficient interactive proof experience that other tools might lack.…”

Section: State Of the Artmentioning

confidence: 99%

Ordering Strict Partial Orders to Model Behavioral Refinement

Montin¹,

Pantel²

2018

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Software is now ubiquitous and involved in complex interactions with the human users and the physical world in so-called cyber-physical systems (CPS) where the management of time is a major issue. Separation of concerns is a key asset in the development of these ever more complex systems. Two different kinds of separation exist: a first one corresponds to the different steps in a development leading from the abstract requirements to the system implementation and is qualified as vertical. It matches the commonly used notion of refinement. A second one corresponds to the various components in the system architecture at a given level of refinement and is called horizontal. Refinement has been studied thoroughly for the data, functional and concurrency concerns while our work focuses on the time modelling concern. This contribution aims at providing a formal construct for the verification of refinement in time models, through the definition of an order between strict partial orders used to relate the different instants in asynchronous systems. This relation allows the designer at the concrete level to distinguish events that are coincident at the abstract level while preserving the properties assessed at the abstract level. This work has been conducted using the proof assistant Agda and is connected to a previous work on the asynchronous language CCSL, which has also been modelled using the same tool.

show abstract

An embedding of Timed Transition Systems in HOL

Cited by 11 publications

References 5 publications

A Mechanized Semantic Framework for Real-Time Systems

A Mechanized Semantic Framework for Real-Time Systems

On the Semantics of Polychronous Polytimed Specifications

Ordering Strict Partial Orders to Model Behavioral Refinement

Contact Info

Product

Resources

About