Leifeng He

Tongji University

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 Petri nets (KPNs) to formally describe both the interacting/collaborating process of multiagents and their epistemic evolutions. Our KPN-based verification of CTLK required t...

When a group of real-time tasks with dependent relations are performed in parallel in a multi-processor interruptible environment, time-related requirements are easily destroyed so that the correct design of such a system is complex and difficult. Therefore, it is necessary for designers to use some precise methods to verify their correctness, whil...

This paper proposes a new heuristic method to quickly construct OBDD variable order for Petri net based CTL model checking. Consequently, OBDDs using these orders have a good compressing effect for modular and loosely-coupled Petri nets. For further enhancing the performance of our model checking, we apply a model checking strategy: when producing...

Computation Tree Logic of Knowledge (CTLK) can specify many design requirements of privacy and security of multi-agent systems (MAS). In our conference paper, we defined Knowledge-oriented Petri Nets (KPN) to model MAS and proposed Reachability Graphs with Equivalence Relations (RGER) to verify CTLK. In this paper, we use the technique of Ordered B...

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 which some places are used to represent knowledges. Consequently, KPN can formally represent not only the interaction/collaboration process of multiple agents but also...

Inter-organization workflow nets (IWF-nets) can well model the interactions among multiple business processes by sending/receiving messages, and their compatibility is a very important property to guarantee that their logical behaviors are correct. Liu and Jiang introduce a class of IWF-nets named SCIWF-nets (simple circuit IWF-nets) to model inter...

E-commerce Business Process Nets (EBPNs for short) are a novel formal model of describing and verifying e-commerce business processes with multiple interactive parties. They can well reflect some behavior-security properties such as data-live and data-boundedness. However, the problem of effectively analyzing EBPNs remains largely open since data a...