Artur Męski
Research Subjects
Artur Męski has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Wojciech Penczek
Institute of Computer Science, PAS
10 shared publications - Maciej Koutny
Newcastle University
3 shared publications - Agata Półrola
University of Łodź
2 shared publications - Andrzej Zbrzezny
Department of Mathematics and Computer Science, Jan Dlugosz University in Czestochowa, Armii Krajowej 13/15, 42-200 Czestochowa, Poland
2 shared publications - Bożena Woźna-Szcześniak
Department of Mathematics and Computer Science, Faculty of Science and Technology, Jan Dlugosz University in Czestochowa, al. Armii Krajowej 13/15, 42-200 Czestochowa, Poland
2 shared publications Maciej Koutny
Newcastle University
2 shared publications
Latest Publications
- Open Access
- 5 November 2025
- Published by Springer Nature in Natural Computing
- Vol. 24 (4) , 1101-1117
Model checking for distributed reaction systems with temporal-epistemic properties
Reaction systems are a model of computation inspired by the biochemistry exhibited by living cells. This paper introduces the notion of agency as an extension to the reaction systems formalism, leading to distributed reaction systems. Adding agents in the reaction systems setting, allows for the natural modelling and representation of multi-agent and distributed systems. To support the specification of temporal-epistemic properties of distributed reaction systems, we introduce the logic rs ctlk and present experimental results of its associated model checking procedure run on a biological benchmark of within-cell signal transduction networks. The experimental results are encouraging despite the complexity of the rs ctlk model checking problem that is shown to be pspace -complete.
- 5 November 2025
- Published by Springer Nature in Natural Computing
- Vol. 24 (4) , 1101-1117
Open AccessModel checking for distributed reaction systems with temporal-epistemic properties
Reaction systems are a model of computation inspired by the biochemistry exhibited by living cells. This paper introduces the notion of agency as an extension to the reaction systems formalism, leading to distributed reaction systems. Adding agents in the reaction systems setting, allows for the natural modelling and representation of multi-agent and distributed systems. To support the specification of temporal-epistemic properties of distributed reaction systems, we introduce the logic rs ctlk and present experimental results of its associated model checking procedure run on a biological benchmark of within-cell signal transduction networks. The experimental results are encouraging despite the complexity of the rs ctlk model checking problem that is shown to be pspace -complete.
- Open Access
- 1 June 2024
- Published by Springer Nature in Natural Computing
- Vol. 23 (2) , 323-343
Reaction mining for reaction systems
Reaction systems are a formal model for computational processing in which reactions operate on sets of entities (molecules) providing a framework for dealing with qualitative aspects of biochemical systems. This paper is concerned with reaction systems in which entities can have discrete concentrations, and so reactions operate on multisets rather than sets of entities. The resulting framework allows one to deal with quantitative aspects of reaction systems, and a bespoke linear-time temporal logic allows one to express and verify a wide range of key behavioural system properties. In practical applications, a reaction system with discrete concentrations may only be partially specified, and the possibility of an effective automated calculation of the missing details provides an attractive design approach. With this idea in mind, the current paper discusses parametric reaction systems with parameters representing unknown parts of hypothetical reactions. The main result is a method aimed at replacing the parameters in such a way that the resulting reaction system operating in a specified external environment satisfies a given temporal logic formula.This paper provides an encoding of parametric reaction systems in smt, and outlines a synthesis procedure based on bounded model checking for solving the synthesis problem. It also reports on the initial experimental results demonstrating the feasibility of the novel synthesis method.
- 1 June 2024
- Published by Springer Nature in Natural Computing
- Vol. 23 (2) , 323-343
Open AccessReaction mining for reaction systems
Reaction systems are a formal model for computational processing in which reactions operate on sets of entities (molecules) providing a framework for dealing with qualitative aspects of biochemical systems. This paper is concerned with reaction systems in which entities can have discrete concentrations, and so reactions operate on multisets rather than sets of entities. The resulting framework allows one to deal with quantitative aspects of reaction systems, and a bespoke linear-time temporal logic allows one to express and verify a wide range of key behavioural system properties. In practical applications, a reaction system with discrete concentrations may only be partially specified, and the possibility of an effective automated calculation of the missing details provides an attractive design approach. With this idea in mind, the current paper discusses parametric reaction systems with parameters representing unknown parts of hypothetical reactions. The main result is a method aimed at replacing the parameters in such a way that the resulting reaction system operating in a specified external environment satisfies a given temporal logic formula.This paper provides an encoding of parametric reaction systems in smt, and outlines a synthesis procedure based on bounded model checking for solving the synthesis problem. It also reports on the initial experimental results demonstrating the feasibility of the novel synthesis method.
- 9 August 2017
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 154 (1-4) , 289-306
Verification of Linear-Time Temporal Properties for Reaction Systems with Discrete Concentrations
Reaction systems are a formal model for computational processes inspired by the functioning of the living cell. This paper introduces reaction systems with discrete concentrations, which are an extension of reaction systems allowing for quantitative
- 9 August 2017
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 154 (1-4) , 289-306
Verification of Linear-Time Temporal Properties for Reaction Systems with Discrete Concentrations
Reaction systems are a formal model for computational processes inspired by the functioning of the living cell. This paper introduces reaction systems with discrete concentrations, which are an extension of reaction systems allowing for quantitative
- Open Access
- 15 June 2016
- Published by Springer Nature
- p. 142-154
Towards Quantitative Verification of Reaction Systems
- 15 June 2016
- Published by Springer Nature
- p. 142-154
Open AccessTowards Quantitative Verification of Reaction Systems
- Open Access
- 9 September 2015
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 14 (4) , 1-23
Action Synthesis for Branching Time Logic
The article introduces a parametric extension of Action-Restricted Computation Tree Logic called pmARCTL. A symbolic fixed-point algorithm providing a solution to the exhaustive parameter synthesis problem is proposed. The parametric approach allows for an in-depth system analysis and synthesis of the correct parameter values. The time complexity of the problem and the algorithm is provided. An existential fragment of pmARCTL (pmEARCTL) is identified, in which all of the solutions can be generated from a minimal and unique base. A method for computing this base using symbolic methods is provided. The prototype tool SPATULA implementing the algorithm is applied to the analysis of three benchmarks: faulty Train-Gate-Controller, Peterson’s mutual exclusion protocol, and a generic pipeline processing network. The experimental results show efficiency and scalability of our approach compared to the naive solution to the problem.
- 9 September 2015
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 14 (4) , 1-23
Open AccessAction Synthesis for Branching Time Logic
The article introduces a parametric extension of Action-Restricted Computation Tree Logic called pmARCTL. A symbolic fixed-point algorithm providing a solution to the exhaustive parameter synthesis problem is proposed. The parametric approach allows for an in-depth system analysis and synthesis of the correct parameter values. The time complexity of the problem and the algorithm is provided. An existential fragment of pmARCTL (pmEARCTL) is identified, in which all of the solutions can be generated from a minimal and unique base. A method for computing this base using symbolic methods is provided. The prototype tool SPATULA implementing the algorithm is applied to the analysis of three benchmarks: faulty Train-Gate-Controller, Peterson’s mutual exclusion protocol, and a generic pipeline processing network. The experimental results show efficiency and scalability of our approach compared to the naive solution to the problem.
- 1 August 2015
- Published by Elsevier in Information Sciences
- Vol. 313, 22-42
Model checking temporal properties of reaction systems
- 1 August 2015
- Published by Elsevier in Information Sciences
- Vol. 313, 22-42
Model checking temporal properties of reaction systems
- 1 June 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
Action Synthesis for Branching Time Logic: Theory and Applications
We introduce a parametric extension of Action-Restricted Computation Tree Logic. A symbolic fixed-point algorithm providing a solution to the exhaustive parameter synthesis problem is proposed. The parametric approach allows for an in-depth system analysis and synthesis of correct parameter values. The time complexity of the problem and of the algorithm is provided. The prototype tool SPATULA, implementing the algorithm, is applied to the analysis of three benchmarks: faulty Train-Gate-Controller, Peterson's Mutual Exclusion Protocol, and a Generic Pipeline Processing network. The experimental results show efficiency and scalability of our approach in comparison with a naive solution to the problem.
- 1 June 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
Action Synthesis for Branching Time Logic: Theory and Applications
We introduce a parametric extension of Action-Restricted Computation Tree Logic. A symbolic fixed-point algorithm providing a solution to the exhaustive parameter synthesis problem is proposed. The parametric approach allows for an in-depth system analysis and synthesis of correct parameter values. The time complexity of the problem and of the algorithm is provided. The prototype tool SPATULA, implementing the algorithm, is applied to the analysis of three benchmarks: faulty Train-Gate-Controller, Peterson's Mutual Exclusion Protocol, and a Generic Pipeline Processing network. The experimental results show efficiency and scalability of our approach in comparison with a naive solution to the problem.
- 1 January 2014
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 135 (4) , 467-482
SMT-Based Reachability Checking for Bounded Time Petri Nets
Time Petri nets by Merlin and Farber are a powerful modelling formalism. However, symbolic model checking methods for them consider in most cases the nets which are 1-safe, i.e., allow the places to contain at most one token. In our paper we present an approach which applies symbolic verification to testing reachability for time Petri nets without this restriction. We deal with the class of bounded nets restricted to disallow multiple enabledness of transitions, and present the method of reachability testing based on a translation into a satisfiability modulo theory (SMT).
- 1 January 2014
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 135 (4) , 467-482
SMT-Based Reachability Checking for Bounded Time Petri Nets
Time Petri nets by Merlin and Farber are a powerful modelling formalism. However, symbolic model checking methods for them consider in most cases the nets which are 1-safe, i.e., allow the places to contain at most one token. In our paper we present an approach which applies symbolic verification to testing reachability for time Petri nets without this restriction. We deal with the class of bounded nets restricted to disallow multiple enabledness of transitions, and present the method of reachability testing based on a translation into a satisfiability modulo theory (SMT).
- 1 January 2013
- Published by Springer Nature
- p. 483-491
Two Approaches to Bounded Model Checking for a Soft Real-Time Epistemic Computation Tree Logic
- 1 January 2013
- Published by Springer Nature
- p. 483-491
Two Approaches to Bounded Model Checking for a Soft Real-Time Epistemic Computation Tree Logic