Edward R. Griffor

Affiliations:
  • University of Leeds, UK


According to our database1, Edward R. Griffor authored at least 16 papers between 1983 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Specifying and Reasoning about CPS through the Lens of the NIST CPS Framework.
Theory Pract. Log. Program., September, 2023

Formalizing and Reasoning About Supply Chain Contracts Between Agents.
Proceedings of the Practical Aspects of Declarative Languages, 2023

2022
A Methodology for Modeling Interoperability of Smart Sensors in Smart Grids.
IEEE Trans. Smart Grid, 2022

2020
Reasoning About Trustworthiness in Cyber-Physical Systems Using Ontology-Based Representation and ASP.
Proceedings of the PRIMA 2020: Principles and Practice of Multi-Agent Systems, 2020

2019
Decision Support for Smart Grid: Using Reasoning to Contextualize Complex Decision Making.
Proceedings of the 7th Workshop on Modeling and Simulation of Cyber-Physical Energy Systems, 2019

2018
Ontology-Based Reasoning about the Trustworthiness of Cyber-Physical Systems.
CoRR, 2018

Reasoning about Smart City.
Proceedings of the 2018 IEEE International Conference on Smart Computing, 2018

An efficient timestamp-based monitoring approach to test timing constraints of cyber-physical systems.
Proceedings of the 55th Annual Design Automation Conference, 2018

2017
Timestamp Temporal Logic (TTL) for Testing the Timing of Cyber-Physical Systems.
ACM Trans. Embed. Comput. Syst., 2017

A Testbed to Verify the Timing Behavior of Cyber-Physical Systems: Invited.
Proceedings of the 54th Annual Design Automation Conference, 2017

1999
Preface.
Proceedings of the Handbook of Computability Theory, 1999

1998
Inaccessibility in Constructive Set Theory and Type Theory.
Ann. Pure Appl. Log., 1998

1994
The strength of some Martin-Löf type theories.
Arch. Math. Log., 1994

Mathematical theory of domains.
Cambridge tracts in theoretical computer science 22, Cambridge University Press, ISBN: 978-0-521-38344-8, 1994

1984
The Definability of E(alpha).
J. Symb. Log., 1984

1983
Some Consequences of Ad for Kleene Recursion in <sup>3</sup>E.
Math. Log. Q., 1983


  Loading...