Filters








13 Hits in 9.0 sec

Improving Model Checking Stateful Timed CSP with non-Zenoness through Clock-Symmetry Reduction [chapter]

Yuanjie Si, Jun Sun, Yang Liu, Ting Wang
2013 Lecture Notes in Computer Science  
In this paper, we improve our previous work by combining the checking algorithm with a clock-symmetry reduction method.  ...  In our previous work [23], we show that model checking Stateful Timed CSP with non-Zenoness based on zone graphs only is feasible, due to the difference between Stateful Timed CSP and Timed Automata.  ...  As for future work, we are investigating how to check timed refinement relationship between two Stateful Timed CSP models with the assumption of non-Zenoness.  ... 
doi:10.1007/978-3-642-41202-8_13 fatcat:wi4vyntdpbatfjg2qdtp47l7fi

Modeling and verifying hierarchical real-time systems using stateful timed CSP

Jun Sun, Yang Liu, Jin Song Dong, Yan Liu, Ling Shi, Étienne André
2013 ACM Transactions on Software Engineering and Methodology  
Unlike Timed Automata, model checking with non-Zenoness in Stateful Timed CSP can be achieved based on the zone graphs.  ...  Through dynamic zone abstraction, finite-state zone graphs can be generated automatically from Stateful Timed CSP models, which are subject to model checking.  ...  MODEL CHECKING WITH NON-ZENONESS In this section, we show that Stateful Timed CSP models can be model checked based on the abstract semantics.  ... 
doi:10.1145/2430536.2430537 fatcat:awv6tpfwzzgefeyi3x4cpaidbi

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  
Model checking timed systems through digitization is relatively easy, compared to zone-based approaches.  ...  The usefulness and scalability of the library are demonstrated by supporting two languages, i.e., closed timed automata and Stateful Timed CSP.  ...  One particularly interesting example is model checking with the assumption of non-Zenoness. A timed execution is Zeno if infinitely many discrete steps are taken within finite time.  ... 
doi:10.1007/978-3-642-32759-9_28 fatcat:qm2idtzs4ra3lkkjb7xx5vuefm

Verification and control of partially observable probabilistic systems

Gethin Norman, David Parker, Xueyi Zou
2017 Real-time systems  
states are partially visible to an observer or controller.  ...  For the discrete-time case, we formally model these systems using partially observable Markov decision processes; for dense time, we propose an extension of probabilistic timed automata in which local  ...  Time divergence As for PTAs and classic timed automata we restrict attention to timedivergent (or non-Zeno) strategies.  ... 
doi:10.1007/s11241-017-9269-4 fatcat:umwji5hnf5c2fhllicttiov44e

Modelling and analysing neural networks using a hybrid process algebra

Robert J. Colvin
2016 Theoretical Computer Science  
To achieve this a modelling language 'Pann' is developed, based on the process algebras CSP and Hybrid χ .  ...  Models have become more detailed as our understanding of the biology of the brain has increased, incorporating real-time behaviour of individual neurons interacting within complex system structures and  ...  algebra and models.  ... 
doi:10.1016/j.tcs.2015.08.019 fatcat:x7s3reyu25bixgdgx4y3kwf2ci

A Formal Definition of Time in LOTOS

