Filters








2,658 Hits in 3.6 sec

Robust Analysis of Timed Automata Via Channel Machines [chapter]

Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier
Foundations of Software Science and Computational Structures  
Recently, a new approach has been proposed, which reduces (standard) model-checking of timed automata to other verification problems on channel machines.  ...  Several works have thus focused on a modified semantics of timed automata which ensures implementability, and robust model-checking algorithms for safety, and later LTL properties have been designed.  ...  of this family of timed systems using channel machines.  ... 
doi:10.1007/978-3-540-78499-9_12 dblp:conf/fossacs/BouyerMR08 fatcat:qal6kstxirhwxljfglhgknlyum

Robust Model-Checking of Timed Automata via Pumping in Channel Machines [chapter]

Patricia Bouyer, Nicolas Markey, Ocan Sankur
2011 Lecture Notes in Computer Science  
In this work, we show that robust model-checking against -regular properties for timed automata can be reduced to standard model-checking of timed automata, by computing an adequate bound on the imprecision  ...  This yields a new algorithm for robust model-checking of -regular properties, which is both optimal and valid for general timed automata.  ...  Robust model-checking of general timed automata against -regular properties is PSPACE-complete. The proof of Theorem 3 uses the encoding by channel machines proposed in [5] .  ... 
doi:10.1007/978-3-642-24310-3_8 fatcat:5lin7rai4fhbngs2i5jzgigygq

Robustness Analysis of Networked Systems [chapter]

Roopsha Samanta, Jyotirmoy V. Deshmukh, Swarat Chaudhuri
2013 Lecture Notes in Computer Science  
Our solution draws upon techniques from automata theory, essentially reducing the problem of checking (δ, )-robustness to the problem of checking emptiness for a certain class of reversal-bounded counter  ...  automata.  ...  The authors present polynomial-time algorithms for the analysis and synthesis of robust transducers.  ... 
doi:10.1007/978-3-642-35873-9_15 fatcat:wolghzfekbcuvnwqdfkm77dvzi

Wireless control networks

George J. Pappas
2011 Proceedings of the 14th international conference on Hybrid systems: computation and control - HSCC '11  
Sensors ( ) and Actuators ( ) are installed on a plant • Communicate with controller ( ) over a wired network • Control is typically PID loops running on PLC • Communication protocols are increasingly time-triggered  ...  control systems. • Runtime adaptation -Control stability and performance are maintained in the presence of node, link and topological changes.  ...  via a coordination protocol • Future work -Medium Access Control for multiple closed-loops over a shared wireless channel Analysis of multi-hop control networks • Periodic deterministic schedule  ... 
doi:10.1145/1967701.1967703 dblp:conf/hybrid/Pappas11 fatcat:etry5czdhfbwzfz2olu6gsn6wi

Homeostatic Architectures for Robust Spatial Computing

David H. Ackley, Lance R. Williams
2011 2011 Fifth IEEE Conference on Self-Adaptive and Self-Organizing Systems Workshops  
This paper is an introduction for the spatial computing community to the Movable Feast Machine (MFM), a computing model in the spirit of an object-oriented asynchronous cellular automata, with which we  ...  Instead of minimizing reliability as just a hardware problem, robustness should climb the computational stack toward the end users.  ...  Updated physics propagate across the machine-hopefully rarely-via those additional intertile communications channels. III.  ... 
doi:10.1109/sasow.2011.18 dblp:conf/saso/AckleyW11 fatcat:lxbwad6w2bc4zboiqpt7npbmmu

Emergence and dynamics of self-producing information niches as a step towards pre-evolutionary organization

Richard J. Carter, Karoline Wiesner, Stephen Mann
2018 Journal of the Royal Society Interface  
of simple information processing entities (automata).  ...  or via environmental perturbations that serve as an exogenous source of population diversification.  ...  The authors would like to thank Professor Jim Crutchfield of the University of California at Davis for discussions and insights about the finitary process soup model and 1-machines.  ... 
doi:10.1098/rsif.2017.0807 pmid:29343630 pmcid:PMC5805983 fatcat:5fe2mdnbw5ambke34ph6pk2lyq

2020 Index IEEE Transactions on Artificial Intelligence Vol. 1

2020 IEEE Transactions on Artificial Intelligence  
., +, TAI Oct. 2020 151-166 Robust control Fast Real-Time Reinforcement Learning for Partially-Observable Large-Scale Systems.  ...  Zhang, C., +, TAI Dec. 2020 219-232 Time series Approaches and Applications of Early Classification of Time Series: A Review.  ... 
doi:10.1109/tai.2021.3089904 fatcat:53o6433ljne3lblvr5fuy66lou

Verifying distributed real-time properties of embedded systems via graph transformations and model checking

