Results 21 to 30 of about 9,817,544 (211)
The Use of Language Projection for Compositional Verification of Discrete Event Systems [PDF]
, 2008 This paper proposes the use of abstraction by language projection to improve the performance of compositional verification to prove or disprove that a large system of composed finite-state machines satisfies a given safety property.
Simon Ware +3 more
core +1 more source
Supremica – An integrated environment for verification, synthesis and simulation of discrete event systems [PDF]
, 2006 An integrated environment, Supremica, for verification, synthesis and simulation of discrete event systems is presented. The basic model in Supremica is finite automata where the transitions have an associated event together with a guard condition and an
\uc5kesson, Knut +8 more
core +1 more source
Mathematics, 2022 This paper develops the analysis of properties of the cellular automata class introduced by the authors. It is assumed that the set of automaton cells is finite and forms a closed lattice, and there are two states for each automaton cell.
Valery Kozlov +2 more
doaj +1 more source
Discretizations of axisymmetric systems [PDF]
Physical Review D, 2002 In this paper we discuss stability properties of various discretizations for axisymmetric systems including the so called cartoon method which was proposed by Alcubierre, Brandt et.al. for the simulation of such systems on Cartesian grids. We show that within the context of the method of lines such discretizations tend to be unstable unless one takes ...
openaire +2 more sources
Yet another approach to compositional synthesis of discrete event systems [PDF]
, 2008 A two-pass algorithm for compositional synthesis of modular supervisors for large-scale systems of composed finite-state automata is proposed. The first pass provides an efficient method to determine whether a supervisory control problem has a solution ...
Hugo Flordal +5 more
core +1 more source
Construction of discrete-time model for port-controlled Hamiltonian systems with applications [PDF]
, 2006 The issues of constructing a discrete-time model for Hamiltonian systems are in general different from those for dissipative systems. We propose an algorithm for constructing an approximate discrete-time model, which guarantees Hamiltonian conservation ...
Astolfi, A., +4 more
core +1 more source
An algorithm for compositional nonblocking verification of extended finite-state machines [PDF]
, 2014 This paper describes an approach for compositional nonblocking verification of discrete event systems modelled as extended finite-state machines (EFSM). Previous results about finite-state machines in lock-step synchronisation are generalised and applied
Fabian, Martin, +6 more
core +1 more source
IET Cyber-Physical Systems, 2017 Simulink/Stateflow is a popular commercial model-based development tool for many industrial domains. For safety and security concerns, verification and testing must be performed on the Simulink/Stateflow designs and the generated code.
Meng Li, Ratnesh Kumar
doaj +1 more source
, 2006 This paper presents a general framework for modular synthesis of supervisors for discrete event systems. The approach is based on compositional minimisation, using concepts of process equivalence.
Hugo Flordal +3 more
core +1 more source
Internetwork Time Synchronization of Mobile Ad Hoc Networks
IEEE Access, 2021 Several time synchronous ad hoc networks may operate in the same geographical area. Although network time synchronization within an individual network has been widely discussed, internetwork time synchronization relying on time sources the networks carry
Harri Saarnisaari +3 more
doaj +1 more source