Abstract. We investigate layered composition for real-time systems modelled as (networks of) timed automata (TA). We first formulate the principles of layering and transition indep...
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
Cellular automata are discrete dynamical systems that are widely used to model natural systems. Classically they are run with perfect synchrony ; i.e., the local rule is applied to...
In this paper we show a novel method for modelling behaviours of security protocols using networks of communicating automata in order to verify them with SAT-based bounded model ch...
We provide a formalisation of the theory of pushdown automata (PDAs) using the HOL4 theorem prover. It illustrates how provers such as HOL can be used for mechanising complicated p...