100
Voted
CORR
2007
Springer
15 years 12 days ago
2007
Springer
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...
98
Voted
IANDC
2006
15 years 12 days ago
2006
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
113
Voted
IANDC
2006
15 years 12 days ago
2006
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...
ENTCS
2006
15 years 13 days ago
2006
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...
67
Voted
ENTCS
2006
15 years 13 days ago
2006
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 ...
81
Voted
FAC
2008
15 years 14 days ago
2008
Abstract. Bisimulations are well
88
Voted
AUTOMATICA
2006
15 years 14 days ago
2006
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 ...
102
Voted
CORR
2010
Springer
15 years 15 days ago
2010
Springer
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...
ACTA
2007
15 years 17 days ago
2007
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...
86
Voted
FORTE
1990
15 years 1 months ago
1990
This paper describes a decision procedure for bisimulation-based equivalence relations between labeled transition systems. The algorithm usually performed in order to verify bisim...