It has been shown that every temporal logic formula satisfiable over general linear time has a model than can be expressed as a finite Model Expression (ME). The reals are a subclass of general linear time, so similar techniques can be used for the reals. Although MEs are expressive enough for this task, they represent only a single class of elementary equivalent models. In the case where time is represented by integers, regular expressions are equivalent to automata. An ME is more similar to a single run of an automaton than the automaton itself. In linear time it is often useful to model a system as an automaton (or regular expression) rather than a single run of the automaton. In this paper we extend MEs with the operators from Regular Expressions to produce Regular Model Expressions (RegMEs). It is known that model checking temporal logic formulas over MEs is PSPACE-complete. We show that model checking temporal logic formulas over RegMEs is also PSPACE-complete.
{"title":"Modelling Systems over General Linear Time","authors":"J. McCabe-Dansted, M. Reynolds, T. French","doi":"10.1109/TIME.2016.21","DOIUrl":"https://doi.org/10.1109/TIME.2016.21","url":null,"abstract":"It has been shown that every temporal logic formula satisfiable over general linear time has a model than can be expressed as a finite Model Expression (ME). The reals are a subclass of general linear time, so similar techniques can be used for the reals. Although MEs are expressive enough for this task, they represent only a single class of elementary equivalent models. In the case where time is represented by integers, regular expressions are equivalent to automata. An ME is more similar to a single run of an automaton than the automaton itself. In linear time it is often useful to model a system as an automaton (or regular expression) rather than a single run of the automaton. In this paper we extend MEs with the operators from Regular Expressions to produce Regular Model Expressions (RegMEs). It is known that model checking temporal logic formulas over MEs is PSPACE-complete. We show that model checking temporal logic formulas over RegMEs is also PSPACE-complete.","PeriodicalId":347020,"journal":{"name":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126304835","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}
The purpose of this research is to develop a highly reliable simulator of hybrid systems, i.e., systems involving both discrete change and continuous evolution. In particular, we aim at rigorous simulation of parametrized hybrid systems, which enables not only the analysis of model's possible behavior but also the design of parameters that realize desired properties. Simulators with interval arithmetic can reliably compute a reachable set of states, but preserving the dependency of uncertain quantities in models is still challenging. In this paper, we discuss a simulation method that is based on symbolic computation and cooperates with the interval Newton method and affine arithmetic, which is able to preserve first-order dependency of uncertain quantities. We implemented the algorithm on the symbolic simulator we have been developing and evaluated the performance of the method with example models.
{"title":"Symbolic Simulation of Parametrized Hybrid Systems with Affine Arithmetic","authors":"Shota Matsumoto, K. Ueda","doi":"10.1109/TIME.2016.8","DOIUrl":"https://doi.org/10.1109/TIME.2016.8","url":null,"abstract":"The purpose of this research is to develop a highly reliable simulator of hybrid systems, i.e., systems involving both discrete change and continuous evolution. In particular, we aim at rigorous simulation of parametrized hybrid systems, which enables not only the analysis of model's possible behavior but also the design of parameters that realize desired properties. Simulators with interval arithmetic can reliably compute a reachable set of states, but preserving the dependency of uncertain quantities in models is still challenging. In this paper, we discuss a simulation method that is based on symbolic computation and cooperates with the interval Newton method and affine arithmetic, which is able to preserve first-order dependency of uncertain quantities. We implemented the algorithm on the symbolic simulator we have been developing and evaluated the performance of the method with example models.","PeriodicalId":347020,"journal":{"name":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116797741","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}
This paper presents a technique for weaving temporal semantics into an SQL query. We assume that a query writer programs a query and then annotates the query with some temporal semantics, such as sequenced or nonsequenced semantics. The annotation is a lightweight temporal statement modifier, it changes the semantics by which the query is evaluated. Annotations can be specified for a wide variety of semantics including sequenced and nonsequenced semantics. We give a denotational semantics for translating SQL queries with temporal annotations into Nested SQL. Nested SQL is SQL with some additional operations. We also describe how the translation is implemented using an ANTLR grammar for SQLite.
{"title":"Translating Temporal SQL to Nested SQL","authors":"C. Dyreson, Venkata A. Rani","doi":"10.1109/TIME.2016.24","DOIUrl":"https://doi.org/10.1109/TIME.2016.24","url":null,"abstract":"This paper presents a technique for weaving temporal semantics into an SQL query. We assume that a query writer programs a query and then annotates the query with some temporal semantics, such as sequenced or nonsequenced semantics. The annotation is a lightweight temporal statement modifier, it changes the semantics by which the query is evaluated. Annotations can be specified for a wide variety of semantics including sequenced and nonsequenced semantics. We give a denotational semantics for translating SQL queries with temporal annotations into Nested SQL. Nested SQL is SQL with some additional operations. We also describe how the translation is implemented using an ANTLR grammar for SQLite.","PeriodicalId":347020,"journal":{"name":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127212419","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}
Raúl Pardo, Ivana Kellyerova, César Sánchez, G. Schneider
Online Social Networks are ubiquitous, bringing not only numerous new possibilities but also big threats and challenges. Privacy is one of them. Most social networks today offer a limited set of (static) privacy settings, not being able to express dynamic policies. For instance, users might decide to protect their location during the night, or share information with difference audiences depending on their current position. In this paper we introduce TFPPF, a formal framework to express, and reason about, dynamic (and recurrent) privacy policies that are activated or deactivated by context (events) or time. Besides a formal policy language (TPPL), the framework includes a knowledge-based logic extended with (linear) temporal operators and a learning modality (TKBL). Policies, and formulae in the logic, are interpreted over (timed) traces representing the evolution of the social network. We prove that checking privacy policy conformance, and the model-checking problem for TKBL, are both decidable.
{"title":"Specification of Evolving Privacy Policies for Online Social Networks","authors":"Raúl Pardo, Ivana Kellyerova, César Sánchez, G. Schneider","doi":"10.1109/TIME.2016.15","DOIUrl":"https://doi.org/10.1109/TIME.2016.15","url":null,"abstract":"Online Social Networks are ubiquitous, bringing not only numerous new possibilities but also big threats and challenges. Privacy is one of them. Most social networks today offer a limited set of (static) privacy settings, not being able to express dynamic policies. For instance, users might decide to protect their location during the night, or share information with difference audiences depending on their current position. In this paper we introduce TFPPF, a formal framework to express, and reason about, dynamic (and recurrent) privacy policies that are activated or deactivated by context (events) or time. Besides a formal policy language (TPPL), the framework includes a knowledge-based logic extended with (linear) temporal operators and a learning modality (TKBL). Policies, and formulae in the logic, are interpreted over (timed) traces representing the evolution of the social network. We prove that checking privacy policy conformance, and the model-checking problem for TKBL, are both decidable.","PeriodicalId":347020,"journal":{"name":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130926553","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}
We investigate the minimal length and nesting depth of temporal formulae that distinguish two given non-bisimilar finite pointed transition systems. We show that such formula can always be constructed in length at most exponential in the combined number of states of both transition systems, and give an example with exponential lower bound, for several common temporal languages. We then show that by using renamings of subformulae or explicit assignments the length of the distinguishing formula can always be reduced to one that is bounded above by a cubic polynomial on the combined size of both transition systems. This is also a bound for the size obtained by using DAG representation of formulae. We also prove that the minimal nesting depth for such formula is less than the combined size of the two state spaces and obtain some tight upper bounds.
{"title":"On the Length and Depth of Temporal Formulae Distinguishing Non-bisimilar Transition Systems","authors":"V. Goranko, Louwe B. Kuijer","doi":"10.1109/TIME.2016.26","DOIUrl":"https://doi.org/10.1109/TIME.2016.26","url":null,"abstract":"We investigate the minimal length and nesting depth of temporal formulae that distinguish two given non-bisimilar finite pointed transition systems. We show that such formula can always be constructed in length at most exponential in the combined number of states of both transition systems, and give an example with exponential lower bound, for several common temporal languages. We then show that by using renamings of subformulae or explicit assignments the length of the distinguishing formula can always be reduced to one that is bounded above by a cubic polynomial on the combined size of both transition systems. This is also a bound for the size obtained by using DAG representation of formulae. We also prove that the minimal nesting depth for such formula is less than the combined size of the two state spaces and obtain some tight upper bounds.","PeriodicalId":347020,"journal":{"name":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125832217","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}
Model checking is a successful technique widely used in formal verification. Given a model of a system and a formula specifying a desired property of it, one can verify whether the system satisfies the property by checking the formula against the model. Distinctive features of model checking are: (i) it is a fully automatic process, (ii) it exaustively checks all the possible behaviours of the system, and (iii) it produces a counterexample, in case the property is violated. Systems are usually modeled as (finite) Kripke structures, that is, state-transition systems, and their properties are specified by formulas of point-based temporal logics, such as LTL, CTL, and the like. These logics allow one to express requirements on computation states and their relationships; however, they are not well suited to specify conditions on computation stretches, which come into play when dealing with, for instance, actions with duration, accomplishments, and temporal aggregations. To overcome the limitations of point-based logics, one can resort to interval temporal logics (ITLs), that assume time intervals,instead of time points, as their primitive entities. The most well-known ITL is Halpern and Shoham's modal logic of time intervals HS [4], which features one modality for each possible ordering relation between a pair of intervals, apart from equality. The satisfiability problem for HS has been studied in [4], and it turns out to be highly undecidable forall relevant (classes of) linear orders. The same holds for most fragments of it [2]; luckily, some meaningful exceptions exist, including the logic of temporal neighbourhood and the temporal logic of sub-intervals.
{"title":"Interval Temporal Logics Model Checking","authors":"A. Montanari","doi":"10.1109/TIME.2016.32","DOIUrl":"https://doi.org/10.1109/TIME.2016.32","url":null,"abstract":"Model checking is a successful technique widely used in formal verification. Given a model of a system and a formula specifying a desired property of it, one can verify whether the system satisfies the property by checking the formula against the model. Distinctive features of model checking are: (i) it is a fully automatic process, (ii) it exaustively checks all the possible behaviours of the system, and (iii) it produces a counterexample, in case the property is violated. Systems are usually modeled as (finite) Kripke structures, that is, state-transition systems, and their properties are specified by formulas of point-based temporal logics, such as LTL, CTL, and the like. These logics allow one to express requirements on computation states and their relationships; however, they are not well suited to specify conditions on computation stretches, which come into play when dealing with, for instance, actions with duration, accomplishments, and temporal aggregations. To overcome the limitations of point-based logics, one can resort to interval temporal logics (ITLs), that assume time intervals,instead of time points, as their primitive entities. The most well-known ITL is Halpern and Shoham's modal logic of time intervals HS [4], which features one modality for each possible ordering relation between a pair of intervals, apart from equality. The satisfiability problem for HS has been studied in [4], and it turns out to be highly undecidable forall relevant (classes of) linear orders. The same holds for most fragments of it [2]; luckily, some meaningful exceptions exist, including the logic of temporal neighbourhood and the temporal logic of sub-intervals.","PeriodicalId":347020,"journal":{"name":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125543959","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}
Quasi-equal clocks reduction for networks of timed automata yields significant savings in verification costs of properties of timed automata by replacing clocks in equivalence classes by representative clocks. In this work we present the theoretical analysis that quantifies and justifies those savings. We propose new space and time bounds that characterise a less expensive model checking effort in transformed networks wrt. The effort in original networks with quasi-equal clocks. Additionally, we carry out improvements to our transformation algorithm in order to maximize savings wrt. Space and time, and we eliminate all remaining semantic assumptions on networks introduced to soundly apply the reduction of clocks.
{"title":"The Model Checking Problem in Networks with Quasi-Equal Clocks","authors":"Christian Herrera, B. Westphal","doi":"10.1109/TIME.2016.10","DOIUrl":"https://doi.org/10.1109/TIME.2016.10","url":null,"abstract":"Quasi-equal clocks reduction for networks of timed automata yields significant savings in verification costs of properties of timed automata by replacing clocks in equivalence classes by representative clocks. In this work we present the theoretical analysis that quantifies and justifies those savings. We propose new space and time bounds that characterise a less expensive model checking effort in transformed networks wrt. The effort in original networks with quasi-equal clocks. Additionally, we carry out improvements to our transformation algorithm in order to maximize savings wrt. Space and time, and we eliminate all remaining semantic assumptions on networks introduced to soundly apply the reduction of clocks.","PeriodicalId":347020,"journal":{"name":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129870456","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}
We consider the hybridisations of the full branching time logic CTL* through the addition of nominals, binders and jumps. We formally define three fragments restricting the interplay between hybrid operators and path formulae contrary to previous proposals in the literature which ignored potential problems with a formal semantics. We then investigate the model checking problem for these logics obtaining complexities from PSPACE-completeness to non-elementary decidability.
{"title":"Model Checking for the Full Hybrid Computation Tree Logic","authors":"Daniel Kernberger, M. Lange","doi":"10.1109/TIME.2016.11","DOIUrl":"https://doi.org/10.1109/TIME.2016.11","url":null,"abstract":"We consider the hybridisations of the full branching time logic CTL* through the addition of nominals, binders and jumps. We formally define three fragments restricting the interplay between hybrid operators and path formulae contrary to previous proposals in the literature which ignored potential problems with a formal semantics. We then investigate the model checking problem for these logics obtaining complexities from PSPACE-completeness to non-elementary decidability.","PeriodicalId":347020,"journal":{"name":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128196015","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}
Raphaël Fournier-S’niehotta, P. Rigaux, Nicolas Travers
We consider the emerging field of music score libraries, where documents rely on a music notation markup language such as MusicXML or MEI. We propose to model as synchronized time-series the music structure that can be extracted from such documents, together with an algebra that operates in closed form and allows manipulations, restructurings, and combinations of music scores stored in a database. We formally present the model, its algebraic operators, and finally show how our approach can serve as a building block for a query and analytic language on large collections of XML-encoded music scores.
{"title":"Querying Music Notation","authors":"Raphaël Fournier-S’niehotta, P. Rigaux, Nicolas Travers","doi":"10.1109/TIME.2016.13","DOIUrl":"https://doi.org/10.1109/TIME.2016.13","url":null,"abstract":"We consider the emerging field of music score libraries, where documents rely on a music notation markup language such as MusicXML or MEI. We propose to model as synchronized time-series the music structure that can be extracted from such documents, together with an algebra that operates in closed form and allows manipulations, restructurings, and combinations of music scores stored in a database. We formally present the model, its algebraic operators, and finally show how our approach can serve as a building block for a query and analytic language on large collections of XML-encoded music scores.","PeriodicalId":347020,"journal":{"name":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126703169","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}
Although temporal XML data are being stored and manipulated by several XML-based applications in different domains (e.g., e-commerce, e-health), there is neither a temporal XML update language proposed by researchers nor built-in support provided by existing XML DBMSs and tools, for maintaining such data. Furthermore, in the well known temporal XML framework tauXSchema, there are no features for inserting, deleting or updating temporal XML instances. In this paper, we bridge these gaps by proposing a temporal extension of the W3C XQuery Update Facility (XUF) language, named tauXUF (Temporal XUF), which allows manipulating temporal XML data in tauXSchema. With tauXUF both the syntax and the semantics of the update expressions of the XUF language are extended to support temporal aspects. Examples are also provided to motivate and illustrate our proposal.
{"title":"tauXUF: A Temporal Extension of the XQuery Update Facility Language for the tauXSchema Framework","authors":"Zouhaier Brahmia, F. Grandi, R. Bouaziz","doi":"10.1109/TIME.2016.22","DOIUrl":"https://doi.org/10.1109/TIME.2016.22","url":null,"abstract":"Although temporal XML data are being stored and manipulated by several XML-based applications in different domains (e.g., e-commerce, e-health), there is neither a temporal XML update language proposed by researchers nor built-in support provided by existing XML DBMSs and tools, for maintaining such data. Furthermore, in the well known temporal XML framework tauXSchema, there are no features for inserting, deleting or updating temporal XML instances. In this paper, we bridge these gaps by proposing a temporal extension of the W3C XQuery Update Facility (XUF) language, named tauXUF (Temporal XUF), which allows manipulating temporal XML data in tauXSchema. With tauXUF both the syntax and the semantics of the update expressions of the XUF language are extended to support temporal aspects. Examples are also provided to motivate and illustrate our proposal.","PeriodicalId":347020,"journal":{"name":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131135941","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号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：