History-Register Automata

Tzevelekos, Nikos; Grigore, Radu

doi:10.1007/978-3-642-37075-5_2

Cited by 10 publications

(15 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…comment: There exist many variants of the A1RA model, and hardness also holds for the corresponding data logics [e.g. 48,25,32,88,31,89]. See A1TA for the case of linearly ordered data, and LTL ↓ [k] for data logics using multiple attributes with a hierarchical policy.…”

Section: 1mentioning

confidence: 99%

Complexity Hierarchies beyond Elementary

Schmitz

2016

ACM Trans. Comput. Theory

128

View full text Add to dashboard Cite

Abstract. We introduce a hierarchy of fast-growing complexity classes and show its suitability for completeness statements of many non elementary problems. This hierarchy allows the classification of many decision problems with a non-elementary complexity, which occur naturally in logic, combinatorics, formal languages, verification, etc., with complexities ranging from simple towers of exponentials to Ackermannian and beyond.

show abstract

Section: 1mentioning

confidence: 99%

Complexity Hierarchies beyond Elementary

Schmitz

2016

ACM Trans. Comput. Theory

128

View full text Add to dashboard Cite

show abstract

“…In [19] the authors already show that nrHRA can be simulated by CMA. Their construction does not make use of the local-acceptance condition, so the fact that nrHRA can be simulated by WCMA is immediate.…”

Section: Weak Class Memory Automatamentioning

confidence: 99%

“…In Section 3 we identify a natural restriction of Class Memory Automata, which we call weak Class Memory Automata, in which the localacceptance condition of CMA is dropped. We show that these weak CMA are equivalent to: (i) Class Counting Automata, which were introduced in [11]; (ii) non-reset History Register Automata, introduced in [19]; and (iii) locally prefix-closed Data Automata, introduced in [4].…”

Section: Introductionmentioning

confidence: 98%

See 1 more Smart Citation

Weak and Nested Class Memory Automata

Cotton-Barratt

Murawski

Ong

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Automata over infinite alphabets have recently come to be studied extensively as potentially useful tools for solving problems in verification and database theory. One popular model of automata studied is the Class Memory Automata (CMA), for which the emptiness problem is equivalent to Petri Net Reachability. We identify a restriction -which we call weakness -of CMA, and show that they are equivalent to three existing forms of automata over data languages. Further, we show that in the deterministic case they are closed under all Boolean operations, and hence have an ExpSpace-complete equivalence problem. We also extend CMA to operate over multiple levels of nested data values, and show that while these have undecidable emptiness in general, adding the weakness constraint recovers decidability of emptiness, via reduction to coverability in well-structured transition systems. We also examine connections with existing automata over nested data.

show abstract

“…The use of predicates to observe the history of data share similarities with approaches based on history expressions introduced in [6]. Register Automata and History-Register Automata have also been used to model programs with dynamic allocation in [18,19]. Verification of models with external memory has been considered e.g.…”

Section: Related Workmentioning

confidence: 99%

Well Structured Transition Systems with History

Abdulla

Delzanno

Montali

2015

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

We propose a formal model of concurrent systems in which the history of a computation is explicitly represented as a collection of events that provide a view of a sequence of configurations. In our model events generated by transitions become part of the system configurations leading to operational semantics with historical data. This model allows us to formalize what is usually done in symbolic verification algorithms. Indeed, search algorithms often use meta-information, e.g., names of fired transitions, selected processes, etc., to reconstruct (error) traces from symbolic state exploration. The other interesting point of the proposed model is related to a possible new application of the theory of well-structured transition systems (wsts). In our setting wsts theory can be applied to formally extend the class of properties that can be verified using coverability to take into consideration (ordered and unordered) historical data. This can be done by using different types of representation of collections of events and by combining them with wsts by using closure properties of well-quasi orderings.

show abstract

History-Register Automata

Cited by 10 publications

References 34 publications

Complexity Hierarchies beyond Elementary

Complexity Hierarchies beyond Elementary

Weak and Nested Class Memory Automata

Well Structured Transition Systems with History

Contact Info

Product

Resources

About