Please use this identifier to cite or link to this item:
|Title:||Complete and tractable local linear time temporal logics over traces|
|Citation:||AUTOMATA, LANGUAGES AND PROGRAMMING,2380,926-937|
|Abstract:||We present the first expressively complete and yet tractable temporal logics, PAST-TrLTL and TrLTL, to reason about distributed behaviours, modelled as Mazurkiewicz traces. Both logics admit singly exponential automata-theoretic decision procedures. General formulas of PAST-TrLTL are boolean combinations of local formulas which assert rich properties of local histories of the behaviours. PAST-TrLTL has the same expressive power as the first order theory of finite traces. TrLTL provides formulas to reason about recurring local PAST-TrLTL properties and equals the complete first order theory in expressivity. The expressive completeness criteria are based on new local normal forms for the first order logic. We illustrate the use of our logics for specification of global properties.|
|Appears in Collections:||Proceedings papers|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.