Luc Léonard, Guy Leduc
1998 Formal Aspects of Computing  
Enhanced Timed-LOTOS, denoted ET-LOTOS, is an extension of LOTOS that allows the modelling of real-time behaviours.  ...  This requires to deal carefully with the presence of negative premises in the operational semantics, which are necessary to express urgency.  ...  As regards the infinite sequences of actions occurring in a finite non zero time, they are generally called '' zeno '' (with reference to the well-known paradox of Zeno of Elea including Achille and the  ... 
doi:10.1007/s001650050015 fatcat:frgruoqsjbbppe3yu6ux6q2oqe

Formal Modelling, Analysis and Verification of Hybrid Systems [chapter]

Naijun Zhan, Shuling Wang, Hengjun Zhao
2013 Lecture Notes in Computer Science  
In our framework, a hybrid system is modelled using Hybird CSP (HCSP), and specified and reasoned about by Hybrid Hoare Logic (HHL), which is an extension of Hoare logic to hybrid systems.  ...  We give some case studies from real-time world, for instance, Chinese High-Speed Train Control System at Level 3 (CTCS-3).  ...  Liang Zou are involved intensively in modelling and verifying CTCS-3; Mr. Liang Zou also helps with the development of HHL prover; Dr.  ... 
doi:10.1007/978-3-642-39721-9_5 fatcat:vcw3zr5b5vhi7izotaf5pbmige

Verification of real-time systems: improving tool support

Rodolfo Gomez
2021
In response, we develop new methods to guarantee timelock-freedom and absence of Zeno runs, which improve and complement the existent support.  ...  However, PITL has a decision procedure with a worst-case non-elementary complexity, which has hampered the development of efficient tool support.  ...  [79] present a prototype implementation of Uppaal with added symmetry reduction.  ... 
doi:10.22024/unikent/01.02.86456 fatcat:yl2w24yd25a7nliteuzltxtiyy

Quantum Tic-Tac-Toe: A Genuine Probabilistic Approach

Marius Nagy, Naya Nagy
2012 Applied Mathematics  
The author acknowledges the useful discussions on this work with Dr. Valeriy Anatoljevich Kozlovskyy, Dr. Igor Sergeevich Grunsky and Dr. Igor Potapov.  ...  Now, item (ii) together with the theorem stating that for any Euclidean field F there is a model of SpecRel with F as the field reduct ([2, Thm.4]) imply that SpecRel is undecidable.  ...  Since the field-reduct of a model is a field, then Robinson's arithmetic will be true in the field-reduct restricted to the subset defined by I.  ... 
doi:10.4236/am.2012.331243 fatcat:wsd7qixuojfrrpwamkhttx7uaa

Quantum Tic-Tac-Toe: A Genuine Probabilistic Approach

Marius Nagy
2012 Applied Mathematics  
The author acknowledges the useful discussions on this work with Dr. Valeriy Anatoljevich Kozlovskyy, Dr. Igor Sergeevich Grunsky and Dr. Igor Potapov.  ...  Now, item (ii) together with the theorem stating that for any Euclidean field F there is a model of SpecRel with F as the field reduct ([2, Thm.4]) imply that SpecRel is undecidable.  ...  Since the field-reduct of a model is a field, then Robinson's arithmetic will be true in the field-reduct restricted to the subset defined by I.  ... 
doi:10.4236/am.2012.311243 fatcat:ifj7pyn6mjdsxjxsrxnpu6qbby

Concurrency Control Protocols [chapter]

Shashi Shekhar, Hui Xiong
2008 Encyclopedia of GIS  
A number of methods are suggested to eliminate "unnecessary" states, such as partial reduction and symmetry reduction [Bos01, God96, Ip96] , but they do not work for all types of systems.  ...  • time(a i+1 ) ≥ time(a i ); • time(a i ) ≤ tout (s i ); • non-Zeno behavior (only finitely many actions in finite time).  ...  (gs1(site)))(T)) & gs2 = gs1 WITH [site := gs1(site) WITH [vvalue := LAMBDA x : IF xlocks(locks(gs1(site)))(T)(x) THEN cvalue(log(gs1(site)))(x) ELSE vvalue(gs1(site))(x) ENDIF, log := log(gs1(site)) WITH  ... 
doi:10.1007/978-0-387-35973-1_177 fatcat:vy7pq7zykvhxdbw2veepk4nbbm

Predictability in real-time software design [article]

Huang, J (Jinfeng), Otten, RHJM (Ralph), Corporaal, H (Henk), Voeten, JPM (Jeroen)
2005
Predictability in real-time software design. Eindhoven: Technische Universiteit Eindhoven. https://doi.org/10.6100/IR594545  ...  Software of the Dutch organization for Scientific Research NWO, the Dutch Ministry of Economic Affairs, the Technology Foundation STW and the Netherlands Organization for Applied Scientific Research TNO through  ...  This state sequence should be finite, because of the divergence property of time interval sequences (also referred to as the Non-Zeno property [4] ).  ... 
doi:10.6100/ir594545 fatcat:qhjwhzqw4jdrflemdvkpp5jfba

OASIcs, Volume 52, ICLP'16, Complete Volume [article]

Manuel Carro, Andy King, Neda Saeedloei, Marina De Vos
2016
References 17:7 count, it is relevant to take into consideration this research problem which is unclear and related with non-monotonic properties. Acknowledgements.  ...  I would like to thank the reviewers for taking the time to provide insightful comments and in-depth remarks. Acknowledgements. I want to thank Dr.  ...  Each clingo 5 run was restricted to 600 seconds wall-clock time, while memory was never exceeded.  ... 
doi:10.4230/oasics.iclp.2016 fatcat:yem5h7pgove25h6z7iriy5jngm