Modeling and Verification of Real-Time Systems with the Event Calculus and s(CASP)

Varanasi, Sarat Chandra; Arias, Joaquín; Salazar, Elmer; Li, Fang; Basu, Kinjal; Gupta, Gopal

doi:10.1007/978-3-030-94479-7_12

Cited by 3 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As for a system design document, MBSA merges safety assessment models, such as the continuous time Markov chain (CTMC). They consider the complex behaviors of the system [4,5], and handle the safety requirements verification [6,7], time indicator calculation, etc. [8,9].…”

Section: Introductionmentioning

confidence: 99%

Formal Management-Specifying Approach for Model-Based Safety Assessment

Xu,

Duan,

Zhang

2023

J. of Syst. Eng. Electron.

View full text Add to dashboard Cite

In the field of model-based system assessment, mathematical models are used to interpret the system behaviors.However, the industrial systems in this intelligent era will be more manageable. Various management operations will be dynamically set, and the system will be no longer static as it is initially designed. Thus, the static model generated by the traditional model-based safety assessment (MBSA) approach cannot be used to accurately assess the dependability. There mainly exists three problems. Complex: huge and complex behaviors make the modeling to be trivial manual; Dynamic: though there are thousands of states and transitions, the previous model must be resubmitted to assess whenever new management arrives; Unreusable: as for different systems, the model must be resubmitted by reconsidering both the management and the system itself at the same time though the management is the same.Motivated by solving the above problems, this research studies a formal management specifying approach with the advantages of agility modeling, dynamic modeling, and specification design that can be re-suable. Finally, three typical managements are specified in a series-parallel system as a demonstration to show the potential.

show abstract

Section: Introductionmentioning

confidence: 99%

Formal Management-Specifying Approach for Model-Based Safety Assessment

Xu,

Duan,

Zhang

2023

J. of Syst. Eng. Electron.

View full text Add to dashboard Cite

show abstract

UAV Compliance Checking Using Answer Set Programming and Minimal Explanations Towards Compliance (Application Paper)

Varanasi

Meng

Alexander

et al. 2023

Practical Aspects of Declarative Languages

View full text Add to dashboard Cite

Locksynth: Deriving Synchronization Code for Concurrent Data Structures with ASP

VARANASI,

MITTAL,

GUPTA

2023

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

We present Locksynth, a tool that automatically derives synchronization needed for destructive updates to concurrent data structures that involve a constant number of shared heap memory write operations. Locksynth serves as the implementation of our prior work on deriving abstract synchronization code. Designing concurrent data structures involves inferring correct synchronization code starting with a prior understanding of the sequential data structure’s operations. Further, an understanding of shared memory model and the synchronization primitives is also required. The reasoning involved transforming a sequential data structure into its concurrent version can be performed using Answer Set Programming, and we mechanized our approach in previous work. The reasoning involves deduction and abduction that can be succinctly modeled in ASP. We assume that the abstract sequential code of the data structure’s operations is provided, alongside axioms that describe concurrent behavior. This information is used to automatically derive concurrent code for that data structure, such as dictionary operations for linked lists and binary search trees that involve a constant number of destructive update operations. We also are able to infer the correct set of locks (but not code synthesis) for external height-balanced binary search trees that involve left/right tree rotations. Locksynth performs the analyses required to infer correct sets of locks and as a final step, also derives the C++ synchronization code for the synthesized data structures. We also provide a performance analysis of the C++ code synthesized by Locksynth with the hand-crafted versions available from the Synchrobench microbenchmark suite. To the best of our knowledge, our tool is the first to employ ASP as a backend reasoner to perform concurrent data structure synthesis.

show abstract

Modeling and Verification of Real-Time Systems with the Event Calculus and s(CASP)

Cited by 3 publications

References 13 publications

Formal Management-Specifying Approach for Model-Based Safety Assessment

Formal Management-Specifying Approach for Model-Based Safety Assessment

UAV Compliance Checking Using Answer Set Programming and Minimal Explanations Towards Compliance (Application Paper)

Locksynth: Deriving Synchronization Code for Concurrent Data Structures with ASP

Contact Info

Product

Resources

About