Modeling logical and temporal synchronization in hypermedia systems

Sénac, Patrick; Diaz, Michel; Léger, Alain; Saqui-Sannes, Pierre de

doi:10.1109/49.481696

Cited by 74 publications

(18 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Thus, the modelling of these elements requires hierarchical modelling possibilities. The Petri Net paradigm offers possibilities of hierarchic modelling using abstract places to model a subnet [6].…”

Section: The H-smil-net Modelmentioning

confidence: 99%

H-SMIL-Net: A Hierarchical Petri Net Model for SMIL Documents

Bouyakoub

Belkhir

2008

Tenth International Conference on Computer Modeling and Simulation (Uksim 2008)

View full text Add to dashboard Cite

We propose in this paper a hierarchical and temporal extension of Petri Nets for the incremental authoring of SMIL multimedia documents. The complexity of these documents can lead authors, in some cases, to specify synchronization relations which could not be satisfied during the presentation of the document, what characterizes the occurrence of inconsistencies; a consistency checking mechanism is then necessary. This new model, named H-SMIL-Net (Hierarchical SMIL-Petri Net) proposes a technique for the incremental verification of temporal consistency. The originality of the solution resides in the modular aspect of the modelling, and the local approach of verification, what optimizes the verification time after each editing operation. This formal approach has been integrated in an incremental authoring tool for SMIL presentations.

show abstract

Section: The H-smil-net Modelmentioning

confidence: 99%

H-SMIL-Net: A Hierarchical Petri Net Model for SMIL Documents

Bouyakoub

Belkhir

2008

Tenth International Conference on Computer Modeling and Simulation (Uksim 2008)

View full text Add to dashboard Cite

show abstract

“…The TLSA model has been designed within the framework of the RT-Lotos project at LAAS-CNRS, and the associated tools have been integrated within the rtl (RT-Lotos Laboratory) tool environment. It is assumed that the system high-level specification is written in RT-Lotos [8], but results are also applicable to other formalisms that can express composition of time constraints, like timed automata [3], temporal extensions of Petri nets [17] and process algebra [11].…”

Section: Introductionmentioning

confidence: 99%

From the Specification to the Scheduling of Time-Dependent Systems

Lohr¹,

Courtiat²

2002

Lecture Notes in Computer Science

View full text Add to dashboard Cite

This paper introduces and formalizes a new variant of Timed Automata, called Time Labeled Scheduling Automata. A Time Labeled Scheduling Automaton is a single clock implementation model expressing globally the time constraints that a system has to meet. An algorithm is presented to show how a Time Labeled Scheduling Automaton can be synthesized from a minimal reachability graph derived from a high-level specification expressing the composition of different time constraints. It is shown how the reachability graph may be corrected before synthesizing the Time Labeled Scheduling Automaton to remove all its potentially inconsistent behaviors. Current applications of the model are the scheduling of interactive multimedia documents and a simple illustration is given in this area.

show abstract

“…Multiple variations of Petri Net models such as OCPN [6] or TSPN [10] exist which have a strong expressive power according to the specification of synchronization aspects. However, these models do not adapt documents with regard to the resource situation.…”

Section: Related Workmentioning

confidence: 99%