Results 21 to 30 of about 17,423 (281)
On Implementable Timed Automata [PDF]
Formal Techniques for Distributed Objects, 2020 Generating code from networks of timed automata is a well-researched topic with many proposed approaches, which have in common that they not only generate code for the processes in the network, but necessarily generate additional code for a global scheduler which implements the timed automata semantics.
Feo-Arenis S, Vujinović M, Westphal B.
europepmc +4 more sources
Improved Undecidability Results for Reachability Games on Recursive Timed Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We study reachability games on recursive timed automata (RTA) that generalize Alur-Dill timed automata with recursive procedure invocation mechanism similar to recursive state machines. It is known that deciding the winner in reachability games on RTA is
Shankara Narayanan Krishna +2 more
doaj +1 more source
A Secure Smart Contract Generation Method Based on Timed Automata [PDF]
Jisuanji gongcheng, 2023 Blockchain is a decentralized computing paradigm with promising application prospects in many fields. Smart contracts are the key to blockchain applications; however, security issues with smart contracts often occur, occasionally leading to significant ...
Yang LIU, Shengjie ZHANG
doaj +1 more source
On Nonlinear Prices in Timed Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 Priced timed automata provide a natural model for quantitative analysis of real-time systems and have been successfully applied in various scheduling and planning problems.
Devendra Bhave +2 more
doaj +1 more source
On the Designing of Model Checkers for Real-Time Distributed Systems
Моделирование и анализ информационных систем, 2015 To verify real-time properties of UML statecharts one may apply a UPPAAL, toolbox for model checking of real-time systems. One of the most suitable ways to specify an operational semantics of UML statecharts is to invoke the formal model of Hierarchical ...
D. Yu. Volkanov +4 more
doaj +3 more sources
Horn Clauses for Communicating Timed Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Languages based on the theory of timed automata are a well established approach for modelling and analysing real-time systems, with many applications both in industrial and academic context.
Hossein Hojjat +3 more
doaj +1 more source
The Multilateral Instrument: Avoidance of Permanent Establishment Status and the Reservations on behalf of Australia and the UK [PDF]
, 2013 This paper considers fully probabilistic system models. Each transition is quantified with a probability—its likelihood of occurrence. Properties are expressed as automata that either accept or reject system runs. The central question is to determine the
Ivanova, Milla
core +7 more sources
Electronic Proceedings in Theoretical Computer Science, 2014 In this paper, we define the class of hourglass automata, which are timed automata with bounded clocks that can be made to progress backwards as well as forwards at a constant rate.
Yuki Osada +3 more
doaj +1 more source
Probabilistic Timed Automata with Clock-Dependent Probabilities [PDF]
, 2017 Probabilistic timed automata are classical timed automata extended with discrete probability distributions over edges. We introduce clock-dependent probabilistic timed automata, a variant of probabilistic timed automata in which transition probabilities ...
A Abate +13 more
core +2 more sources
Minimizable timed automata [PDF]
, 1996 State minimization plays a fundamental role in both classical automata theory and in the theory of reactive systems. Many algorithms and results are based on the fact that for each finite automaton there exists an equivalent minimum state automaton that can be effectively computed and that is unique up to isomorphism.
Springintveld, J., Vaandrager, F.W.
openaire +3 more sources