Filters








1,549 Hits in 2.7 sec

Detecting Unrealizable Specifications of Distributed Systems [chapter]

Bernd Finkbeiner, Leander Tentrup
2014 Lecture Notes in Computer Science  
If the system consists of a single process, then unrealizable specifications can be detected with synthesis algorithms, which detect unrealizability as a byproduct of attempting to construct an implementation  ...  Havelund (Eds.): TACAS 2014, LNCS 8413, pp. 78-92, 2014. c Springer-Verlag Berlin Heidelberg 2014 Detecting Unrealizable Specifications of Distributed Systems 79 implementation.  ...  To the best of the authors' knowledge, there has been no attempt in the literature to characterize unrealizable specifications for distributed systems beyond the restricted class of architectures with  ... 
doi:10.1007/978-3-642-54862-8_6 fatcat:i2idse77njb3lbbdgxxrotezcm

Synthesizing Reactive Systems from Hyperproperties [chapter]

Bernd Finkbeiner, Christopher Hahn, Philip Lukert, Marvin Stenger, Leander Tentrup
2018 Lecture Notes in Computer Science  
., sets of traces, to sets of sets of traces. Typical examples are information-flow policies like noninterference, which stipulate that no sensitive data must leak into the public domain.  ...  We report encouraging experimental results obtained with a prototype implementation on example specifications with hyperproperties like symmetric responses, secrecy, and information-flow.  ...  Furthermore, we presented two algorithms to detect realizable and unrealizable HyperLTL specifications, one based on bounding the system implementation and one based on bounding the number of counterexample  ... 
doi:10.1007/978-3-319-96145-3_16 fatcat:ccrikv2wtzhbph4ojef5kw4vtm

Synthesis from Hyperproperties

Bernd Finkbeiner, Christopher Hahn, Philip Lukert, Marvin Stenger, Leander Tentrup
2019 Zenodo  
Furthermore, HyperLTL subsumes many classical extensions of the LTL realizability problem, including realizability under incomplete information, distributed synthesis, and fault-tolerant synthesis.  ...  ., sets of traces, to sets of sets of traces. Typical examples are information-flow policies like noninterference, which stipulate that no sensitive data must leak into the public domain.  ...  Furthermore, we presented two algorithms to detect realizable and unrealizable HyperLTL specifications, one based on bounding the system implementation and one based on bounding the number of counterexample  ... 
doi:10.5281/zenodo.4453295 fatcat:koqnmdqq7fb5hh7pu6f5unyiha

Performance heuristics for GR(1) synthesis and related algorithms

Elizabeth Firman, Shahar Maoz, Jan Oliver Ringert
2019 Acta Informatica  
The list includes several heuristics for controlled predecessor computation and BDDs, early detection of fixed-points and unrealizability, fixed-point recycling, and several heuristics for unrealizable  ...  We evaluate the presented heuristics on SYNTECH15, a total of 78 specifications of 6 autonomous Lego robots, on SYNTECH17, a total of 149 specifications of 5 autonomous Lego robots, all written by 3rd  ...  We thank Rafi Shalom for noticing a mistake in the preliminaries section of the workshop version of the paper.  ... 
doi:10.1007/s00236-019-00351-9 pmid:32189716 pmcid:PMC7056736 fatcat:pmtbjezyjvaspc7kh3ztu3eqma

Synthesis from hyperproperties

Bernd Finkbeiner, Christopher Hahn, Philip Lukert, Marvin Stenger, Leander Tentrup
2019 Acta Informatica  
Furthermore, HyperLTL subsumes many classical extensions of the LTL realizability problem, including realizability under incomplete information, distributed synthesis, and fault-tolerant synthesis.  ...  ., sets of traces, to sets of sets of traces. Typical examples are information-flow policies like noninterference, which stipulate that no sensitive data must leak into the public domain.  ...  For example, the specification ∀π. (o π ↔ i π ) (5) is unrealizable as the system cannot predict future values of the environment.  ... 
doi:10.1007/s00236-019-00358-2 pmid:32189717 pmcid:PMC7056710 fatcat:m2ima3ultjf4vki24thsyawm7i

Detecting Unrealizability of Distributed Fault-tolerant Systems

Bernd Finkbeiner, Leander Tentrup, Erika Abraham
2015 Logical Methods in Computer Science  
Writing formal specifications for distributed systems is difficult.  ...  Even simple consistency requirements often turn out to be unrealizable because of the complicated information flow in the distributed system: not all information is available in every component, and information  ...  Acknowledgments This work was partially supported by the German Research Foundation (DFG) as part of the Transregional Collaborative Research Center "Automatic Verification and Analysis of Complex Systems  ... 
doi:10.2168/lmcs-11(3:12)2015 fatcat:gq2nxd7q7bboficu2h5srjt6rq

Distributed Synthesis of Control Protocols for Smart Camera Networks

Necmiye Ozay, Ufuk Topcu, Richard M. Murray, Tichakorn Wongpiromsarn
2011 2011 IEEE/ACM Second International Conference on Cyber-Physical Systems  
Then, in order to alleviate the computational complexity associated with LTL synthesis and to enable implementation of local control protocols on individual PTZ cameras, we propose a distributed synthesis  ...  We first present a centralized control architecture for assigning PTZ cameras to targets so that the specification is met for any admissible behavior of the targets.  ...  One of the drawbacks of our approach is its lack of providing any insight about the unrealizability of the global specification when local specifications turn out to be unrealizable.  ... 
doi:10.1109/iccps.2011.22 dblp:conf/iccps/OzayTMW11 fatcat:emn3h5iqmzaexfwqq44xrcfote

