TimePub Date : 2023-11-01DOI: 10.4230/LIPIcs.TIME.2022.4
Isaac Mackey, Raghubir Chimni, Jianwen Su
{"title":"Early Detection of Temporal Constraint Violations","authors":"Isaac Mackey, Raghubir Chimni, Jianwen Su","doi":"10.4230/LIPIcs.TIME.2022.4","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2022.4","url":null,"abstract":"Software systems rely on events for logging, system coordination, handling unexpected situations, and more. Monitoring events at runtime can ensure that a business service system complies with policies, regulations, and business rules. Notably, detecting violations of rules as early as possible is much desired as it allows the system to reclaim resources from erring service enactments. We formalize a model for events and a logic-based rule language to specify temporal and data constraints. The primary goal of this paper is to develop techniques for detecting each rule violation as soon as it becomes inevitable. We further develop optimization techniques to reduce monitoring overhead. Finally, we implement a monitoring algorithm and experimentally evaluate it to demonstrate our approach to early violation detection is beneficial and effective for processing service enactments.","PeriodicalId":75226,"journal":{"name":"Time","volume":"17 1","pages":"4:1-4:16"},"PeriodicalIF":0.0,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87366351","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}
TimePub Date : 2023-08-21DOI: 10.48550/arXiv.2308.10801
Alexis Baudin, Lionel Tabourier, Clémence Magnien
{"title":"LSCPM: communities in massive real-world Link Streams by Clique Percolation Method","authors":"Alexis Baudin, Lionel Tabourier, Clémence Magnien","doi":"10.48550/arXiv.2308.10801","DOIUrl":"https://doi.org/10.48550/arXiv.2308.10801","url":null,"abstract":"Community detection is a popular approach to understand the organization of interactions in static networks. For that purpose, the Clique Percolation Method (CPM), which involves the percolation of k-cliques, is a well-studied technique that offers several advantages. Besides, studying interactions that occur over time is useful in various contexts, which can be modeled by the link stream formalism. The Dynamic Clique Percolation Method (DCPM) has been proposed for extending CPM to temporal networks. However, existing implementations are unable to handle massive datasets. We present a novel algorithm that adapts CPM to link streams, which has the advantage that it allows us to speed up the computation time with respect to the existing DCPM method. We evaluate it experimentally on real datasets and show that it scales to massive link streams. For example, it allows to obtain a complete set of communities in under twenty-five minutes for a dataset with thirty million links, what the state of the art fails to achieve even after a week of computation. We further show that our method provides communities similar to DCPM, but slightly more aggregated. We exhibit the relevance of the obtained communities in real world cases, and show that they provide information on the importance of vertices in the link streams.","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"3:1-3:18"},"PeriodicalIF":0.0,"publicationDate":"2023-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46148026","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}
TimePub Date : 2023-08-01DOI: 10.4230/LIPIcs.TIME.2022.14
M. Benerecetti, F. Mogavero, A. Peron
{"title":"Taming Strategy Logic: Non-Recurrent Fragments","authors":"M. Benerecetti, F. Mogavero, A. Peron","doi":"10.4230/LIPIcs.TIME.2022.14","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2022.14","url":null,"abstract":"Strategy Logic ( SL for short) is one of the prominent languages for reasoning about the strategic abilities of agents in a multi-agent setting. This logic extends LTL with first-order quantifiers over the agent strategies and encompasses other formalisms, such as ATL* and CTL* . The model-checking problem for SL and several of its fragments have been extensively studied. On the other hand, the picture is much less clear on the satisfiability front, where the problem is undecidable for the full logic. In this work, we study two fragments of One-Goal SL , where the nesting of sentences within temporal operators is constrained. We show that the satisfiability problem for these logics, and for the corresponding fragments of ATL* and CTL* , is ExpSpace and PSpace-complete , respectively. Classification Theory of computation → Modal and temporal logics; Theory of computation → Logic and verification; Theory of computation → Automata over infinite objects Bounded-Fork Tree Automata. Bounded-fork automata are a restriction of the standard tree automata tailored to accept only trees having a bounded number of fork nodes along each path starting from the root (recall that bounded-fork trees are suitable models for SL ̸ ⟳ [1g] ). If at most k forks in a path are allowed, the ability to count the number of occurring forks is obtained by partitioning the set of states Q into k + 1 subsets Q 0 , . . . , Q k . Intuitively, a state q ∈ Q i can observe at most i additional forks along a path. Naturally, the initial states belong to Q k and only states in Q 0 , from where no more forks are admitted, can be involved in the Büchi acceptance condition.","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"14:1-14:16"},"PeriodicalIF":0.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44519013","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}
TimePub Date : 2022-07-14DOI: 10.48550/arXiv.2207.06708
A. Bhaskar, M. Praveen
{"title":"Realizability Problem for Constraint LTL","authors":"A. Bhaskar, M. Praveen","doi":"10.48550/arXiv.2207.06708","DOIUrl":"https://doi.org/10.48550/arXiv.2207.06708","url":null,"abstract":"Constraint linear-time temporal logic (CLTL) is an extension of LTL that is interpreted on sequences of valuations of variables over an infinite domain. The atomic formulas are interpreted as constraints on the valuations. The atomic formulas can constrain valuations over a range of positions along a sequence, with the range being bounded by a parameter depending on the formula. The satisfiability and model checking problems for CLTL have been studied by Demri and D'Souza. We consider the realizability problem for CLTL. The set of variables is partitioned into two parts, with each part controlled by a player. Players take turns to choose valuations for their variables, generating a sequence of valuations. The winning condition is specified by a CLTL formula -- the first player wins if the sequence of valuations satisfies the specified formula. We study the decidability of checking whether the first player has a winning strategy in the realizability game for a given CLTL formula. We prove that it is decidable in the case where the domain satisfies the completion property, a property introduced by Balbiani and Condotta in the context of satisfiability. We prove that it is undecidable over $(mathbb{Z},<,=)$, the domain of integers with order and equality. We prove that over $(mathbb{Z},<,=)$, it is decidable if the atomic constraints in the formula can only constrain the current valuations of variables belonging to the second player, but there are no such restrictions for the variables belonging to the first player. We call this single-sided games.","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"8:1-8:19"},"PeriodicalIF":0.0,"publicationDate":"2022-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42924907","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}
TimePub Date : 2022-01-01DOI: 10.4230/LIPIcs.TIME.2022.7
Thomas Guyet, N. Markey
{"title":"Logical Forms of Chronicles","authors":"Thomas Guyet, N. Markey","doi":"10.4230/LIPIcs.TIME.2022.7","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2022.7","url":null,"abstract":"A chronicle is a temporal model introduced by Dousson et al. for situation recognition. In short, a chronicle consists of a set of events and a set of real-valued temporal constraints on the delays between pairs of events. This work investigates the relationship between chronicles and classical temporal-model formalisms, namely TPTL and MTL . More specifically, we answer the following question: is it possible to find an equivalent formula in such formalisms for any chronicle? This question arises from the observation that a single chronicle captures complex temporal behaviours, without imposing a particular order of the events in time. For our purpose, we introduce the subclass of linear chronicles , which set the order of occurrence of the events to be recognized in a temporal sequence. Our first result is that any chronicle can be expressed as a disjunction of linear chronicles. Our second result is that any linear chronicle has an equivalent TPTL formula. Using existing expressiveness results between TPTL and MTL , we show that some chronicles have no equivalent in MTL . This confirms that the model of chronicle has interesting properties for situation recognition.","PeriodicalId":75226,"journal":{"name":"Time","volume":"32 1","pages":"7:1-7:15"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73266741","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}
TimePub Date : 2022-01-01DOI: 10.4230/LIPIcs.TIME.2022.6
Victor Roussanaly, Yliès Falcone
{"title":"Decentralised Runtime Verification of Timed Regular Expressions","authors":"Victor Roussanaly, Yliès Falcone","doi":"10.4230/LIPIcs.TIME.2022.6","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2022.6","url":null,"abstract":"Ensuring the correctness of distributed cyber-physical systems can be done at runtime by monitoring properties over their behaviour. In a decentralised setting, such behaviour consists of multiple local traces, each offering an incomplete view of the system events to the local monitors, as opposed to the standard centralised setting with a unique global trace. We introduce the first monitoring framework for timed properties described by timed regular expressions over a distributed network of monitors. First, we define functions to rewrite expressions according to partial knowledge for both the centralised and decentralised cases. Then, we define decentralised algorithms for monitors to evaluate properties using these functions, as well as proofs of soundness and eventual completeness of said algorithms. Finally, we implement and evaluate our framework on synthetic timed regular expressions, giving insights on the cost of the centralised and decentralised settings and when to best use each of them.","PeriodicalId":75226,"journal":{"name":"Time","volume":"73 1","pages":"6:1-6:18"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84948587","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}
TimePub Date : 2022-01-01DOI: 10.4230/LIPIcs.TIME.2022.2
S. Miksch
{"title":"Visual Analytics Meets Temporal Reasoning: Challenges and Opportunities (Invited Talk)","authors":"S. Miksch","doi":"10.4230/LIPIcs.TIME.2022.2","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2022.2","url":null,"abstract":"Visual Analytics as the science of analytical reasoning facilitated by interactive visual interfaces aims to enable the exploration and the understanding of large, heterogeneous, and complex data sets. Time is an important data dimension with distinct characteristics. Intertwining Visual Analytics with time and temporal reasoning introduces outstanding challenges and opportunities, which I will illustrate in this talk.","PeriodicalId":75226,"journal":{"name":"Time","volume":"72 1","pages":"2:1-2:1"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81796036","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}
TimePub Date : 2022-01-01DOI: 10.4230/LIPIcs.TIME.2022.10
Dimitar P. Guelev
{"title":"Gabbay Separation for the Duration Calculus","authors":"Dimitar P. Guelev","doi":"10.4230/LIPIcs.TIME.2022.10","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2022.10","url":null,"abstract":"Gabbay’s separation theorem about linear temporal logic with past has proved to be one of the most useful theoretical results in temporal logic. In particular it enables a concise proof of Kamp’s seminal expressive completeness theorem for LTL. In 2000, Alexander Rabinovich established an expressive completeness result for a subset of the Duration Calculus (DC), a real-time interval temporal logic. DC is based on the chop binary modality, which restricts access to subintervals of the reference time interval, and is therefore regarded as introspective . The considered subset of DC is known as the ⌈ P ⌉ -subset in the literature. Neighbourhood Logic (NL), a system closely related to DC, is based on the neighbourhood modalities, also written ⟨ A ⟩ and ⟨ ¯ A ⟩ in the notation stemming from Allen’s system of interval relations. These modalities are expanding as they allow writing future and past formulas to impose conditions outside the reference interval. This setting makes temporal separation relevant: is expressive power ultimately affected, if past constructs are not allowed in the scope of future ones, or vice versa? In this paper we establish an analogue of Gabbay’s separation theorem for the ⌈ P ⌉ -subset of the extension of DC by the neighbourhood modalities, and the ⌈ P ⌉ -subset of the extension of DC by the neighbourhood modalities and chop -based analogue of Kleene star . We show that the result applies if the weak chop inverses , a pair binary expanding modalities, are given the role of the neighbourhood modalities, by virtue of the inter-expressibility between them and the neighbourhood modalities in the presence of chop .","PeriodicalId":75226,"journal":{"name":"Time","volume":"63 1","pages":"10:1-10:14"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80877236","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}
TimePub Date : 2022-01-01DOI: 10.4230/LIPIcs.TIME.2022.5
Florian Bruse, M. Lange, É. Lozes
{"title":"The Tail-Recursive Fragment of Timed Recursive CTL","authors":"Florian Bruse, M. Lange, É. Lozes","doi":"10.4230/LIPIcs.TIME.2022.5","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2022.5","url":null,"abstract":"","PeriodicalId":75226,"journal":{"name":"Time","volume":"153 1","pages":"5:1-5:16"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80997309","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}
TimePub Date : 2022-01-01DOI: 10.4230/LIPIcs.TIME.2022.15
J. Gutierrez, Sarit Kraus, Giuseppe Perelli, M. Wooldridge
{"title":"Giving Instructions in Linear Temporal Logic","authors":"J. Gutierrez, Sarit Kraus, Giuseppe Perelli, M. Wooldridge","doi":"10.4230/LIPIcs.TIME.2022.15","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2022.15","url":null,"abstract":"Our aim is to develop a formal semantics for giving instructions to taskable agents, to investigate the complexity of decision problems relating to these semantics, and to explore the issues that these semantics raise. In the setting we consider, agents are given instructions in the form of Linear Temporal Logic (LTL) formulae; the intuitive interpretation of such an instruction is that the agent should act in such a way as to ensure the formula is satisfied. At the same time, agents are assumed to have inviolable and immutable background safety requirements, also specified as LTL formulae. Finally, the actions performed by an agent are assumed to have costs, and agents must act within a limited budget. For this setting, we present a range of interpretations of an instruction to achieve an LTL task Υ, intuitively ranging from “try to do this but only if you can do so with everything else remaining unchanged” up to “drop everything and get this done.” For each case we present a formal pre-/post-condition semantics, and investigate the computational issues that they raise.","PeriodicalId":75226,"journal":{"name":"Time","volume":"6 1","pages":"15:1-15:14"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80323989","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}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
