Communicating sequential processes
Communicating sequential processes
Executing temporal logic programs
Executing temporal logic programs
Modal and temporal logic programming
Temporal logics and their applications
Journal of Symbolic Computation
Coloured Petri Nets: a high level language for system design and analysis
APN 90 Proceedings on Advances in Petri nets 1990
ACM Transactions on Programming Languages and Systems (TOPLAS)
Verifying properties of parallel programs: an axiomatic approach
Communications of the ACM
Formal verification of parallel programs
Communications of the ACM
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Tokio: Logic Programming Language Based on Temporal Logic and its Compilation to Prolog
Proceedings of the Third International Conference on Logic Programming
Projection in Temporal Logic Programming
LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
Cactus: A Branching-Time Logic Programming Language
ECSQARU/FAPR '97 Proceedings of the First International Joint Conference on Qualitative and Quantitative Practical Reasoning
Coloured Petri Nets and CPN Tools for modelling and validation of concurrent systems
International Journal on Software Tools for Technology Transfer (STTT)
Framed temporal logic programming
Science of Computer Programming
A compositional model of time Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
The Petri net markup language: concepts, technology, and tools
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Hi-index | 0.00 |
Many-core parallel computing and programming is a new challenge for formal specification and verification. This paper presents a semantic model for many-core parallel computing systems so that the systems can be modeled and verified in a manageable way. The model is called Cylinder Computation Model (CCM) which is based on projection constructs in Projection Temporal Logic (PTL) and Modeling, Simulation and Verification Language (MSVL). To this end, the syntax and semantics of CCM are presented in details. Further, some logic laws regarding CCM are given and the normal form of CCM programs is formalized and proved. Moreover, the operational semantics of CCM and an algorithm for implementing CCM programs with MSVL are also formalized. Finally, an example, simple word processor, is given to show how CCM works under MSVL paradigm.