Translating Testing Theories for Concurrent Systems

DOI10.1007/978-3-319-23506-6_10zbMath1444.68121OpenAlexW2173472474MaRDI QIDQ3449629

Jan Peleska

Publication date: 4 November 2015

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-23506-6_10

zbMATH Keywords

institutionssemanticsruntime verificationmodel-based testingcyber-physical systems

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• LTL2BA

Cites Work

• Unnamed Item
• Unnamed Item
• Design and verification of fault tolerant systems with CSP
• Safety, liveness and fairness in temporal logic
• Institution-independent model theory
• LTL to Büchi Automata Translation: Fast and More Deterministic
• Structured CSP – A Process Algebra as an Institution
• Institutions: abstract model theory for specification and programming
• Formal Techniques for Networked and Distributed Systems - FORTE 2003

This page was built for publication: Translating Testing Theories for Concurrent Systems