Verification for Timed Automata extended with Unbounded Discrete Data Structures

Quaas, Karin

doi:10.2168/lmcs-11(3:20)2015

Cited by 2 publications

(1 citation statement)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They can be seen as an extension of parametric timed automata [2] (that extend timed automata [1] with parameters in place of integer constants) with unbounded data variables and parametric variables. PTDAs can also be seen as an extension of some extensions of timed automata with data (see e.g., [16,19,29]), that we again extend with both data parameters and timing parameters. Or as an extension of quantified event automata [12] with explicit time representation using clocks, and further augmented with timing parameters.…”

Section: Parametric Timed Data Automatamentioning

confidence: 92%

Symbolic Monitoring Against Specifications Parametric in Time and Data

Waga¹,

André²,

Hasuo³

2019

Computer Aided Verification

View full text Add to dashboard Cite

0000−0001−9360−7490] ,Étienne André 4,5,1[0000−0001−8473−9555] , and Ichiro Hasuo 1,2[0000−0002−8300−4650]Abstract. Monitoring consists in deciding whether a log meets a given specification. In this work, we propose an automata-based formalism to monitor logs in the form of actions associated with time stamps and arbitrarily data values over infinite domains. Our formalism uses both timing parameters and data parameters, and is able to output answers symbolic in these parameters and in the log segments where the property is satisfied or violated.We implemented our approach in an ad-hoc prototype SyMon, and experiments show that its high expressive power still allows for efficient online monitoring.

show abstract