Filters








3,720 Hits in 7.0 sec

Comparing detailed and abstract timed models of automated discrete manufacturing systems

Matthieu Perin, Jean-Marc Faure
2013 2013 IEEE International Conference on Automation Science and Engineering (CASE)  
This paper proposes an equivalence relation that permits to compare the external behaviors of two models of the same component of an automated discrete system: a detailed model suitable to design the control  ...  of this component and a more abstract model where only the order and the durations of the operations performed by this component are considered.  ...  A network of TADD is a set of automata A TADD i = (L i , l 0 i , V, C, E i , I i ) with i ∈ 1, . . . , n, n ∈ N * ; the sets of clocks (C) and variables (V = V B ∪ V Z ) -composed of Boolean variables  ... 
doi:10.1109/coase.2013.6653993 dblp:conf/case/PerinF13 fatcat:kranvl7kejdc7gepol7su4a4j4

Model Predictive Control of Priced Timed Automata Encoded With First-Order Logic

Efe C. Balta, Ilya Kovalenko, Isaac A. Spiegel, Dawn M. Tilbury, Kira Barton
2021 IEEE Transactions on Control Systems Technology  
Priced timed automata (PTA) are discrete-event system models with temporal constraints and a cost function and are used to pose optimal scheduling and routing problems.  ...  Finally, the proposed control framework and implementation are demonstrated in a simulation case study on the guidance of a product through a manufacturing system.  ...  Definition 1 (Priced Timed Automata): A PTA A is defined as an eight-tuple A = (Q, C, , E, I , R, P, q 0 ), where Q = {q 0 , q 1 , . . . , q n q } is a finite set of locations, C = c 0 × c 1 × · · · ×  ... 
doi:10.1109/tcst.2021.3054800 fatcat:xjnjtg2a5vgt7oglyqubqbejya

Comparing timed and hybrid automata as approximations of continuous systems [chapter]

Olaf Stursberg, Stefan Kowalewski, Ingo Hoffmann, Jörg Preußig
1997 Lecture Notes in Computer Science  
We describe two approaches to derive Timed and Linear Hybrid Automata from continuous models given as systems of ordinary di erential equations.  ...  Results of a reachability analysis obtained with the tool HyTech are presented.  ...  According to the de nition in 2], a Timed Automata (TA) is a 6-tuple f ; S; S 0 ; C; E; Fg with a nite alphabet , a nite set of states S and initial states S 0 S, a nite set of clocks C and a set of transitions  ... 
doi:10.1007/bfb0031569 fatcat:qddk5jx3gfbo7kvhvrc6woiaxq

Statically checkable pattern abstractions

Manuel Fähndrich, John Boyland
1997 SIGPLAN notices  
Pattern abstractions increase the expressiveness of pattern matching, enabling the programmer to describe a broader class of regular forests with patterns.  ...  Past research on pattern abstractions has generally ignored the aspect of compile-time checks for exhaustiveness and redundancy.  ...  p Sp C e _ = _ Sp C e x = e(x) Sp C e fail = fail Sp C e c(p1, : : : ,pn) = c(Sp C e p1, : : : ,Sp C e pn) Sp C e f(p1, : : : ,pn) = S f C f(Sp C e p1, : : : ,Sp C e pn) Sp C e (p1 | p2) = Sp C e p1 |  ... 
doi:10.1145/258949.258957 fatcat:xvnc25teyreijpzdelplaehuoe

Abstraction Refinement Algorithms for Timed Automata [chapter]

Victor Roussanaly, Ocan Sankur, Nicolas Markey
2019 Lecture Notes in Computer Science  
We present abstraction-refinement algorithms for model checking safety properties of timed automata.  ...  symbolic algorithm where the abstract transition system is encoded with Boolean formulas.  ...  These algorithms have been extended to verify real-time systems modelled as timed automata [2, 3] , an extension of finite automata with clock variables to measure and constrain the amount of time elapsed  ... 
doi:10.1007/978-3-030-25540-4_2 fatcat:5ju5dna3fbe3dpnbmzh5ks3fce

Abstraction Refinement-Based Verification of Timed Automata

Tamás Tóth, István Majzik
2021 Zenodo  
In addition, the state space is not necessarily finite, in particular for real-time systems, where continuous variables with time dimension are part of the specification.  ...  As a result, the abstracted system is a simpler system whose behavior overapproximates that of the original system, therefore, if the abstract system is correct, so is the original one.  ...  (x, δ) / ∈ S skip x σ ′ (x) = σ(x) • Exactly one of the following rules applies for the next value of the calendar C. e ∈ T σ(e) = σ(τ ) µ = none e over / send none σ ′ (C) = σ(C) e ∈ T σ(e) = σ(τ ) µ  ... 
doi:10.5281/zenodo.4759046 fatcat:3vrprqrhfjeknjjdn74uqoreo4

Completeness of Lyapunov Abstraction

Rafael Wisniewski, Christoffer Sloth
2013 Electronic Proceedings in Theoretical Computer Science  
An abstraction is said to be sound when the flow of the time automata covers the flow lines of the dynamical systems.  ...  If the dynamics of the dynamical system and the time automaton are equivalent, the abstraction is complete.  ...  (C) assigns invariants to locations. • ∆ ⊆ E × Ψ(C) × Σ × 2 C × E is a finite set of transition relations.  ... 
doi:10.4204/eptcs.124.5 fatcat:46gcunqdw5an7kj2tjsetw5a5i

