AbstractMany formal models for infinite state concurrent systems can be expressed by special classes of rewrite systems. We classify these models by their expressiveness and define a hierarchy of rewrite systems. We show that this hierarchy is strict with respect to bisimulation equivalence.The most general and most expressive class of systems in this hierarchy is called “Process Rewrite Systems” (PRS). They subsume Petri nets, PA-Processes and pushdown processes and are strictly more expressive than any of these. PRS are not Turing-powerful, because the reachability problem is still decidable. It is even decidable if there is a reachable state that satisfies certain properties that can be encoded in a simple logic.PRS are more expressive t...
AbstractThis paper is an approach to combine the reachability problem with semantic notions like bis...
The problem to represent very complex systems has been studied by several authors, obtaining ...
AbstractRealizability interpretations of logics are given by saying what it means for computational ...
AbstractWe present an algorithm for checking whether an infinite transition system, defined by a gra...
AbstractNonsequential automata constitute a categorial semantic domain based on labeled transition s...
The standard way of lifting a binary relation, R, from closed terms of an algebra to open terms is t...
AbstractNotational definitions are pervasive in mathematical practic and are therefore supported in ...
AbstractWe show strict lower bounds for the complexity of several model checking problems for BPA (B...
AbstractIn this paper, we supplement the set of basic and back-forth behavioural equivalences for Pe...
AbstractIn this tutorial paper, we consider various classes of automata generated by simple rewrite ...
AbstractIn addition to ordinary places, called stable, zero-safe nets are equipped with zero places,...
AbstractAlgebraic graph transformations visually support intuition, have a strong theoretical basis,...
AbstractThis tutorial aims at giving an account on the realizability models for several constructive...
AbstractIn this paper we formalise CSP solving as an inference process. Based on the notion of Compu...
Several proof-assistants rely on the very formal basis of Pure Type Systems. However, some practical...
AbstractThis paper is an approach to combine the reachability problem with semantic notions like bis...
The problem to represent very complex systems has been studied by several authors, obtaining ...
AbstractRealizability interpretations of logics are given by saying what it means for computational ...
AbstractWe present an algorithm for checking whether an infinite transition system, defined by a gra...
AbstractNonsequential automata constitute a categorial semantic domain based on labeled transition s...
The standard way of lifting a binary relation, R, from closed terms of an algebra to open terms is t...
AbstractNotational definitions are pervasive in mathematical practic and are therefore supported in ...
AbstractWe show strict lower bounds for the complexity of several model checking problems for BPA (B...
AbstractIn this paper, we supplement the set of basic and back-forth behavioural equivalences for Pe...
AbstractIn this tutorial paper, we consider various classes of automata generated by simple rewrite ...
AbstractIn addition to ordinary places, called stable, zero-safe nets are equipped with zero places,...
AbstractAlgebraic graph transformations visually support intuition, have a strong theoretical basis,...
AbstractThis tutorial aims at giving an account on the realizability models for several constructive...
AbstractIn this paper we formalise CSP solving as an inference process. Based on the notion of Compu...
Several proof-assistants rely on the very formal basis of Pure Type Systems. However, some practical...
AbstractThis paper is an approach to combine the reachability problem with semantic notions like bis...
The problem to represent very complex systems has been studied by several authors, obtaining ...
AbstractRealizability interpretations of logics are given by saying what it means for computational ...