We present small polynomial time universal Turing machines with state-symbol pairs of (5, 5), (6, 4), (9, 3) and (18, 2). These machines simulate our new variant of tag system, the...
Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tri...
We review some results about the computational power of several computational models. Considered models have in common to be related to continuous dynamical systems. 1 Dynamical Sy...
Abstract. We consider a new variant of the halting condition in P systems, i.e., a computation in a P system is already called halting if not for all membranes a rule is applicable...
Artiom Alhazov, Rudolf Freund, Marion Oswald, Serg...
Verification of a modular system composed of communicating components is a difficult problem, especially when the models of the components are not available. Conventional testing t...
Roland Groz, Keqin Li 0002, Alexandre Petrenko, Mu...
The state space explosion due to concurrency and timing constraints of concurrent real-time systems (CRTS) presents significant challenges to the verification engineers. In this pa...
Firewalls are a cornerstone of todays security infrastructure for networks. Their configuration, implementing a firewall policy, is inherently complex, hard to understand, and diff...
Abstract. A Web Service is commonly not an independent software entity, but plays a role in some business process. Hence, it depends on the services provided by external Web Servic...
Antonia Bertolino, Guglielmo De Angelis, Lars Fran...