Petri-net-based model checking for privacy-critical multiagent systems
Computation tree logic of knowledge (CTLK) can be used to specify many properties related
to privacy of multiagent systems (MASs). Our previous work defined knowledge-oriented …
to privacy of multiagent systems (MASs). Our previous work defined knowledge-oriented …
Presentation of the 9th edition of the model checking contest
Abstract The Model Checking Contest (MCC) is an annual competition of software tools for
model checking. Tools must process an increasing benchmark gathered from the whole …
model checking. Tools must process an increasing benchmark gathered from the whole …
Structural reductions revisited
Y Thierry-Mieg - Application and Theory of Petri Nets and Concurrency …, 2020 - Springer
Structural reductions are a powerful class of techniques that reason on a specification with
the goal to reduce it before attempting to explore its behaviors. In this paper we present new …
the goal to reduce it before attempting to explore its behaviors. In this paper we present new …
How Petri net theory serves Petri net model checking: a survey
K Wolf - Transactions on Petri Nets and Other Models of …, 2019 - Springer
Abstract Structure theory is a unique treasure of the Petri net community. It was originally
studied as a set of stand-alone techniques for exploring Petri net properties such as …
studied as a set of stand-alone techniques for exploring Petri net properties such as …
Taking some burden off an explicit CTL model checker
T Liebke, K Wolf - Application and Theory of Petri Nets and Concurrency …, 2019 - Springer
In the CTL category of recent model checking contests, less problems have been solved
than in the Reachability and LTL categories. Hence, improving CTL model checking …
than in the Reachability and LTL categories. Hence, improving CTL model checking …
Automata-Driven Partial Order Reduction and Guided Search for LTL Model Checking
In LTL model checking, a system model is synchronized using the product construction with
Büchi automaton representing all runs that invalidate a given LTL formula. An existence of a …
Büchi automaton representing all runs that invalidate a given LTL formula. An existence of a …
[PDF][PDF] 模拟实时系统的点区间优先级时间Petri 网与TCTL 验证
何雷锋, 刘关俊 - 软件学报, 2022 - jos.org.cn
时间Petri 网为实时系统提供了一种形式化的建模方法, 时间计算树逻辑(TCTL)
为描述实时系统与时间相关的设计需求提供了一种逻辑化的表达方式, 因此, 基于时间Petri …
为描述实时系统与时间相关的设计需求提供了一种逻辑化的表达方式, 因此, 基于时间Petri …
Model checking CTLK based on knowledge-oriented Petri nets
We define Knowledge-oriented Petri Nets (KPN) to model and analyze multi-agent systems
(MAS) especially from the perspective of privacy and security. A KPN is a special Petri net in …
(MAS) especially from the perspective of privacy and security. A KPN is a special Petri net in …
[HTML][HTML] Study of the efficiency of model checking techniques using results of the MCC from 2015 To 2019
In various scientific communities dealing with formal analysis, software competitions have
emerged and contributed to fostering progress in state of the art and providing insight into …
emerged and contributed to fostering progress in state of the art and providing insight into …
Verifying computation tree logic of knowledge via the similar reachability graphs of knowledge-oriented Petri nets
Computation Tree Logic of Knowledge (CTLK) can specify many requirements of privacy or
security of multi-agent systems (MAS). In our previous paper, we defined Knowledge …
security of multi-agent systems (MAS). In our previous paper, we defined Knowledge …