From Church and Prior to PSL
From MaRDI portal
Publication:3512439
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) History of computer science (68-03) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Logic in computer science (03B70)
Recommendations
Cited in
(13)- First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
- Regular decision processes
- Validating the PSL/Sugar semantics using automated reasoning
- Almost event-rate independent monitoring
- First-order rewritability of ontology-mediated queries in linear temporal logic
- A survey of challenges for runtime verification from advanced application domains (beyond software)
- On the Hybrid Extension of CTL and CTL +
- Transfer of model checking to industrial practice
- Linear temporal logic symbolic model checking
- From Löwenheim to PSL and SVA
- From Monadic Logic to PSL
- Functional specification of hardware via temporal logic
- From Philosophical to Industrial Logics
This page was built for publication: From Church and Prior to PSL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512439)