33 search results - page 5 / 7 » Behaviour model elaboration using partial labelled transitio... |
IANDC
2006
13 years 6 months ago
2006
Abstract Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigra...
FIDJI
2003
Springer
13 years 11 months ago
2003
Springer
— We present techniques for analyzing the source code of distributed Java applications, and building finite models of their behaviour. The models are labelled transition systems...
ASIAN
1998
Springer
13 years 10 months ago
1998
Springer
In recent years, several semantics for place/transition Petri nets have been proposed that adopt the collective token philosophy. We investigate distinctions and similarities betwe...
CAV
2001
Springer
13 years 10 months ago
2001
Springer
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
MPC
2010
Springer
13 years 10 months ago
2010
Springer
d Abstract) Jane Hillston Laboratory for Foundations of Computer Science, The University of Edinburgh, Scotland Quantitative Analysis Stochastic process algebras extend classical p...