Time-Soundness of Time Petri Nets Modelling Time-Critical Systems

Liu, Guanjun; Jiang, Changjun; Zhou, MengChu

doi:10.1145/3185502

Cited by 16 publications

(8 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the future, we are interested in finding new automaton conversion methods to facilitate integration with other encryption schemes. We are also interested in modeling such a system using Petri nets, time Petri nets [52]- [56], or statetree structures [57], [58]. Another interesting direction for future work is to study in more detail on the framework of the supervisor encryption.…”

Section: Discussionmentioning

confidence: 99%

Homomorphic Encryption of Supervisory Control Systems Using Automata

Zhou

Nasr

et al. 2020

IEEE Access

View full text Add to dashboard Cite

Cyber-physical systems have been highly integrated into many contemporary infrastructures. As this integration deepens, the importance of protecting these systems from unauthorized access and data corruption increases. Nowadays, cyber-physical systems are not well protected against network attacks. One solution is to improve the security of a system by encrypting the transmitted data. In this paper, we consider the encryption of supervisors of discrete event systems modeled with deterministic finite-state automata. We propose an encryption framework of supervisory control systems based on the matrix notation of automata. The purpose of using matrix notation is to make it suitable for homomorphic encryption schemes over integers, which are emerging in the cryptography area. We calculate the entropy of the matrix notation and find that as the size of a system increases, it gets smaller and approaches zero. Owing to the low entropy of the matrix notation, we propose an algorithm to enhance its entropy. By applying the entropy-enhancing process, the distribution characteristics of entries in matrices or vectors can be hidden to avoid a brute force attack. Correspondingly, we propose an entropy restoration algorithm to ensure that the control action can be transmitted correctly.

show abstract

Section: Discussionmentioning

confidence: 99%

Homomorphic Encryption of Supervisory Control Systems Using Automata

Zhou

Nasr

et al. 2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…This makes traditional model checking insufficient to verify the spatiotemporal properties specified with STSL. The spatiotemporal traces for monitoring an STSL specification can be automata, petri nets [2], process algebra, neural networks, differential equations et al We are developing the monitoring tool. Firstly, we are developing the offline monitoring through sampling spatio-temporal traces for a simulated system against the spatio-temporal specification language.…”

Section: Discussionmentioning

confidence: 99%

“…Example 5.2. The railway traffic with sensors, present by Liu et.al [2], provides a good perspective to discuss the proposed spatio-temporal specification language. In their example, a train and a control zone can be treated as a region-based spatial terms.…”

Section: Example 51 In the Example 33 What We Can Also Guarantee mentioning

confidence: 99%

“…Describing spatio-temporal aspects is one of the important areas in cyber-physical systems. Many works have been done with concurrent [2], hybrid [3][4][5] and stochastic [6,7] behaviors of motion-based spatially distributed systems [8], but fewer researchers concentrate on spatio-temporal aspects. The major problem is multidimensional expressiveness and expensive verifiability for modeling and analysis of the spatio-temporal behaviors of cyber-physical systems.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A spatio-temporal specification language and its completeness & decidability

Liu

Sun

et al. 2020

J Cloud Comp

View full text Add to dashboard Cite

In the past few years, significant progress has been made on spatio-temporal cyber-physical systems in achieving spatio-temporal properties on several long-standing tasks. With the broader specification of spatio-temporal properties on various applications, the concerns over their spatio-temporal logics have been raised in public, especially after the widely reported safety-critical systems involving self-driving cars, intelligent transportation system, image processing. In this paper, we present a spatio-temporal specification language, STSL PC, by combining Signal Temporal Logic (STL) with a spatial logic S4 u, to characterize spatio-temporal dynamic behaviors of cyber-physical systems. This language is highly expressive: it allows the description of quantitative signals, by expressing spatio-temporal traces over real valued signals in dense time, and Boolean signals, by constraining values of spatial objects across threshold predicates. STSL PC combines the power of temporal modalities and spatial operators, and enjoys important properties such as finite model property. We provide a Hilbert-style axiomatization for the proposed STSL PC and prove the soundness and completeness by the spatio-temporal extension of maximal consistent set and canonical model. Further, we demonstrate the decidability of STSL PC and analyze the complexity of STSL PC. Besides, we generalize STSL to the evolution of spatial objects over time, called STSL OC, and provide the proof of its axiomatization system and decidability.

show abstract

“…In addition, they extended the model to support multiple railways. Many have used this extension as a benchmark for this domain [29], [30], [31], and we use it to continue our comparison. Figure 6 presents the extended PN model of [26] and our extended BP model.…”

Section: Expanding To Multi-trackmentioning

confidence: 99%

What Petri Net Obliges Us to Say: Comparing Approaches for Behavior Composition

Elyasaf¹,

Yaacov²,

Weiss³

2022

Preprint

View full text Add to dashboard Cite

We identify and demonstrate a weakness of Petri Nets (PN) in specifying complex behavior. Specifically, we show how, when specifying multiple requirements in one Petri net model, modelers are obliged to specify mechanisms for combining these requirements. This yields, in many cases, over-specification and incorrect models. We demonstrate how some execution paths are missed, and some are generated unintentionally. To support this claim, we analyze Petri net models from the literature, identify the combination mechanisms, and demonstrate their effect on the correctness of the model. To address this problem, we propose to model the system behavior using behavioral programming (BP), a software development and modeling paradigm designed for seamless integration of independent requirements. Specifically, we demonstrate how the semantics of BP, which define how to interweave scenarios into a single model, allow avoiding the over-specification. Additionally, while BP maintains the same mathematical properties as PN, it provides means for changing the model dynamically, thus increasing the agility of the specification. We compare BP and PN in quantitative and qualitative measures by analyzing the models, their generated execution paths, and the specification process. Finally, while BP is supported by tools that allow for applying formal methods and reasoning techniques to the model, it lacks the legacy of PN tools and algorithms. To address this issue, we propose semantics and a tool for translating BP models to PN and vice versa.

show abstract

Time-Soundness of Time Petri Nets Modelling Time-Critical Systems

Cited by 16 publications

References 43 publications

Homomorphic Encryption of Supervisory Control Systems Using Automata

Homomorphic Encryption of Supervisory Control Systems Using Automata

A spatio-temporal specification language and its completeness & decidability

What Petri Net Obliges Us to Say: Comparing Approaches for Behavior Composition

Contact Info

Product

Resources

About