György Vaszil

György Vaszil

Auto-generated profile, based on publicly available information

György Vaszil

Department of Computer Science, Faculty of Informatics, University of Debrecen, Debrecen, Hungary

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2000 in International Journal of Foundations of Computer Science
Verified
Journal Article
Closed access
ECErzsébet Csuhaj-Varjú
Erzsébet Csuhaj-Varjú
CMCarlos Martín-Vide
Carlos Martín-Vide
Victor MitranaVictor Mitrana
Victor Mitrana
GVGyörgy Vaszil
György Vaszil

1 May 2006 in Natural Computing
Verified
Journal Article
Closed access
PDF file
ECErzsébet Csuhaj-Varjú
Erzsébet Csuhaj-Varjú
OIOscar H. Ibarra
Oscar H. Ibarra
GVGyörgy Vaszil
György Vaszil

8 September 2020 in Journal of Membrane Computing
Verified
Journal Article
Open access
PDF file
ABAttila Bagossy
Attila Bagossy
GVGyörgy Vaszil
György Vaszil
Reaction systems are a formal model of computation providing a framework for investigating biochemical reactions inside living cells. We look at the functioning of these systems as a process producing a series of different possible sets of entities representing states which can be changed by the application of reactions, and we study reversibility and its simulation in this framework. Our goal is to establish an Undo-Redo-Do-like semantics of reversibility with environmental control over the direction of the computation following a so-called no-memory approach, that is, without introducing modifications to the model of reaction systems itself. We first establish requirements the systems must satisfy in order to produce processes consisting of states with unique predecessors, then define reversible reaction systems in terms of reversible interactive processes. For such reversible systems, we also construct simulator systems that can traverse between the states of reversible interactive processes back and forth based on the input of a special “rollback” symbol from the environment.

27 October 2020 in Journal of Membrane Computing
Verified
Journal Article
Open access
PDF file
PBPéter Battyányi
Péter Battyányi
GVGyörgy Vaszil
György Vaszil
We continue the investigations of the connection between membrane systems and time Petri nets by extending the examined class of systems from simple symbol-object membrane systems to more complex cases: rules with promoters/inhibitors, membrane dissolution, and priority relation on the rules. By constructing the simulating time Petri net, we retain one of the main characteristics of the Petri net model; namely, the firings of the transitions can take place in any order, and there is no need to introduce maximal parallelism in the Petri net semantics. Instead, we substantially exploit the gain in computational strength obtained by the introduction of the timing feature for Petri nets.

25 February 2024 in Natural Computing
Verified
Journal Article
Open access
PDF file
ECErzsébet Csuhaj-Varjú
Erzsébet Csuhaj-Varjú
GVGyörgy Vaszil
György Vaszil
A distributed reaction system consists of a finite set of reaction systems that either interact with a common environment or interact with each other by communicating products or reactions. A reaction system is a well-known qualitative formal model of interactions between biochemical reactions. A reaction is a triplet of nonempty sets representing chemicals, called the set of reactants, the set of inhibitors, and the set of products. A reaction corresponds to a chemical reaction performed on a set of chemicals, and a reaction system is a finite nonempty set of reactions. In this paper, we examine two variants of distributed reaction systems. We introduce the notion of a distributed reaction system with communication by request (a qDRS for short), where sets of products are communicated between the component reaction systems by queries. First, we show that every qDRS can be represented by a reaction system. After that we compare distributed reaction systems with communication by request to extended distributed reaction systems (EDRSs), models that were introduced in a previous paper. We prove that extended distributed reaction systems, where a context automaton provides input for the component reaction systems, simulate distributed reaction systems with communication by request and distributed reaction systems with communication by request simulate special variants of extended distributed reaction systems. Furthermore, we assign languages to these two variants of distributed reaction systems. We prove that the class of agreement languages of extended distributed reaction systems is equal to the class of languages of nondeterministic multihead finite automata and the agreement language of every distributed reaction system with communication by request is an element of a certain subregular language class.

2 June 2022 in Theoretical Computer Science
Verified
Journal Article
Open access
ABAttila Bagossy
Attila Bagossy
GVGyörgy Vaszil
György Vaszil