Decidability and complexity of Petri net problems — An introduction Page 1
Decidability and Complexity of Petri Net Problems An Introduction* Javier Esparza Institut fiir …

Sequential Dynamical Systems (SDSs) are a special type of finite discrete dynamical
systems that can be used to model simulation systems. We focus on the computational …

We describe an interaction based approach for computer modeling and simulation of large
integrated biological, information, social and technical (BIST) systems. Examples of such …

We study the predecessor existence problem for finite discrete dynamical systems. Given a
finite discrete dynamical system S and a configuration C, the Predecessor existence (or Pre) …

A model for reactive computation, for example that of labelled transition systems [Kel76], or a
process algebra (such as ACP [BW90], CCS [Mil89], CSP [Hoa85]) can be used to describe …

A sequential dynamical system (SDS) over a domain D is a triple (G, F, π), where (i) G (V, E)
is an undirected graph with n nodes with each node having a state value from D,(ii) F={f 1, f …

This paper studies the structural complexity of model checking for several timed modal
logics presented in the literature. More precisely, we consider (variations on) the …

In implementation verification, we check that an implementation is correct with respect to a
specification by checking whether the behaviors of a transition system that models the …

We present a unified game-based approach for branching-time model checking of
hierarchical systems. Such systems are exponentially more succinct than standard state …

In model checking, the state-explosion problem occurs when one checks a nonflat system,
ie, a system implicitly described as a synchronized product of elementary subsystems. In this …