Abstract / Description of output
This paper presents a method for the decomposition of HML formulae. It can be used to decide whether a process algebra term satisfies a HML formula, by checking whether subterms satisfy certain formulae, obtained by decomposing the original formula. The method uses the structural operational semantics of the process algebra. The main contribution of this paper is that an earlier decomposition method from LARSEN [14] for the De Simone format is extended to the more general ntyft/ntyxt format without lookahead.
Original language | English |
---|---|
Title of host publication | Fundamentals of Computation Theory: 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings |
Editors | A. Lingas, B.J. Nilsson |
Place of Publication | Berlin / Heidelberg |
Publisher | Springer |
Pages | 412-422 |
Number of pages | 11 |
ISBN (Electronic) | 978-3-540-45077-1 |
ISBN (Print) | 978-3-540-40543-6 |
DOIs | |
Publication status | Published - 29 Jul 2003 |
Event | 14th International Symposium on Fundamentals of Computation Theory, 2003 - Malmö, Sweden Duration: 12 Aug 2003 → 15 Aug 2003 Conference number: 14 |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer Berlin, Heidelberg |
Volume | 2751 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Symposium
Symposium | 14th International Symposium on Fundamentals of Computation Theory, 2003 |
---|---|
Abbreviated title | FCT 2003 |
Country/Territory | Sweden |
City | Malmö |
Period | 12/08/03 → 15/08/03 |