121
Voted
IFM
2010
Springer
14 years 11 months ago
2010
Springer
We present a logical framework that is able to deal with variability in product family descriptions. The temporal logic MHML is based on the classical Hennessy–Milner logic with ...
117
Voted
JSA
2008
14 years 12 months ago
2008
We present a framework for the formal verification of abstract state machine (ASM) designs using the multiway decision graphs (MDG) tool. ASM is a state based language for describ...
98
Voted
ENTCS
2002
15 years 6 days ago
2002
We introduce G-relative-pushouts (GRPO) which are a 2-categorical generalisation of relative-pushouts (RPO). They are suitable for deriving labelled transition systems (LTS) for p...
95
Voted
LOGCOM
2007
15 years 8 days ago
2007
We consider the problem of incorporating arbitrary preferences in planning systems. A preference may be seen as a goal or constraint that is desirable, but not necessary, to satis...
117
click to vote
ENTCS
2007
15 years 11 days ago
2007
Action Labelled transition systems (LTS) have proved to be a fundamental model for describing and proving properties of concurrent systems. In this paper,Multiple Labelled Transit...
98
Voted
ENTCS
2007
15 years 11 days ago
2007
The aim of the paper is to revisit the model of Biological Regulatory Networks (BRN) which was proposed by René Thomas to model the interactions between a set of genes. We give a...
87
Voted
ENTCS
2007
15 years 11 days ago
2007
Generation of labelled transition systems from system specifications is highly dependent on efficient rewriting (or related techniques). We give an account of the implementation ...
85
Voted
LOGCOM
2008
15 years 11 days ago
2008
In an earlier work [Abdulla et al. (2000, Information and Computation, 160, 109
JALC
2006
15 years 11 days ago
2006
In this paper we present an extension of Dolev-Yao models for security protocols with a notion of random polynomial-time (Las Vegas) computability. First we notice that Dolev-Yao ...
85
Voted
JLP
2008
15 years 11 days ago
2008
models, used for specification, analysis and verification, usually describe sets of implementations by means of a refinement relation. In the branching time setting, implementatio...