2012 19th International Symposium on Temporal Representation and Reasoning最新文献_第2页

A Metric Temporal Logic for Dealing with Zero-Time Transitions 处理零时间转换的度量时间逻辑

2012 19th International Symposium on Temporal Representation and Reasoning Pub Date : 2012-09-12 DOI: 10.1109/TIME.2012.22

L. Ferrucci, D. Mandrioli, A. Morzenti, M. Rossi

引用次数: 6

Compositional Refinement for Real-Time Systems with Priorities 具有优先级的实时系统的组合优化

2012 19th International Symposium on Temporal Representation and Reasoning Pub Date : 2012-09-12 DOI: 10.1109/TIME.2012.21

Abdeldjalil Boudjadar, J. Bodeveix, M. Filali

{"title":"Compositional Refinement for Real-Time Systems with Priorities","authors":"Abdeldjalil Boudjadar, J. Bodeveix, M. Filali","doi":"10.1109/TIME.2012.21","DOIUrl":"https://doi.org/10.1109/TIME.2012.21","url":null,"abstract":"High-level requirements of real-time systems like as time constraints, communications and execution schedulability make the verification of real-time models arduous, where a system is the interaction of a possibly unbounded set of components. Priorities have been introduced to resolve execution conflicts, and by that, prevent the combinatorial explosion of state space. In this paper, we are interested in the composition and refinement of timed systems by considering static and dynamic priorities. Firstly, we propose a revised definition of the product of extended timed transition systems with static and dynamic priorities associated to individual transitions. Afterwards, we study the(compositional) refinement of compound extended timed systems. Without sacrificing compositionality, we instantiate this framework for the case of UPPAAL networks of timed automata with static priority Committed ness, dynamic priority between channels and priority between processes. Moreover, we show how to associate an Extended Timed Transition System (ETTS) to timed automata (TA), where an unique generalized dynamic priority system of ETTS is derived from both dynamic priority orders: priority between channels and priority between processes.","PeriodicalId":137826,"journal":{"name":"2012 19th International Symposium on Temporal Representation and Reasoning","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128810918","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Efficient Regular Linear Temporal Logic Using Dualization and Stratification 利用对偶和分层的有效正则线性时间逻辑

2012 19th International Symposium on Temporal Representation and Reasoning Pub Date : 2012-09-12 DOI: 10.1109/TIME.2012.25

César Sánchez, Julián Samborski-Forlese

{"title":"Efficient Regular Linear Temporal Logic Using Dualization and Stratification","authors":"César Sánchez, Julián Samborski-Forlese","doi":"10.1109/TIME.2012.25","DOIUrl":"https://doi.org/10.1109/TIME.2012.25","url":null,"abstract":"We study efficient translations of Regular Linear Temporal Logic (RLTL) into automata on infinite words. RLTL is a temporal logic that fuses Linear Temporal Logic (LTL) with regular expressions, extending its expressive power to all ω-regular languages. The first contribution of this paper is a novel bottom up translation from RLTL into alternating parity automata of linear size that requires only colors 0, 1 and 2. Moreover, the resulting automata enjoy the stratified internal structure of hesitant automata. Our translation is defined inductively for every operator, and does not require an upfront transformation of the expression into a normal form. Our construction builds at every step two automata: one equivalent to the formula and another to its complement. Inspired by this construction, our second contribution is to extend RLTL with new operators, including universal sequential composition, that enrich the logic with duality laws and negation normal forms. The third contribution is a ranking translation of the resulting alternating automata into non-deterministic Buuchi automata. To provide this efficient translation we introduce the notion of stratified rankings, and show how the translation is optimal for the LTL fragment of the logic.","PeriodicalId":137826,"journal":{"name":"2012 19th International Symposium on Temporal Representation and Reasoning","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115001550","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Undecidability and Temporal Logic: Some Landmarks from Turing to the Present 不可判定性与时间逻辑:从图灵到现在的一些里程碑

2012 19th International Symposium on Temporal Representation and Reasoning Pub Date : 2012-09-12 DOI: 10.1109/TIME.2012.26

V. Goranko

引用次数: 1

Symmetric Temporal Theorem Proving 对称时间定理的证明

2012 19th International Symposium on Temporal Representation and Reasoning Pub Date : 2012-09-12 DOI: 10.1109/TIME.2012.20

Amir Niknafs-Kermani, B. Konev, M. Fisher

引用次数: 0

Modeling and Clustering Users with Evolving Profiles in Usage Streams 在使用流中使用不断变化的配置文件建模和聚类用户

2012 19th International Symposium on Temporal Representation and Reasoning Pub Date : 2012-09-12 DOI: 10.1109/TIME.2012.16

Chongsheng Zhang, F. Masseglia, Xiangliang Zhang

{"title":"Modeling and Clustering Users with Evolving Profiles in Usage Streams","authors":"Chongsheng Zhang, F. Masseglia, Xiangliang Zhang","doi":"10.1109/TIME.2012.16","DOIUrl":"https://doi.org/10.1109/TIME.2012.16","url":null,"abstract":"Today, there is an increasing need of data stream mining technology to discover important patterns on the fly. Existing data stream models and algorithms commonly assume that users' records or profiles in data streams will not be updated or revised once they arrive. Nevertheless, in various applications such as Web usage, the records/profiles of the users can evolve along time. This kind of streaming data evolves in two forms, the streaming of tuples or transactions as in the case of traditional data streams, and more importantly, the evolving of user records/profiles inside the streams. Such data streams bring difficulties on modeling and clustering for exploringusers' behaviors. In this paper, we propose three models to summarize this kind of data streams, which are the batch model, the Evolving Objects (EO) model and the Dynamic Data Stream (DDS) model. Through creating, updating and deleting user profiles, these models summarize the behaviors of each user as a profile object. Based upon these models, clustering algorithms are employed to discover interesting user groups from the profile objects. We have evaluated all the proposed models on a large real-world data set, showing that the DDS model summarizes the data streams with evolving tuples more efficiently and effectively, and provides better basis for clustering users than the other two models.","PeriodicalId":137826,"journal":{"name":"2012 19th International Symposium on Temporal Representation and Reasoning","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130053640","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Automata-based Verification of Linear Temporal Logic Models with Bounded Variability 基于自动机的有界变异性线性时间逻辑模型验证

2012 19th International Symposium on Temporal Representation and Reasoning Pub Date : 2012-09-12 DOI: 10.1109/TIME.2012.13

Carlo A. Furia, P. Spoletini

引用次数: 2

Formal Modeling and Analysis of a Distributed Transaction Protocol in UPPAAL UPPAAL中分布式事务协议的形式化建模与分析

2012 19th International Symposium on Temporal Representation and Reasoning Pub Date : 2012-09-12 DOI: 10.1109/TIME.2012.12

Omar I. Al-Bataineh, T. French, T. Woodings

引用次数: 4