Abstracts of Current Computer Literature

1969 IEEE transactions on computers  
Time-sharing systems, as defined in this article are those multiaccess systems which permit a terminal user to utilize essentially the full resources of the system while sharing its time with other terminal  ...  It is each terminal user's ability to utilize the full resources of the system that makes quantitative evaluation of time-sharing systems 484 ABSTRACTS OF CURRENT COMPUTER LITERATURE particularly difficult  ... 
doi:10.1109/t-c.1969.222696 fatcat:yhhpsujxdraaflgkml3euqfkxa

Abstracting Abstract Machines [article]

David Van Horn, Matthew Might
2010 arXiv   pre-print
We describe a derivational approach to abstract interpretation that yields novel and transparently sound static analyses when applied to well-established abstract machines.  ...  For all of these machines, we find that a series of well-known concrete machine refactorings, plus a technique we call store-allocated continuations, leads to machines that abstract into static analyses  ...  The abstract time-stamped CESK ⋆ machine is defined in Figure 5 . The (non-deterministic) abstract transition relation changes little compared with the concrete machine.  ... 
arXiv:1007.4446v2 fatcat:lrf375hox5htxdwuwevpqd2wre

Abstracting abstract machines

David Van Horn, Matthew Might
2010 Proceedings of the 15th ACM SIGPLAN international conference on Functional programming - ICFP '10  
We describe a derivational approach to abstract interpretation that yields novel and transparently sound static analyses when applied to well-established abstract machines.  ...  For all of these machines, we find that a series of well-known concrete machine refactorings, plus a technique we call store-allocated continuations, leads to machines that abstract into static analyses  ...  e, ρ, σ[b → fn(v, ρ, c)], b, u if κ = fn((λx.e), ρ , c) e, ρ [x → b], σ[b → (v, ρ)], c, u The time-stamped CESK machine is defined in Figure 4 .  ... 
doi:10.1145/1863543.1863553 dblp:conf/icfp/HornM10 fatcat:liy6ejmwmjbw5ptitjll42kxzi

Abstracting abstract machines

David Van Horn, Matthew Might
2011 Communications of the ACM  
We describe a derivational approach to abstract interpretation that yields novel and transparently sound static analyses when applied to well-established abstract machines.  ...  For all of these machines, we find that a series of well-known concrete machine refactorings, plus a technique we call store-allocated continuations, leads to machines that abstract into static analyses  ...  e, ρ, σ[b → fn(v, ρ, c)], b, u if κ = fn((λx.e), ρ , c) e, ρ [x → b], σ[b → (v, ρ)], c, u The time-stamped CESK machine is defined in Figure 4 .  ... 
doi:10.1145/1995376.1995400 fatcat:zxmjehncnrfqdp4zwijasn5u7a

Abstracting abstract machines

David Van Horn, Matthew Might
2010 SIGPLAN notices  
We describe a derivational approach to abstract interpretation that yields novel and transparently sound static analyses when applied to well-established abstract machines.  ...  For all of these machines, we find that a series of well-known concrete machine refactorings, plus a technique we call store-allocated continuations, leads to machines that abstract into static analyses  ...  e, ρ, σ[b → fn(v, ρ, c)], b, u if κ = fn((λx.e), ρ , c) e, ρ [x → b], σ[b → (v, ρ)], c, u The time-stamped CESK machine is defined in Figure 4 .  ... 
doi:10.1145/1932681.1863553 fatcat:zupwxrjpgjdzpf6tyqllnpesxe

Abstracts of Current Computer Literature

1970 IEEE transactions on computers  
Abstract Families of Lan- guages 7738 Realization of Finite Automata with Modu- lar Tree Structures 7739 Stochastic Automata Models of Learning Control Systems 7783 -see also Context-Free, Languages  ...  Comparisons with previous methods are made both analytically and empirically. The Use of Quadratic Residue -Search, C. E. Radke (IBM, Endicott); Commun. ACM, vol. 13, pp. 103-105, February 1970.  ... 
doi:10.1109/t-c.1970.223012 fatcat:r5fw2k62rfhphcyztzcnhldnry

Abstraction In Model Checking Real-Time Temporal Logic of Knowledge

CongHua Zhou, Bo Sun
2012 Journal of Computers  
be used to combine the abstract states, as a result, the state space of the real time interpreted system can be further simplified.  ...  For the real time part of TACTLK, that is TACTL, we adopt the abstract discrete clock valuations, and in this way the infinite state space of a real time interpreted system can be converted into a finite  ...  (Timed automata) A timed automaton can be represented as a tuple: 0 ( , , , , , ) TA L Act C E l Inv = . where L is a finite set of locations, 0 l L ∈ is the initial location, Act is a finite set of actions  ... 
doi:10.4304/jcp.7.2.362-370 fatcat:c7l2j2idwzdwfkrc5tnqs5fwvu

Abstracts of Current Computer Literature1 (415) 1623

1971 IEEE transactions on computers  
The second result deals with n deterministic real time pushdown automata operating independently in parallel.  ...  The new technique is shown to be significantly faster for comparable accuracy. 12) REAL-TIME SYSTEMS AND 14) BUSINESS APPLICATIONS OF INFORMATION PROCESSING Computer Oriented Curricula in Business  ... 
doi:10.1109/t-c.1971.223194 fatcat:hh2wp6alenexvpphuet7losv7e
« Previous Showing results 1 — 15 out of 3,720 results