Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic...
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
We give a coalgebraic formulation of timed processes and their operational semantics. We model time by a monoid called a "time domain", and we model processes by "t...
This paper gives an overview of recent results concerning the modular derivation of (i) modal specification logics, (ii) notions of simulation together with logical characterisati...
We define and use a SOS-based framework to specify the transition systems of calculi with name-passing properties. This setting uses proof-theoretic tools to take care of some of ...
We address the problem of estimating discrete variables in a class of deterministic transition systems in which the continuous variables are available for measurement. We propose ...
Domitilla Del Vecchio, Richard M. Murray, Eric Kla...
We prove several decidability and undecidability results for -PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of...
Abstract This paper introduces the notion of well-structured language. A wellstructured language can be defined by a labelled well-structured transition system, equipped with an u...
This paper describes a decision procedure for bisimulation-based equivalence relations between labeled transition systems. The algorithm usually performed in order to verify bisim...