6,722 Hits in 4.0 sec

Multi-Agent Systems: Modeling and Verification Using Hybrid Automata [chapter]

Ammar Mohammed, Ulrich Furbach
2010 Lecture Notes in Computer Science  
automata, as well as to provide the reachable regions symbolically.  ...  Basically, the parallel composition of hybrid automata can be used for specifying larger systems (multi-agent systems), where a hybrid automaton is given for each part of the system, and communication  ... 
doi:10.1007/978-3-642-14843-9_4 fatcat:txbyuahum5a57k3tqi5hbzijia

On Interleaving in Timed Automata [chapter]

Ramzi Ben Salah, Marius Bozga, Oded Maler
2006 Lecture Notes in Computer Science  
The standard reachability algorithm (Kronos and Uppaal,...) computes a reachability graph S = (N, →), the nodes of which are symbolic states.  ...  compound steps ending in a time step: The semantics of a timed automaton yields an infinite transition system which is not an appropriate basis for verification algorithms ⇒ Symbolic representation.  ...  We detected through this study an interesting subset of Timed Automata where the zones have often a rectangular form.  ... 
doi:10.1007/11817949_31 fatcat:xlbizpurabhuzakhlo4xwyynne


2012 International Journal of Foundations of Computer Science  
For compositional system design, parallel composition of timed automata as proposed by Larsen et al. [22] is useful.  ...  Communicated by (xxxxxxxxxx) Timed automata are commonly recognized as a formal behavioral model for real-time systems.  ...  Ogawa Mizuhito and Prof. Jean-Francois Monin for fruitful discussions on the research. This research is supported by the National Nature Science  ... 
doi:10.1142/s0129054112400382 fatcat:qhcvvcb7n5hgvj6tc2pdrvsuxq

Modeling and analysis of real -time systems with mutex components

Guoqiang Li, Xiaojuan Cai, Shoji Yuen
2010 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)  
For compositional system design, parallel composition of timed automata as proposed by Larsen et al. [22] is useful.  ...  Communicated by (xxxxxxxxxx) Timed automata are commonly recognized as a formal behavioral model for real-time systems.  ...  Ogawa Mizuhito and Prof. Jean-Francois Monin for fruitful discussions on the research. This research is supported by the National Nature Science  ... 
doi:10.1109/ipdpsw.2010.5470825 dblp:conf/ipps/LiCY10 fatcat:dfnnkgg6nzecxmmz3x4wboxzdq

Multi-Robot Systems: Modeling, Specification, and Model Checking [chapter]

Ammar Mohammed, Ulrich Furbach, Frieder Stolzenburg
2010 Robot Soccer  
However, under various constraints, reachability is decidable for certain classes of hybrid automata including timed and initialized rectangular automata (Henzinger et al., 1998) .  ...  In Banda & Gallagher (2008) , it is shown how reachability analysis for linear hybrid automata can be done by means of CLP, again by computing compositions of (simple) hybrid automata.  ... 
doi:10.5772/7349 fatcat:scvgry75fnbyta67aajoot6rda

Corroboration Strategy for Web Services Choreography using Revise Buchi Automata

