Property preserving abstractions for the verification of concurrent systems
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Modal and temporal properties of processes
Modal and temporal properties of processes
A Bounded Retransmission Protocol for Large Data Packets
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
Abstraction-Based Model Checking Using Modal Transition Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Verifying Liveness by Augmented Abstraction
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
On Observing Nondeterminism and Concurrency
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Structure-preserving binary relations for program abstraction
The essence of computation
Propositional dynamic logic of context-free programs
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
| Hi-index | 0.00 |
Modal Labelled Transition Systems (Modal-LTSs) can be used to specify system behaviour. They distinguish between required behaviour and allowed behaviour. This makes Modal-LTSs a suitable formalism to specify abstractions of a system by over- and under-approximations. This paper studies an extension to Modal-LTSs by allowing accelerated-transitions, i.e. transitions labelled with regular expressions. This permits to represent that a process can reach a state by executing some sequence of actions, abstracting away the intermediate states. We show how accelerated transitions improve the expressiveness of abstractions. Consequently, more liveness properties can be checked.