Sciweavers

570 search results - page 3 / 114
» Robustness and Implementability of Timed Automata
Sort
View
AGENTCL
2000
Springer
14 years 3 months ago
Constructing Robust Conversation Policies in Dynamic Agent Communities
Conversation policies codify the allowable exchanges of speech acts among agents as they execute specific types of tasks. Both the set of agents in a community, and the nature of...
Marian H. Nodine, Amy Unruh
ATVA
2005
Springer
131views Hardware» more  ATVA 2005»
14 years 4 months ago
An MTBDD-Based Implementation of Forward Reachability for Probabilistic Timed Automata
Multi-Terminal Binary Decision Diagrams (MTBDDs) have been successfully applied in symbolic model checking of probabilistic systems. In this paper we propose an encoding method for...
Fuzhi Wang, Marta Z. Kwiatkowska
ARTS
1997
Springer
14 years 2 months ago
PLC-Automata: A New Class of Implementable Real-Time Automata
We introduce PLC-Automata as a new class of automata which are tailored to deal with real-time properties of Programmable Logic Controllers (PLCs). These devices are often used in...
Henning Dierks
EMSOFT
2006
Springer
14 years 2 months ago
A timing model for synchronous language implementations in simulink
We describe a simple scheme for mapping synchronous language models, in the form of Boolean Mealy Machines, into timed automata. The mapping captures certain idealized implementat...
Timothy Bourke, Arcot Sowmya
FSEN
2007
Springer
14 years 4 months ago
Zone-Based Universality Analysis for Single-Clock Timed Automata
Abstract. During the last years, timed automata have become a popular model for describing the behaviour of real-time systems. In particular, there has been much research on proble...
Parosh Aziz Abdulla, Joël Ouaknine, Karin Qua...