相关论文: A semi-quantitative equivalence for abstracting fr…
Answer Set Programming (ASP) is a well-established formalism for logic programming. Problem solving in ASP requires to write an ASP program whose answers sets correspond to solutions. Albeit the non-existence of answer sets for some ASP…
While distributed systems with transfer of processes have become pervasive, methods for reasoning about their behaviour are underdeveloped. In this paper we propose a bisimulation technique for proving behavioural equivalence of such…
Quasistationary states are long-lived nonequilibrium states, observed in some systems with long-range interactions under deterministic Hamiltonian evolution. These intriguing non-Boltzmann states relax to equilibrium over times which…
This paper is concerned with classes of models of stochastic reaction dynamics with time-scales separation. We demonstrate that the existence of the time-scale separation naturally leads to the application of the averaging principle and…
The linear noise approximation models the random fluctuations from the mean-field model of a chemical reaction that unfolds near the thermodynamic limit. Specifically, the fluctuations obey a linear Langevin equation up to order…
A version of the time-parallel algorithm parareal is analyzed and applied to stochastic models in chemical kinetics. A fast predictor at the macroscopic scale (evaluated in serial) is available in the form of the usual reaction rate…
A process algebra is proposed, whose semantics maps a term to a nondeterministic finite automaton (NFA, for short). We prove a representability theorem: for each NFA $N$, there exists a process algebraic term $p$ such that its semantics is…
In the development of operational semantics of concurrent systems, a key decision concerns the adoption of a suitable notion of execution model, which basically amounts to choosing a class of partial orders according to which events are…
The transient response of a stationary state of a quantum particle in a step potential to an instantaneous change in the step height (a simplified model for a sudden bias switch in an electronic semiconductor device) is solved exactly by…
Bisimulation is a concept that captures behavioural equivalence. It has been studied extensively on nonprobabilistic systems and on discrete-time Markov processes and on so-called continuous-time Markov chains. In the latter time is…
Semi-Markov processes are Markovian processes in which the firing time of the transitions is modelled by probabilistic distributions over positive reals interpreted as the probability of firing a transition at a certain moment in time. In…
In two preceding papers we have shown that, when reaction networks are well-removed from equilibrium, explicit asymptotic and quasi-steady-state approximations can give algebraically-stabilized integration schemes that rival standard…
Reaction networks are widely used models to describe biochemical processes. Stochastic fluctuations in the counts of biological macromolecules have amplified consequences due to their small population sizes. This makes it necessary to favor…
The process algebra HYPE was recently proposed as a fine-grained modelling approach for capturing the behaviour of hybrid systems. In the original proposal, each flow or influence affecting a variable is modelled separately and the overall…
A semi-process is an analog of the semi-flow for non-autonomous differential equations or inclusions. We prove an abstract result on the existence of measurable semi-processes in the situations where there is no uniqueness. Also, we allow…
Partial equilibrium approximation (PEA) and quasi-steady-state approximation (QSSA) are two classical methods for reducing complex macroscopic chemical reactions into simple computable ones. Previous studies mainly focus on the accuracy of…
The notion of semi-BCI algebras is introduced and some of its properties are investigated. This algebra is another generalization for BCI-algebras. It arises from the "intervalization" of BCI algebras. Semi-BCI have a similar structure to…
In this paper we describe the mathematical foundations of a new approach to semi-supervised Machine Learning. Using techniques of Symbolic Computation and Computer Algebra, we apply the concept of persistent homology to obtain a new…
Burkart, Caucal, Steffen (1995) showed a procedure deciding bisimulation equivalence of processes in Basic Process Algebra (BPA), i.e. of sequential processes generated by context-free grammars. They improved the previous decidability…
Coalgebraic bisimilarity minimization generalizes classical automaton minimization to a large class of automata whose transition structure is specified by a functor, subsuming strong, weighted, and probabilistic bisimilarity. This offers…