N. Danapaquiame, E. Ilavarasan
2013 International Journal of u- and e- Service, Science and Technology  
This paper introduces an approach for verifying the WSC using Revise Buchi Automata (RBA) for non-deterministic system.  ...  A new algorithm called Revise Buchi Sparseness Reachability (RBSR) has been developed to avoid the Sparseness problem and Reachability problem.  ...  emptiness and reachability implemented using Timed Automata [1] and dead transition which is implemented using Interface Automata [2] and etc., • A tool to verify WSC namely WSCVT (Web Service Choreography  ... 
doi:10.14257/ijunesst.2013.6.5.11 fatcat:3bjpz5agxfbmjhcg3mveuidzrm

Model Checking of Hybrid Systems Using Shallow Synchronization [chapter]

Lei Bu, Alessandro Cimatti, Xuandong Li, Sergio Mover, Stefano Tonetta
2010 Lecture Notes in Computer Science  
In this paper, we investigate the different symbolic encodings of the reachability problem of a network of hybrid automata.  ...  An alternative compositional semantics, called "shallow synchronization", exploits the locality of transitions and relaxes time synchronization.  ...  Conclusions and Future Work In this paper we have introduced a novel approach to symbolic reachability in networks of hybrid automata.  ... 
doi:10.1007/978-3-642-13464-7_13 fatcat:6expaqekefbp3ecmsv6tgdjxe4

Formal Analysis of Hierarchical State Machines [chapter]

Rajeev Alur
2003 Lecture Notes in Computer Science  
q Relevant information about a box: for entry e and exit x, is an accepting cycle reachable from e, is x reachable from e along a path containing a node in T, is x reachable from e q Complexity same  ...  Language and Tool Hierarchical Automata q Hierarchical state machines with edges labeled by alphabet symbols, and initial/final nodes can be viewed as language generators q {w # w R | |w| = n}  ...  Exploiting Hierarchy in Symbolic Search q Transition relation is indexed by control points  ... 
doi:10.1007/978-3-540-39910-0_3 fatcat:zoyccxtbvbe5rlqwe4mlfn3rbm

The FC2TOOLS set [chapter]

Amar Bouali, Annie Ressouche, Valérie Roy, Robert Simone
1996 Lecture Notes in Computer Science  
Both FC2EXPLICIT and FC2IMPLICIT commands perform synchronised product and reachable state space search.  ...  Of uttermost interest in the new implementation is that most analysis functions are implemented with redundancy using both explicit classical representation of automata, and also implicit state space symbolic  ...  We use symbolic methods based on BDDs for an easy evaluation of global state spaces and deadlock checking.  ... 
doi:10.1007/3-540-61474-5_98 fatcat:a2skyrt7jrd5hew3542iy53mee

Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis [chapter]

Parosh Aziz Abdulla, Aurore Annichini, Saddek Bensalem, Ahmed Bouajjani, Peter Habermehl, Yassine Lakhnech
1999 Lecture Notes in Computer Science  
procedures and reachability analysis procedures for fifo channels systems.  ...  We develop a general methodology for analyzing such systems based on combining automatic generation of abstract models (not necessarily finite-state) with symbolic reachability analysis.  ...  and for which there are symbolic representations and procedures for reachability analysis.  ... 
doi:10.1007/3-540-48683-6_15 fatcat:7i7pjhprhnaf5bkiqyyzcvmw34

Making the Right Cut in Model Checking Data-Intensive Timed Systems [chapter]

Rüdiger Ehlers, Michael Gerke, Hans-Jörg Peter
2010 Lecture Notes in Computer Science  
In this paper, we introduce a simple general framework for combining both data structures, enabling a joint symbolic representation of the timed state sets in the reachability fixed point construction.  ...  Additionally, our framework allows to employ existing highly-optimized implementations for DBMs and BDDs without modifications.  ...  This work was supported by the German Research Foundation (DFG) as part of the Transregional Collaborative Research Center "Automatic Verification and Analysis of Complex Systems" (SFB/TR 14 AVACS).  ... 
doi:10.1007/978-3-642-16901-4_37 fatcat:m64gkdflrfbetjjbi4ifdzfr4u


Stanley Bak, Sergiy Bogomolov, Taylor T. Johnson
2015 Proceedings of the 18th International Conference on Hybrid Systems Computation and Control - HSCC '15  
Internally, the tool supports generic model-to-model transformation passes that serve to both ease the translation and potentially improve reachability results for the supported tools.  ...  Our evaluation demonstrates Hyst is capable of automatically translating benchmarks in several classes (including affine and nonlinear hybrid automata) to the input formats of several tools.  ...  Networks and Compositions of Hybrid Automata. SpaceEx supports composing networks of hybrid automata, whereas the other tools work with flat automata.  ... 
doi:10.1145/2728606.2728630 dblp:conf/hybrid/BakBJ15 fatcat:urdljbjf7ne7tahiuyn2jni5ta

Emerald: An Automated Modeling and Verification Tool for Component-Based Real-Time Systems

Yizhou Zhang, Hao Lin, Guoqiang Li
2012 2012 12th International Conference on Quality Software  
Controller automata are a formal theory to model and analyze real-time systems with mutex components.  ...  or timed automata, say, UPPAAL.  ...  The reachability problem for timed automata [2] , [4] is decidable. B.  ... 
doi:10.1109/qsic.2012.27 dblp:conf/qsic/ZhangLL12 fatcat:esdzm7bluvfqvmhtj6ybng2ntu

Model Checking as A Reachability Problem [chapter]

Moshe Y. Vardi
2009 Lecture Notes in Computer Science  
check whether the composite system has a reachable (fair) path, that is, a reachable SCC with an accepting states.  ...  Computational Complexity Complexity: Linear timeReachability: breadth-first search or depth-first search • Fair Reachability: depth-first search (find a reachable SCC with fair states) The fundamental  ... 
doi:10.1007/978-3-642-04420-5_5 fatcat:fxd6kr3oazbibm7vc3vqfumtpi

A verification strategy for web services composition using enhanced stacked automata model

Danapaquiame Nagamouttou, Ilavarasan Egambaram, Muthumanickam Krishnan, Poonkuzhali Narasingam
2015 SpringerPlus  
Initially web services are composed using Business Process Execution Language for Web Service (BPEL4WS) and it is converted into ESAM (combination of Muller Automata (MA) and Push Down Automata (PDA))  ...  Individual service offered by some service providers may symbolize limited business functionality; however, by composing individual services from different service providers, a composite service describing  ...  Authors' contributions Departed transition and deadlock problem is identified and rectified. All authors read and approved the final manuscript. Received: 15 July 2014 Accepted: 8 January 2015  ... 
doi:10.1186/s40064-015-0805-1 pmid:25810951 pmcid:PMC4369210 fatcat:gnmbrywpm5aelklgv2wwroug4u
« Previous Showing results 1 — 15 out of 6,722 results