Transforming SystemC Transaction Level Models into UPPAAL timed automata

2011 ◽  
Author(s):  
Paula Herber ◽  
Marcel Pockrandt ◽  
Sabine Glesner
Keyword(s):  
Timed Automata ◽  
Transaction Level

What's Happening to Profits at Cazenovia Creations?

2013 ◽  
Vol 8 (1) ◽  
pp. 24-29 ◽  
Author(s):  
Margaret Garnsey ◽  
Andrea Hotaling
Keyword(s):  
Financial Analysis ◽  
Financial Statements ◽  
Internal Controls ◽  
Net Income ◽  
Database Query ◽  
Microsoft Access ◽  
Level Data ◽  
Query Tool ◽  
Transaction Level

ABSTRACT In this case, students assume the role of an accounting professional asked by a client to investigate why net income is not as strong as expected. The students must first analyze a set of financial statements to identify areas of possible concern. After determining the areas to investigate, the students use a database query tool to see if they can determine causes by examining transaction level data. Finally, the students are asked to professionally communicate their findings and recommendations to their client. The case provides students with experience in using query-based approaches to answering business questions. It is appropriate for students with basic query and financial analysis skills and knowledge of internal controls. A Microsoft Access database with transaction details for the final seven months of the current year as well as financial statements for the current and prior year are provided.

Modeling and Verifying Services of Internet of Things Based on Timed Automata

2011 ◽  
Vol 34 (8) ◽  
pp. 1365-1377 ◽  
Author(s):  
Li-Xing LI ◽  
Zhi JIN ◽  
Ge LI
Keyword(s):  
Internet Of Things ◽  
Timed Automata

scholarly journals Adaptive Cruise Control with Timed Automata

2020 ◽  
Vol 53 (2) ◽  
pp. 1918-1923
Author(s):  
Mustafa Yavuz Kara ◽  
Ebru Aydin Gol
Keyword(s):  
Adaptive Cruise Control ◽  
Timed Automata ◽  
Cruise Control

scholarly journals Configurable verification of timed automata with discrete variables

2020 ◽  
Author(s):  
Tamás Tóth ◽  
István Majzik
Keyword(s):  
Timed Automata ◽  
Empirical Evaluation ◽  
Real Time Systems ◽  
Discrete Variables ◽  
Reachability Problem ◽  
Abstraction Refinement ◽  
Dependent Behavior ◽  
Wide Range ◽  
Time Systems ◽  
Lazy Abstraction

AbstractAlgorithms and protocols with time dependent behavior are often specified formally using timed automata. For practical real-time systems, besides real-valued clock variables, these specifications typically contain discrete data variables with nontrivial data flow. In this paper, we propose a configurable lazy abstraction framework for the location reachability problem of timed automata that potentially contain discrete variables. Moreover, based on our previous work, we uniformly formalize in our framework several abstraction refinement strategies for both clock and discrete variables that can be freely combined, resulting in many distinct algorithm configurations. Besides the proposed refinement strategies, the configurability of the framework allows the integration of existing efficient lazy abstraction algorithms for clock variables based on $${\textit{LU}}$$ LU -bounds. We demonstrate the applicability of the framework and the proposed refinement strategies by an empirical evaluation on a wide range of timed automata models, including ones that contain discrete variables or diagonal constraints.

Sign in / Sign up

Export Citation Format

Share Document