Sciweavers

CORR
2007
Springer
147views Education» more  CORR 2007»
13 years 11 months ago
Model Checking Synchronized Products of Infinite Transition Systems
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...
Stefan Wöhrle, Wolfgang Thomas
IANDC
2006
121views more  IANDC 2006»
13 years 11 months ago
Comparing operational models of name-passing process calculi
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
Marcelo P. Fiore, Sam Staton
IANDC
2006
126views more  IANDC 2006»
13 years 11 months ago
Coalgebraic semantics for timed processes
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...
Marco Kick, John Power, Alex Simpson
ENTCS
2006
130views more  ENTCS 2006»
13 years 11 months ago
Modularity in Coalgebra
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...
Corina Cîrstea
ENTCS
2006
126views more  ENTCS 2006»
13 years 11 months ago
A Congruence Format for Name-passing Calculi
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 ...
Axelle Ziegler, Dale Miller, Catuscia Palamidessi
FAC
2008
100views more  FAC 2008»
13 years 11 months ago
Bisimulations in calculi modelling membranes
Abstract. Bisimulations are well
Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo ...
AUTOMATICA
2006
81views more  AUTOMATICA 2006»
13 years 11 months ago
Discrete state estimators for systems on a lattice
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...
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 11 months ago
Decision Problems for Petri Nets with Names
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...
Fernando Rosa Velardo, David de Frutos-Escrig
ACTA
2007
90views more  ACTA 2007»
13 years 11 months ago
Well-structured languages
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...
Gilles Geeraerts, Jean-François Raskin, Lau...
FORTE
1990
14 years 18 days ago
Verifying Bisimulations "On the Fly"
This paper describes a decision procedure for bisimulation-based equivalence relations between labeled transition systems. The algorithm usually performed in order to verify bisim...
Jean-Claude Fernandez, Laurent Mounier