A Logic for Knowledge, Correctness, and Real Time

Woźna, Bożena; Lomuscio, Alessio

doi:10.1007/11533092_1

Cited by 11 publications

(8 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The communication mechanism between the components of the distributed time-asynchronous automaton that distributes the centralized control of a to-be-simulated partitioned stopwatch automaton works by ensuring that, during each "handshake" between what we called "source component" and "target component" of a transition, both components achieve a form of common knowledge ensuring them that the other is consistently simulating the behavior of the partitioned stopwatch automaton. It would be interesting to investigate whether general real-time epistemic frameworks like in [19,30] can be used to get a simpler proof of our simulation result.…”

Section: Resultsmentioning

confidence: 97%

A study on shuffle, stopwatches and independently evolving clocks

Dima

Lanotte²

2011

Distrib. Comput.

View full text Add to dashboard Cite

We show that stopwatch automata are equivalent with timed shuffle expressions, an extension of timed regular expressions with the shuffle operation.\ud Since the emptiness problem is undecidable for stopwatch automata, and hence also for timed shuffle expressions,\ud we introduce a decidable subclass of stopwatch automata called psas.\ud We give for this class an equivalent subclass of timed shuffle expressions and investigate closure properties by showing that psas are closed under union, concatenation, star, shuffle and renaming, but not under intersection.\ud We also show that psas are equivalent with adtas, which are asynchronous compositions of timed automata in which time may evolve independently

show abstract

Section: Resultsmentioning

confidence: 97%

A study on shuffle, stopwatches and independently evolving clocks

Dima

Lanotte²

2011

Distrib. Comput.

View full text Add to dashboard Cite

show abstract

“…Besides the above, it is worth mentioning the work by Woźna & Lomuscio [28] where TCTLKD s presented. TCTLKD is a combination of epistemic logic, CTL, a deontic modality and real time.…”

Section: Related Workmentioning

confidence: 99%

Timed Epistemic Knowledge Bases for Social Networks

2018

View full text Add to dashboard Cite

We present an epistemic logic equipped with time-stamps in the atoms and epistemic operators, which allows to reason not only about information available to the different agents, but also about the moments at which events happen and new knowledge is acquired or deduced. Our logic includes both an epistemic operator and a belief operator, which allows to model the disclosure of information that may not be accurate.Our main motivation is to model rich privacy policies in online social networks. Online Social Networks (OSNs) are increasingly used for social interactions in the modern digital era, which bring new challenges and concerns in terms of privacy. Most social networks today offer very limited mechanisms to express the desires of users in terms of how information that affects their privacy is shared. In particular, most current privacy policy formalisms allow only static policies, which are not rich enough to express timed properties like "my location after work should not be disclosed to my boss". The logic we present in this paper enables to express rich properties and policies in terms of the knowledge available to the different users and the precise time of actions and deductions. Our framework can be instantiated for different OSNs, by specifying the effect of the actions in the evolution of the social network and in the knowledge disclosed to each agent.We present an algorithm for deducing knowledge, which can also be instantiated with different variants of how the epistemic information is preserved through time. Our algorithm allows to model not only social networks with eternal information but also networks with ephemeral disclosures. Policies are modelled as formulae in the logic, which are interpreted over timed traces representing the evolution of the social network. Alice picture 0 (Bob, pub) K 0 Alice B 0 Alice loc 0 (Bob, pub)

show abstract

“…Obviously, defining the full fusion would not be problematic [25] but we use a fragment because it is more suited for the model checking method that we use later.…”

Section: Syntaxmentioning

confidence: 99%