CSP and Kripke Structures

DOI10.1007/978-3-319-25150-9_29MaRDI QIDQ2787446zbMATH OpenOpenAlexFDO

Authors Ana Cavalcanti, Wen-ling Huang, Jan Peleska, Jim Woodcock

Publication date 25 February 2016

Published in Theoretical Aspects of Computing - ICTAC 2015 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-25150-9_29

zbMATH Keywords

runtime verificationsemantic modelsformal testingUTP

Mathematics Subject Classification ID

Theory of programming languages (68N15) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Recommendations

• Structural tractability of enumerating CSP solutions
• Methods and Applications of Artificial Intelligence
• Communicating Sequential Processes. The First 25 Years
• Dealing with satisfiability and \(n\)-ary CSPs in a logical framework
• scientific article; zbMATH DE number 35422
• Denotational semantics of CSP
• On CSP and the algebraic theory of effects
• On the complexity of reasoning in Kleene algebra
• On the complexity of \#CSP

Cited in

(8)

• scientific article; zbMATH DE number 5999552 (Why is no real title available?)
• Denotational semantics of CSP
• scientific article; zbMATH DE number 5531977 (Why is no real title available?)
• scientific article; zbMATH DE number 810103 (Why is no real title available?)
• 2-cnfs and logical embeddings
• scientific article; zbMATH DE number 35422 (Why is no real title available?)
• scientific article; zbMATH DE number 3911719 (Why is no real title available?)
• Complete model-based equivalence class testing for nondeterministic systems

Describes a project that uses

Uses Software

• SafeJML
• FDR3

This page was built for publication: CSP and Kripke Structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2787446)