Extending MSVL with Semaphore

DOI10.1007/978-3-319-42634-1_48zbMath1476.68183OpenAlexW2490513959MaRDI QIDQ2817902

Zhenhua Duan, Xinfeng Shu

Publication date: 2 September 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-42634-1_48

zbMATH Keywords

projectiontemporal logic programmingconcurrencymutual exclusionsemaphore

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Logic programming (68N17)

Related Items (2)

Efficient decision procedure for propositional projection temporal logic ⋮ A decision procedure and complete axiomatization for projection temporal logic

Uses Software

• SPIN

Cites Work

• Verification of distributed systems with the axiomatic system of MSVL
• Expressiveness of propositional projection temporal logic with star
• Framed temporal logic programming
• A decision procedure for propositional projection temporal logic with infinite models
• Unnamed Item
• Unnamed Item

This page was built for publication: Extending MSVL with Semaphore