From Dynamic Condition Response Structures to Büchi Automata
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Documents
- dcrs-buchi.pdf
Submitted manuscript, 220 KB, PDF document
Recently we have presented distributed dynamic condition response structures (DCR structures) as a declarative process model conservatively generalizing labelled event structures to allow for finite specifications of repeated, possibly infinite behavior. The key ideas are to split the causality relation of event structures in two dual relations: the condition relation and the response relation, to split the conflict relation in two relations: the dynamic exclusion and dynamic inclusion, and finally to allow configurations to be multi sets of events. In the present abstract we recall the model and show how to characterise the execution of DCR structures and the acceptance condition for infinite runs by giving a map to Bu ̈chi-automata. This is the first step towards automatic verification of processes specified as DCR structures.
Original language | English |
---|---|
Title of host publication | From Dynamic Condition Response Structures to Büchi Automata |
Number of pages | 4 |
Volume | 0 |
Publisher | IEEE Computer Society Press |
Publication date | 2010 |
Pages | 187-190 |
ISBN (Print) | 978-0-7695-4148-8 |
DOIs | |
Publication status | Published - 2010 |
Externally published | Yes |
Bibliographical note
@article{10.1109/TASE.2010.22, author = {Raghava Rao Mukkamala and Thomas T. Hildebrandt}, title = {From Dynamic Condition Response Structures to Buchi Automata}, journal ={Theoretical Aspects of Software Engineering, Joint IEEE/IFIP Symposium on}, volume = {0}, isbn = {978-0-7695-4148-8}, year = {2010}, pages = {187-190}, doi = {http://doi.ieeecomputersociety.org/10.1109/TASE.2010.22}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }
Number of downloads are based on statistics from Google Scholar and www.ku.dk
No data available
ID: 227990277