The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Bounded Model Checking Using Satisfiability Solving
Formal Methods in System Design
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Benchmarking the Task Graph Scheduling Algorithms
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
EESR '05 Proceedings of the 2005 workshop on End-to-end, sense-and-respond systems, applications and services
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
JFLAP: An Interactive Formal Languages and Automata Package
JFLAP: An Interactive Formal Languages and Automata Package
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Regular Specifications of Resource Requirements for Embedded Control Software
RTAS '08 Proceedings of the 2008 IEEE Real-Time and Embedded Technology and Applications Symposium
WirelessHART: Applying Wireless Technology in Real-Time Industrial Process Control
RTAS '08 Proceedings of the 2008 IEEE Real-Time and Embedded Technology and Applications Symposium
Modeling and Analysis of Multi-hop Control Networks
RTAS '09 Proceedings of the 2009 15th IEEE Symposium on Real-Time and Embedded Technology and Applications
Optimal Scheduling Strategies in a Multiprocessor System
IEEE Transactions on Computers
Multihop multi-channel scheduling for wireless control in wirelessHART networks
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Closing the loop: a simple distributed method for control over wireless networks
Proceedings of the 11th international conference on Information Processing in Sensor Networks
| Hi-index | 0.00 |
In this paper, we address the problem of designing scalable scheduling and routing policies over a time-triggered multi-hop control network, when closing a considerable number of control loops on the same network. The key idea is to formally define by means of regular languages the set of schedules for each control loop that satisfy a given control specification, and to exploit operators on regular languages to compute the set of schedules for the whole system. In order to test our methodology, we address a mineral floatation control problem derived from the Boliden (a swedish mining company) mine in Garpenberg, and propose a scheduling solution that can be implemented on systems compliant with communication protocols for wireless networks (e.g. the WirelessHART specification).