The Experts below are selected from a list of 1386 Experts worldwide ranked by ideXlab platform

Alessio Lomuscio - One of the best experts on this subject based on the ideXlab platform.

  • model checking unbounded artifact centric systems
    Principles of Knowledge Representation and Reasoning, 2014
    Co-Authors: Alessio Lomuscio, Jakub Michaliszyn
    Abstract:

    Artifact-centric systems are a recent paradigm for representing and implementing business processes. We present further results on the verification problem of artifact-centric systems specified by means of FO-CTL specifications. While the general problem is known to be undecidable, results in the literature prove decidability for artifact systems with infinite domains under boundedness and conditions such as uniformity. We here follow a different approach and investigate the general case with infinite domains. We show decidability of the model checking problem for the class of artifact-centric systems whose database schemas consist of a single Unary Relation, and we show that that the problem is undecidable if artifact systems are defined by using one binary Relation or two Unary Relations.

  • Model Checking Unbounded Artifact-Centric Systems
    AAAI Press, 2014
    Co-Authors: Alessio Lomuscio, Michaliszyn J
    Abstract:

    Copyright © 2014, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.Artifact-centric systems are a recent paradigm for representing and implementing business processes. We present further results on the verification problem of artifact-centric systems specified by means of FO-CTL specifications. While the general problem is known to be undecidable, results in the literature prove decidability for artifact systems with infinite domains under boundedness and conditions such as uniformity. We here follow a different approach and investigate the general case with infinite domains. We show decidability of the model checking problem for the class of artifact-centric systems whose database schemas consist of a single Unary Relation, and we show that that the problem is undecidable if artifact systems are defined by using one binary Relation or two Unary Relations

Jakub Michaliszyn - One of the best experts on this subject based on the ideXlab platform.

  • model checking unbounded artifact centric systems
    Principles of Knowledge Representation and Reasoning, 2014
    Co-Authors: Alessio Lomuscio, Jakub Michaliszyn
    Abstract:

    Artifact-centric systems are a recent paradigm for representing and implementing business processes. We present further results on the verification problem of artifact-centric systems specified by means of FO-CTL specifications. While the general problem is known to be undecidable, results in the literature prove decidability for artifact systems with infinite domains under boundedness and conditions such as uniformity. We here follow a different approach and investigate the general case with infinite domains. We show decidability of the model checking problem for the class of artifact-centric systems whose database schemas consist of a single Unary Relation, and we show that that the problem is undecidable if artifact systems are defined by using one binary Relation or two Unary Relations.

Michaliszyn J - One of the best experts on this subject based on the ideXlab platform.

  • Model Checking Unbounded Artifact-Centric Systems
    AAAI Press, 2014
    Co-Authors: Alessio Lomuscio, Michaliszyn J
    Abstract:

    Copyright © 2014, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.Artifact-centric systems are a recent paradigm for representing and implementing business processes. We present further results on the verification problem of artifact-centric systems specified by means of FO-CTL specifications. While the general problem is known to be undecidable, results in the literature prove decidability for artifact systems with infinite domains under boundedness and conditions such as uniformity. We here follow a different approach and investigate the general case with infinite domains. We show decidability of the model checking problem for the class of artifact-centric systems whose database schemas consist of a single Unary Relation, and we show that that the problem is undecidable if artifact systems are defined by using one binary Relation or two Unary Relations

Schoutens H. - One of the best experts on this subject based on the ideXlab platform.

  • Degree Spectra for Transcendence in Fields
    2019
    Co-Authors: Miller R., Schoutens H.
    Abstract:

    © 2019, Springer Nature Switzerland AG. We show that for both the Unary Relation of transcendence and the finitary Relation of algebraic independence on a field, the degree spectra of these Relations may consist of any single computably enumerable Turing degree, or of those c.e. degrees above an arbitrary fixed Δ20 degree. In other cases, these spectra may be characterized by the ability to enumerate an arbitrary Σ20 set. This is the first proof that a computable field can fail to have a computable copy with a computable transcendence basis

Schoutens Hans - One of the best experts on this subject based on the ideXlab platform.

  • Degree spectra for transcendence in fields
    'Springer Science and Business Media LLC', 2019
    Co-Authors: Kalimullin Iskander, Miller Russell, Schoutens Hans
    Abstract:

    We show that for both the Unary Relation of transcendence and the finitary Relation of algebraic independence on a field, the degree spectra of these Relations may consist of any single computably enumerable Turing degree, or of those c.e. degrees above an arbitrary fixed $\Delta^0_2$ degree. In other cases, these spectra may be characterized by the ability to enumerate an arbitrary $\Sigma^0_2$ set. This is the first proof that a computable field can fail to have a computable copy with a computable transcendence basis