Gabor Madl, Sherif Abdelwahed, Douglas C. Schmidt
2006 Real-time systems  
Our results show that model-based techniques enable design-time analysis of timed properties and can be applied to effectively predict, simulate, and verify the event-driven behavior of component-based  ...  Model-based technologies help address these issues by enabling design-time analysis, and providing the means to automate the development, deployment, configuration, and integration of component-based DRE  ...  [14] , and schedules and dispatches events via a federation of real-time event channels (any event channel mentioned in the rest of the paper refers to the real-time event channel).  ... 
doi:10.1007/s11241-006-6883-y fatcat:vcr7e7eqebcthpyauzloanfwry

2020 Index IEEE Transactions on Computers Vol. 69

2020 IEEE transactions on computers  
Xu, D., +, TC Aug. 2020 1172-1184 SCAUL: Power Side-Channel Analysis With Unsupervised Learning.  ...  ., +, TC Oct. 2020 1533-1543 SCAUL: Power Side-Channel Analysis With Unsupervised Learning. Arithmetic Approaches for Rigorous Design of Reliable Fixed-Point LTI Filters.  ... 
doi:10.1109/tc.2020.3042405 fatcat:htwgwc6gtbcfdkcpj6dcfbuwhq

Verification of Behaviour Networks Using Finite-State Automata [chapter]

Christopher Armbrust, Lisa Kiekbusch, Thorsten Ropertz, Karsten Berns
2012 Lecture Notes in Computer Science  
and analysis tasks.  ...  This paper addresses the problem of verifying properties of behaviour-based systems used for controlling robots.  ...  Roland Meyer from the Concurrency Theory Group 8 of the University of Kaiserslautern for his helpful comments and suggestions.  ... 
doi:10.1007/978-3-642-33347-7_1 fatcat:qkyjzogt6vcvhd5en526nzsvdi

Discovering Physical Interaction Vulnerabilities in IoT Deployments [article]

Muslum Ozgur Ozmen, Xuansong Li, Andrew Chun-An Chu, Z. Berkay Celik, Bardh Hoxha, Xiangyu Zhang
2021 arXiv   pre-print
Internet of Things (IoT) applications drive the behavior of IoT deployments according to installed sensors and actuators.  ...  physical interaction policies, and (4) identification of the root cause of policy violations and proposing patches that guide users to prevent them.  ...  Recent efforts mainly focus on identifying software interactions via app source code analysis [7, 8, 12-14, 45, 56] .  ... 
arXiv:2102.01812v1 fatcat:ib5wdaeydzcellemgg746obewa

Improved BDD-Based Discrete Analysis of Timed Systems [chapter]

Truong Khanh Nguyen, Jun Sun, Yang Liu, Jin Song Dong, Yan Liu
2012 Lecture Notes in Computer Science  
The usefulness and scalability of the library are demonstrated by supporting two languages, i.e., closed timed automata and Stateful Timed CSP.  ...  Furthermore, we develop a BDD library which supports not only encoding/verifying of timed state machines (through digitization) but also composing timed components using a rich set of composition functions  ...  This research is partially supported by project IDG31100105/IDD11100102 from Singapore University of Technology and Design, and TRF project 'Research and Development in the Formal Verification of System  ... 
doi:10.1007/978-3-642-32759-9_28 fatcat:qm2idtzs4ra3lkkjb7xx5vuefm

Soft constraint automata with memory

Kasper Dokter, Fabio Gadducci, Benjamin Lion, Francesco Santini
2020 Journal of Logical and Algebraic Methods in Programming  
We revise soft constraint automata, wherein transitions are weighted and each action has an associated preference value.  ...  We then equip automata with memory locations, that is, with an internal state to remember and update information from transition to transition.  ...  Intentional, guarded, and augmented Büchi automata of records query the presence of I/O requests via a Boolean guard.  ... 
doi:10.1016/j.jlamp.2020.100615 fatcat:sqjktjgcy5huxcmbq3xxhgxnea

Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification [chapter]

Tristan Le Gall, Bertrand Jeannet
2007 Lecture Notes in Computer Science  
We apply this abstract lattice for the verification of symbolic communicating machines, and we discuss its usefulness for interprocedural analysis.  ...  The abstract representation is based on lattice automata, which are finite automata labeled by elements of an atomic lattice.  ...  The initial motivation of this work was the analysis of communicating machines exchanging messages via FIFO queues, which typically models communication protocols.  ... 
doi:10.1007/978-3-540-74061-2_4 fatcat:x3aeq7y775avzc3zjiol3jgkwe

A Movable Architecture for Robust Spatial Computing

D. H. Ackley, D. C. Cannon, L. R. Williams
2012 Computer journal  
We presume discrete sites in space and time, and employ a new form of asynchronous cellular automata (see section 1.4.3) that has a neighborhood far too large to allow construction of a state transition  ...  This paper is an extended introduction for the spatial computing community to the Movable Feast Machine (MFM), a computing model in the spirit of an object-oriented asynchronous cellular automata.  ...  At a channel length of 5 (in which case the emitter and absorber neighborhoods overlap) performance is random; by the time the channel length reaches 150 or so, performance begins to saturate at about  ... 
doi:10.1093/comjnl/bxs129 fatcat:kfnhwe5wpvh4ffenic2u4qzhae
« Previous Showing results 1 — 15 out of 2,658 results