Collision-aware formation assignment of quadrotors

I.P. Titkov, A.A Karpunin
2021 Procedia Computer Science  
case of unrealizability the next optimal solution is being validated.  ...  case of unrealizability the next optimal solution is being validated.  ...  Collision detection Collision detection is the computational problem of detecting the intersection of objects. The solution to this problem is to answer the question of whether objects collided.  ... 
doi:10.1016/j.procs.2021.04.195 fatcat:sgcnumjk7jbdzfy73nnef3hn4u

Acceptance and random generation of event sequences under real time calculus constraints

Kajori Banerjee, Pallab Dasgupta
2014 Design, Automation & Test in Europe Conference & Exhibition (DATE), 2014  
They also require monitors for checking whether the output of the system satisfies the desired throughput.  ...  Simulation platforms for complex networked real time systems require random input pattern generators for simulating input distributions.  ...  Such a specification may be used in verifying the reliability of the model of the communication system.  ... 
doi:10.7873/date.2014.267 dblp:conf/date/BanerjeeD14 fatcat:j5dk4fo5uba77hngjk3ahrbjd4

Spectra: a specification language for reactive systems

Shahar Maoz, Jan Oliver Ringert
2021 Journal of Software and Systems Modeling  
AbstractWe introduce Spectra, a new specification language for reactive systems, specifically tailored for the context of reactive synthesis.  ...  Lego robots and additional example reactive systems.  ...  We thank Elizabeth Firman, Aviv Kuvent, Or Pistiner, Rafi Shalom, Ilia Shevrin, Keren Solodkin, and Yoni Wolbe for their contribution to the implementation of Spectra Tools.  ... 
doi:10.1007/s10270-021-00868-z fatcat:okjmdffdxbdxdladfiaqztjqu4

Analysis and Verification of Service Interaction Protocols - A Brief Survey

Gwen Salaün
2010 Electronic Proceedings in Theoretical Computer Science  
Composing Web services is a complicated task which requires techniques and tools to verify that the new system will behave correctly.  ...  Second, we give a brief survey of verification techniques that can be used to analyse services and their interaction. Last, we focus on the realizability and conformance of choreographies.  ...  The author would like to thank Meriem Ouederni for her comments on a former version of this paper.  ... 
doi:10.4204/eptcs.35.7 fatcat:k57itzmpoff3dn7n744wmxxo7m

Realizability of Choreographies Using Process Algebra Encodings

Gwen Salan, Tevfik Bultan, Nima Roohi
2012 IEEE Transactions on Services Computing  
Service-oriented computing has emerged as a new software development paradigm that enables implementation of Web accessible software systems that are composed of distributed services which interact with  ...  If a collaboration diagram is unrealizable, our approach extends the peer generation process by adding extra communication that guarantees that the peers behave according to the choreography specification  ...  The authors thank Javier Cámara and José Antonio Martín for fruitful discussions and interesting comments on a former version of this article.  ... 
doi:10.1109/tsc.2011.9 fatcat:3trnoyeiive4hih2tyadkzup5q

Realizability of Choreographies Using Process Algebra Encodings [chapter]

Gwen Salaün, Tevfik Bultan
2009 Lecture Notes in Computer Science  
Service-oriented computing has emerged as a new software development paradigm that enables implementation of Web accessible software systems that are composed of distributed services which interact with  ...  If a collaboration diagram is unrealizable, our approach extends the peer generation process by adding extra communication that guarantees that the peers behave according to the choreography specification  ...  The authors thank Javier Cámara and José Antonio Martín for fruitful discussions and interesting comments on a former version of this article.  ... 
doi:10.1007/978-3-642-00255-7_12 fatcat:vlnvbwacxnbnde5xkciyz464pq

The 4th Reactive Synthesis Competition (SYNTCOMP 2017): Benchmarks, Participants & Results

Swen Jacobs, Nicolas Basset, Roderick Bloem, Romain Brenguier, Maximilien Colange, Peter Faymonville, Bernd Finkbeiner, Ayrat Khalimov, Felix Klein, Thibaud Michaud, Guillermo A. Pérez, Jean-François Raskin (+2 others)
2017 Electronic Proceedings in Theoretical Computer Science  
Finally, we present and analyze the results of our experimental evaluation, including a ranking of tools with respect to quantity and quality of solutions.  ...  We present the participants of SYNTCOMP 2017, with a focus on changes with respect to the previous years and on the two completely new tools that have entered the competition.  ...  Distributed and Parameterized Systems" (JA 2357/2-1), and its setup and execution by the European Research Council (ERC) Grant OSARES (No. 683300).  ... 
doi:10.4204/eptcs.260.10 fatcat:k66mstfsmzgmbor32elcwfuvgi

Self-configuration Via Cooperative Social Behavior [chapter]

Wolfgang Trumler, Robert Klaus, Theo Ungerer
2006 Lecture Notes in Computer Science  
Starting from huge monolithic systems for many users up to ubiquitous computer environments with a lot of distributed and embedded computing power.  ...  Aim of the selfconfiguration is to find a good distribution of services by calculating a quality of service based on the given resources and the required resources of the services.  ...  detected.  ... 
doi:10.1007/11839569_9 fatcat:ri2ymdjzvngmjfpzrouipye4z4
« Previous Showing results 1 — 15 out of 1,549 results