Optimal Control of Colored Timed Petri Nets Under Generalized Mutual Exclusion Temporal Constraints by Kohei Fujita, Toshimitsu Ushio

Subjects: Get full text

A Multi-Valued Simplified Halpern–Shoham–Moszkowski Logic for Gradable Verifiability in Reasoning about Digital Circuits by Krystian Jobczyk

Subjects: Get full text

A Proof of Stavi's Theorem by Alexander Rabinovich

“…However, this temporal logic is not expressively complete for FOMLO over the rationals. …”
Get full text

Expressiveness of Metric modalities for continuous time by Yoram Hirshfeld, Alexander Rabinovich

“…Moreover, there is no finite temporal logic that can express all of them over the real line, so that no finite metric temporal logic is expressively complete.…”
Get full text

Comparing LTL Semantics for Runtime Verification. by Bauer, A, Leucker, M, Schallhart, C

“…When monitoring a system w.r.t. a property defined in a temporal logic such as LTL, a major concern is to settle with an adequate interpretation of observable system events; that is, models of temporal logic formulae are usually infinite words of events, whereas at runtime only finite but incrementally expanding prefixes are available.In this work, we review LTL-derived logics for finite traces from a runtime-verification perspective. …”

Path Checking for MTL and TPTL over Data Words by Shiguang Feng, Markus Lohrey, Karin Quaas

“…Metric temporal logic (MTL) and timed propositional temporal logic (TPTL) are quantitative extensions of linear temporal logic, which are prominent and widely used in the verification of real-timed systems. …”
Get full text

Expressiveness and complexity results for strategic reasoning by Gutierrez, J, Harrenstein, P, Wooldridge, M

“…<p>This paper presents a range of expressiveness and complexity results for the specification, computation, and verification of Nash equilibria in multi-player non-zero-sum concurrent games in which players have goals expressed as temporal logic formulae. Our results are based on a novel approach to the characterisation of equilibria in such games: a semantic characterisation based on winning strategies and memoryful reasoning. …”

Polynomial Algorithm of Verication for Subset of PLTL Logic by P. V. Lebedev

“…<p align="LEFT">In this article a polynomial algorithm is described of verification of dynamic properties of Markov chains described by formulas of a subset of temporal logic PLTL (propositional temporal logic of linear time). …”
Get full text

Runtime Verification for LTL and TLTL. by Bauer, A, Leucker, M, Schallhart, C

“…This article studies runtime verification of properties expressed either in lineartime temporal logic (LTL) or timed lineartime temporal logic (TLTL). …”

A connectionist system approach for learning logic programs by Shamsuddin, Siti Mariam, Mashinchi, M. H.

“…In this paper, we show that temporal logic can be learnt effectively by a connectionist system. …”
Get full text

The cost of punctuality by Bouyer, P, Markey, N, Ouaknine, J, Worrell, J

“…In an influential paper titled "The Benefits of Relaxing Punctuality" [2], Alur, Feder, and Henzinger introduced Metric Interval Temporal Logic (MITL) as a fragment of the real-time logic Metric Temporal Logic (MTL) in which exact or punctual timing constraints are banned. …”

Equilibrium design for concurrent games by Gutierrez, J, Najib, M, Perelli, G, Wooldridge, M

“…In this paper, we study the design of incentives so that a desirable equilibrium is obtained, for instance, an equilibrium satisfying a given temporal logic property—a problem that we call equilibrium design. …”

Iterated Boolean games for rational verification by Gutierrez, J, Gao, T, Wooldridge, M

“…Rational verification is the problem of understanding what temporal logic properties hold of a multi-agent system when agents are modelled as players in a game, each acting rationally in pursuit of personal preferences. …”

Pemodelan logika pemeriksaan temporal linier dengan buchi automata=Logic checking linear temporal with buchi automata by Perpustakaan UGM, i-lib

“…Keywords: Modeling, Checking, Reactive system, Temporal Logic, Automaton.…”

EVE: A tool for temporal equilibrium analysis by Gutierrez, J, Najib, M, Perelli, G, Wooldridge, M

“…In EVE, systems are modelled using the Simple Reactive Module Language (SRML) as a collection of independent system components (players/agents in a game) and players’ goals are expressed using Linear Temporal Logic (LTL) formulae. EVE can be used to automatically check the existence of pure strategy Nash equilibria in such concurrent and multi-agent systems and to verify which temporal logic properties are satisfied in the equilibria.…”

Reasoning about equilibria in game-like concurrent systems by Gutierrez, J, Harrenstein, P, Wooldridge, M

“…We then define and investigate a branching-time temporal logic for reasoning about the equilibrium properties of game-like concurrent systems. …”

Automated temporal equilibrium analysis: Verification and synthesis of multi-player games by Gutierrez, J, Najib, M, Perelli, G, Wooldridge, M

“…Typically, those objectives are expressed as temporal logic formulae which the relevant agent desires to see satisfied. …”

Temporal ontology-mediated queries and first-order rewritability: A short course by Ryzhikov, V, Walega, P, Zakharyaschev, M

“…We consider two ways of introducing a temporal dimension in ontologies and queries: using linear temporal logic LTL over discrete time and using metric temporal logic MTL over dense time.…”

Automated verification of concurrent stochastic games by Kwiatkowska, M, Norman, G, Parker, D, Santos, G

“…To express properties of such models, we adapt the temporal logic rPATL (probabilistic alternating-time temporal logic with rewards), originally introduced for the simpler model of turn-based games, which enables quantitative reasoning about the ability of coalitions of players to achieve goals related to the probability of an event or reward measures. …”

From model checking to equilibrium checking: reactive modules for rational verification by Gutierrez, J, Harrenstein, B, Wooldridge, M

“…Model checking is the best-known and most successful approach to formally verifying that systems satisfy specifications, expressed as temporal logic formulae. In this article, we develop the theory of equilibrium checking, a related but distinct problem. …”