Title
Architecture for logic programing with arrangements of finite-state machines
Abstract
We incorporate logic programs (in particular Prolog) into reactive systems. We do this using Logic-labeled finitestate machines (LLFSMs), whose non-event-driven nature results in a deterministic schedule. We also advocate the use of a middleware under the Pull-approach, as opposed to the, currently very common, Push-approach, achieving deterministic semantics and the ability to ensure correctness in both the time and value domains. The deterministic schedule has other advantages, such as bounded resource use for inter-process communication as well as a smaller state space for formal verification. We demonstrate this architecture through a simple case study, contrasting the current prevalent Push approach in ROS [1] with the Pull approach recommended for LLFSMs.
Year
DOI
Venue
2016
10.1109/DCPS.2016.7588297
2016 1st CPSWeek Workshop on Declarative Cyber-Physical Systems (DCPS)
Keywords
DocType
ISBN
Software Models,Sequential Schedule,Logic-Programming,Reactive Systems,Logic-Labeled Finite-State Machines,Robotic Middleware.
Conference
978-1-5090-1151-3
Citations 
PageRank 
References 
1
0.35
15
Authors
3
Name
Order
Citations
PageRank
vladimir estivillcastro1903107.50
René Hexel221.03
Alberto Ramirez Regalado310.35