Reactive Synthesis - Hands-on Exercise
|
|
- Ginger Cummings
- 8 years ago
- Views:
Transcription
1 Reactive Synthesis - Hands-on Exercise Lectures: Moshe Vardi Hands-on exercise: Rüdiger Ehlers ExCAPE Expeditions in Computer Augmented Program Engineering 13 th June 2013 Exercise: Rüdiger Ehlers (UCB/Cornell) Reactive Synthesis Berkeley, 13 th June / 10
2 Overview 1 Available Tools for LTL Synthesis 2 An overview of Acacia+ 3 Traffic Light Example 4 Rotation Sorter Exercise Exercise: Rüdiger Ehlers (UCB/Cornell) Reactive Synthesis Berkeley, 13 th June / 10
3 Some tools for Linear-time Temporal Logic Synthesis Full LTL Lily (Jobstmann and Bloem, 2006) Unbeast (Ehlers, 2011) Acacia+ (Bohy et al., 2012) Subset of LTL Marduk/Ratsy (Bloem et al., 2010) JTLV synthesizer (Pnueli et al., 2010) Bassist (Ehlers, 2012) More tools: Exercise: Rüdiger Ehlers (UCB/Cornell) Reactive Synthesis Berkeley, 13 th June / 10
4 Acacia+ (Bohy et al., 2012) Features Support for full LTL Optimized algorithms for specifications of the form φ 1 φ 2... φ n Can also optimize the solution towards mean-payoff objectives Techniques Is based on bounded synthesis (Schewe and Finkbeiner, 2007; Filiot et al., 2009), which in turn builds on Safraless synthesis (Kupferman and Vardi, 2005) Written in Python and C Interfaces with external LTL-to-automata translators Exercise: Rüdiger Ehlers (UCB/Cornell) Reactive Synthesis Berkeley, 13 th June / 10
5 Example An intersection Interface AP I = {t n, t e, t w, t s } AP O = {g n, g e, g w, g s } Specification G(g s ( g e g w )) G(t s F g s )... Exercise: Rüdiger Ehlers (UCB/Cornell) Reactive Synthesis Berkeley, 13 th June / 10
6 Extending the Example Improving the quality of service Idea: green light may only be given if car is detected. New conjuncts: G(g n t n ) G(g s t s ) G(g e t e ) G(g w t w ) Exercise: Rüdiger Ehlers (UCB/Cornell) Reactive Synthesis Berkeley, 13 th June / 10
7 Extending the Example Improving the quality of service Idea: green light may only be given if car is detected. New conjuncts: G(g n t n ) G(g s t s ) G(g e t e ) G(g w t w ) The setting is unrealizable now! Reason: Trigger signal might be released before green light is given. So we cannot avoid a conflict of: G(t s F g s ) G(t w F g w ) G(g s ( g w g e )) G(g w ( g n g s )) G(g s t s ) G(g w t w ) Exercise: Rüdiger Ehlers (UCB/Cornell) Reactive Synthesis Berkeley, 13 th June / 10
8 Extending the Example Improving the quality of service Idea: green light may only be given if car is detected. New conjuncts: G(g n t n ) G(g s t s ) G(g e t e ) G(g w t w ) The setting is unrealizable now! Reason: Trigger signal might be released before green light is given. So we cannot avoid a conflict of: G(t s F g s ) G(t w F g w ) G(g s ( g w g e )) G(g w ( g n g s )) G(g s t s ) G(g w t w ) Fixing unrealizability: adding assumptions (G((t s g s ) X t s )... G((t w g w ) X t w )) ψ Exercise: Rüdiger Ehlers (UCB/Cornell) Reactive Synthesis Berkeley, 13 th June / 10
9 Rotation Sorter x1, y1 b1, p1 p2 x0, y0 b0, p0 Input/Output per direction Inputs x and y encode packet destinations Output p pushes packets off the rotating table Output b triggers the in-belt Exercise: Rüdiger Ehlers (UCB/Cornell) Reactive Synthesis Berkeley, 13 th June / 10
10 Timing Example (transport packet by 240 ) x y p p p b Semantics Meaning x y No packet 0 0 Transport by Transport by Transport by (Almost) a possible part of the specification (x0 y0) (b0 X p1 XX p2 XXX p0) Exercise: Rüdiger Ehlers (UCB/Cornell) Reactive Synthesis Berkeley, 13 th June / 10
11 Exercise Your turn! Link Exercise: Rüdiger Ehlers (UCB/Cornell) Reactive Synthesis Berkeley, 13 th June / 10
12 More on the practical side of synthesis Suggestion Try out a synthesizer for generalized reactivity(1) specifications, such as, e.g., Marduk/Ratsy a, Gr1c b, or Slugs c. a b c Some light reading material R.E.: Experimental Aspects of Synthesis, International Workshop on Interactions, Games and Protocols (iwigp) 2011 Exercise: Rüdiger Ehlers (UCB/Cornell) Reactive Synthesis Berkeley, 13 th June / 10
13 References I Roderick Bloem, Alessandro Cimatti, Karin Greimel, Georg Hofferek, Robert Könighofer, Marco Roveri, Viktor Schuppan, and Richard Seeber. Ratsy - a new requirements analysis tool with synthesis. In Touili et al. (2010), pages ISBN Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Naiyong Jin, and Jean-François Raskin. Acacia+, a tool for LTL synthesis. In Madhusudan and Seshia (2012), pages ISBN Rüdiger Ehlers. Unbeast: Symbolic bounded synthesis. In Parosh Aziz Abdulla and K. Rustan M. Leino, editors, TACAS, volume 6605 of Lecture Notes in Computer Science, pages Springer, ISBN Rüdiger Ehlers. ACTL LTL synthesis. In Madhusudan and Seshia (2012), pages ISBN Emmanuel Filiot, Naiyong Jin, and Jean-François Raskin. An antichain algorithm for LTL realizability. In Ahmed Bouajjani and Oded Maler, editors, CAV, volume 5643 of Lecture Notes in Computer Science, pages Springer, ISBN Exercise: Rüdiger Ehlers (UCB/Cornell) Reactive Synthesis Berkeley, 13 th June / 10
14 References II Barbara Jobstmann and Roderick Bloem. Optimizations for LTL synthesis. In FMCAD, pages IEEE Computer Society, ISBN Orna Kupferman and Moshe Y. Vardi. Safraless decision procedures. In FOCS, pages IEEE Computer Society, ISBN P. Madhusudan and Sanjit A. Seshia, editors. Computer Aided Verification - 24th International Conference, CAV 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings, volume 7358 of Lecture Notes in Computer Science, Springer. ISBN Amir Pnueli, Yaniv Sa ar, and Lenore D. Zuck. Jtlv: A framework for developing verification algorithms. In Touili et al. (2010), pages ISBN Sven Schewe and Bernd Finkbeiner. Bounded synthesis. In Kedar S. Namjoshi, Tomohiro Yoneda, Teruo Higashino, and Yoshio Okamura, editors, ATVA, volume 4762 of Lecture Notes in Computer Science, pages Springer, ISBN Exercise: Rüdiger Ehlers (UCB/Cornell) Reactive Synthesis Berkeley, 13 th June / 10
15 References III Tayssir Touili, Byron Cook, and Paul Jackson, editors. Computer Aided Verification, 22nd International Conference, CAV 2010, Edinburgh, UK, July 15-19, Proceedings, volume 6174 of Lecture Notes in Computer Science, Springer. ISBN Exercise: Rüdiger Ehlers (UCB/Cornell) Reactive Synthesis Berkeley, 13 th June / 10
Program Synthesis is a Game
Program Synthesis is a Game Barbara Jobstmann CNRS/Verimag, Grenoble, France Outline Synthesis using automata- based game theory. MoBvaBon, comparison with MC and LTL. Basics Terminology Reachability/Safety
More informationUsing Patterns and Composite Propositions to Automate the Generation of Complex LTL
University of Texas at El Paso DigitalCommons@UTEP Departmental Technical Reports (CS) Department of Computer Science 8-1-2007 Using Patterns and Composite Propositions to Automate the Generation of Complex
More informationDoomsday Equilibria for Games on Graphs
Doomsday Equilibria for Games on Graphs Krishnendu Chatterjee Laurent Doyen IST Austria LSV, ENS Cachan & CNRS Emmanuel Filiot Jean-François Raskin Université Libre de ruxelles U.L.. Two-player games on
More informationBeyond Hyper-Minimisation Minimising DBAs and DPAs is NP-Complete
Beyond Hyper-Minimisation Minimising DBAs and DPAs is NP-Complete Sven Schewe University of Liverpool Abstract In this paper we study the problem of minimising deterministic automata over finite and infinite
More informationOn the Modeling and Verification of Security-Aware and Process-Aware Information Systems
On the Modeling and Verification of Security-Aware and Process-Aware Information Systems 29 August 2011 What are workflows to us? Plans or schedules that map users or resources to tasks Such mappings may
More informationSOFTWARE SYSTEM RELIABILITY AND SECURITY
SOFTWARE SYSTEM RELIABILITY AND SECURITY NATO Security through Science Series This Series presents the results of scientific meetings supported under the NATO Programme for Security through Science (STS).
More informationFormal Verification Coverage: Computing the Coverage Gap between Temporal Specifications
Formal Verification Coverage: Computing the Coverage Gap between Temporal Specifications Sayantan Das Prasenjit Basu Ansuman Banerjee Pallab Dasgupta P.P. Chakrabarti Department of Computer Science & Engineering
More informationT-79.186 Reactive Systems: Introduction and Finite State Automata
T-79.186 Reactive Systems: Introduction and Finite State Automata Timo Latvala 14.1.2004 Reactive Systems: Introduction and Finite State Automata 1-1 Reactive Systems Reactive systems are a class of software
More informationAutomatic Security Analysis of Business Processes
Automatic Security Analysis of Business Processes Daniel Ricardo dos Santos 1,2 Advisors: Silvio Ranise 1 Luca Compagna 2 Serena Ponta 2 1 Security and Trust - FBK 2 SAP Labs France October 21st, 2014
More informationFormal Verification and Linear-time Model Checking
Formal Verification and Linear-time Model Checking Paul Jackson University of Edinburgh Automated Reasoning 21st and 24th October 2013 Why Automated Reasoning? Intellectually stimulating and challenging
More informationAutomata-based Verification - I
CS3172: Advanced Algorithms Automata-based Verification - I Howard Barringer Room KB2.20: email: howard.barringer@manchester.ac.uk March 2006 Supporting and Background Material Copies of key slides (already
More informationFormal Specification and Verification
Formal Specification and Verification Stefan Ratschan Katedra číslicového návrhu Fakulta informačních technologíı České vysoké učení technické v Praze 2. 5. 2011 Stefan Ratschan (FIT ČVUT) PI-PSC 4 2.
More informationAn Active Packet can be classified as
Mobile Agents for Active Network Management By Rumeel Kazi and Patricia Morreale Stevens Institute of Technology Contact: rkazi,pat@ati.stevens-tech.edu Abstract-Traditionally, network management systems
More informationGameTime: A Toolkit for Timing Analysis of Software
GameTime: A Toolkit for Timing Analysis of Software Sanjit A. Seshia and Jonathan Kotker EECS Department, UC Berkeley {sseshia,jamhoot}@eecs.berkeley.edu Abstract. Timing analysis is a key step in the
More informationCurriculum Vitae. Thomas A. Henzinger. November 24, 2008
Curriculum Vitae Thomas A. Henzinger November 24, 2008 Coordinates Computer and Communication Sciences (IC) Phone: EPFL Station 14 Fax: CH-1015 Lausanne Email: Switzerland Web: mtc.epfl.ch/ tah Research
More informationOn Omega-Languages Defined by Mean-Payoff Conditions
On Omega-Languages Defined by Mean-Payoff Conditions Rajeev Alur 1, Aldric Degorre 2, Oded Maler 2, Gera Weiss 1 1 Dept. of Computer and Information Science, University of Pennsylvania, USA {alur, gera}@cis.upenn.edu
More informationRepair of Boolean Programs with an Application to C
Repair of Boolean Programs with an Application to C Andreas Griesmayer 1, Roderick Bloem 1, and Byron Cook 2 1 Graz University of Technology 2 Microsoft Research Abstract. We show how to find and fix faults
More informationHow To Prove That A Program Is Terminating
I N F O R M A T I K Software Model Checking of Liveness Properties via Transition Invariants Andreas Podelski Andrey Rybalchenko MPI I 2003 2 004 December 2003 FORSCHUNGSBERICHT RESEARCH REPORT M A X -
More informationInvGen: An Efficient Invariant Generator
InvGen: An Efficient Invariant Generator Ashutosh Gupta and Andrey Rybalchenko Max Planck Institute for Software Systems (MPI-SWS) Abstract. In this paper we present InvGen, an automatic linear arithmetic
More informationModel Checking: An Introduction
Announcements Model Checking: An Introduction Meeting 2 Office hours M 1:30pm-2:30pm W 5:30pm-6:30pm (after class) and by appointment ECOT 621 Moodle problems? Fundamentals of Programming Languages CSCI
More informationDr Nir Piterman. M.Sc. in the department of Computer Science and Applied Mathematics
Dr Nir Piterman Coordinates Email: firstname.lastname@gmail.com Homepage: www.cs.le.ac.uk/people/np183 Phone: +44-XXXX-XXXXXX / +44-XX-XXXX-XXXX Top flat 105 Oxford Road Cambridge, CB4 3PJ, UK Research
More informationTwo-Way Traceability and Conflict Debugging for AspectLTL Programs
Two-Way Traceability and Conflict Debugging for AspectLTL Programs Shahar Maoz RWTH Aachen University, Germany maoz@se-rwth.de Yaniv Sa ar Weizmann Institute of Science, Israel yaniv.saar@weizmann.ac.il
More informationRegular Linear Temporal Logic with Past
Regular Linear Temporal Logic with Past César Sánchez 1,2 and Martin Leucker 3 1 Madrid Institute for Advanced Studies (IMDEA Software), Spain 2 Spanish Council for Scientific Research (CSIC), Spain 3
More informationConstructing Automata from Temporal Logic Formulas : A Tutorial
Constructing Automata from Temporal Logic Formulas : A Tutorial Pierre Wolper Université de Liège, Institut Montefiore, B28, 4000 Liège, Belgium pw@montefiore.ulg.ac.be, http://www.montefiore.ulg.ac.be/~pw/
More informationSample Configuration Using the ip nat outside source static
Sample Configuration Using the ip nat outside source static Table of Contents Sample Configuration Using the ip nat outside source static Command...1 Introduction...1 Before You Begin...1 Conventions...1
More informationTable-based Software Designs: Bounded Model Checking and Counterexample Tracking
Table-based Software Designs: Bounded Model Checking and Counterexample Tracking Noriyuki Katahira 1, Weiqiang Kong 1, Wanpeng Qian 1, Masahiko Watanabe 2, Tetsuro Katayama 3, Akira Fukuda 4 1 Fukuoka
More informationFoREnSiC An Automatic Debugging Environment for C Programs
FoREnSiC An Automatic Debugging Environment for C Programs Roderick Bloem 1, Rolf Drechsler 2, Görschwin Fey 2, Alexander Finder 2, Georg Hofferek 1, Robert Könighofer 1, Jaan Raik 3, Urmas Repinski 3,
More informationFeature Specification and Automated Conflict Detection
Feature Specification and Automated Conflict Detection AMY P. FELTY University of Ottawa and KEDAR S. NAMJOSHI Bell Laboratories Large software systems, especially in the telecommunications field, are
More informationSoftware Verification: Infinite-State Model Checking and Static Program
Software Verification: Infinite-State Model Checking and Static Program Analysis Dagstuhl Seminar 06081 February 19 24, 2006 Parosh Abdulla 1, Ahmed Bouajjani 2, and Markus Müller-Olm 3 1 Uppsala Universitet,
More informationSoftware Modeling and Verification
Software Modeling and Verification Alessandro Aldini DiSBeF - Sezione STI University of Urbino Carlo Bo Italy 3-4 February 2015 Algorithmic verification Correctness problem Is the software/hardware system
More informationGenet A tool for the synthesis and mining of Petri nets. Josep Carmona jcarmonalsi.upc.edu Software Department Universitat Politcnica de Catalunya
Genet A tool for the synthesis and mining of Petri nets Josep Carmona jcarmonalsi.upc.edu Software Department Universitat Politcnica de Catalunya 2 Contents 1.1 Overview of the tool.......................
More informationModel Checking based Software Verification
Model Checking based Software Verification 18.5-2006 Keijo Heljanko Keijo.Heljanko@tkk.fi Department of Computer Science and Engineering Helsinki University of Technology http://www.tcs.tkk.fi/~kepa/ 1/24
More informationVerification of multiagent systems via ordered binary decision diagrams: an algorithm and its implementation
Verification of multiagent systems via ordered binary decision diagrams: an algorithm and its implementation Franco Raimondi Alessio Lomuscio Department of Computer Science King s College London London
More informationFrom Control Loops to Software
CNRS-VERIMAG Grenoble, France October 2006 Executive Summary Embedded systems realization of control systems by computers Computers are the major medium for realizing controllers There is a gap between
More informationFormal Verification by Model Checking
Formal Verification by Model Checking Natasha Sharygina Carnegie Mellon University Guest Lectures at the Analysis of Software Artifacts Class, Spring 2005 1 Outline Lecture 1: Overview of Model Checking
More informationSoftware Verification and Testing. Lecture Notes: Temporal Logics
Software Verification and Testing Lecture Notes: Temporal Logics Motivation traditional programs (whether terminating or non-terminating) can be modelled as relations are analysed wrt their input/output
More informationMONPOLY: Monitoring Usage-control Policies
MONPOLY: Monitoring Usage-control Policies David Basin, Matúš Harvan, Felix Klaedtke, and Eugen Zălinescu Computer Science Department, ETH Zurich, Switzerland 1 Introduction Determining whether the usage
More informationModel Checking of Software
Model Checking of Software Patrice Godefroid Bell Laboratories, Lucent Technologies SpecNCheck Page 1 August 2001 A Brief History of Model Checking Prehistory: transformational programs and theorem proving
More informationStylianos Basagiannis
Interlocking control by Distributed Signal Boxes Technical Report (TR) 4 Stylianos Basagiannis Supervisors: Dr Andrew Pombortsis, Dr Panagiotis Katsaros Aristotle University of Thessaloniki Department
More informationhttps://sites.google.com/a/asu.edu/cse-522-spring-12/ sensors and actuators? How do we handle the errors introduced due to noise, quantization etc?
CSE 522 Spring 12 https://sites.google.com/a/asu.edu/cse-522-spring-12/ 1 of 3 5/29/2012 16:56 CSE 522 Spring 12 Navigation CSE522: Real-Time Embedded Systems The Schedule Sitemap CSE522: Real-Time Embedded
More informationCommunication Networks. MAP-TELE 2011/12 José Ruela
Communication Networks MAP-TELE 2011/12 José Ruela Network basic mechanisms Network Architectures Protocol Layering Network architecture concept A network architecture is an abstract model used to describe
More informationMechanizing the Powerset Construction for Restricted Classes of ω-automata
Mechanizing the Powerset Construction for Restricted Classes of ω-automata Christian Dax 1, Jochen Eisinger 2, Felix Klaedtke 1 1 ETH Zurich 2 Albert-Ludwigs-University of Freiburg ATVA 2007 Motivation
More informationDecentralised LTL monitoring
Decentralised LTL monitoring Andreas Bauer 1 and Yliès Falcone 2 1 NICTA Software Systems Research Group and Australian National University 2 Laboratoire d Informatique de Grenoble, UJF Université Grenoble
More informationEECS 294-98: Formal Methods for Engineering Education. Sanjit A. Seshia EECS, UC Berkeley
EECS 294-98: Formal Methods for Engineering Education Sanjit A. Seshia EECS, UC Berkeley Engineering Education (recent past) On-campus experience Instructor lectures / discusses in class Students listen
More informationFrom Electronic Design Automation to NDA: Treating Networks like Chips or Programs
From Electronic Design Automation to NDA: Treating Networks like Chips or Programs George Varghese With Collaborators at Berkeley, Cisco, MSR, Stanford Networks today SQL 1001 10* P1 1* P2 Drop SQL,P2
More informationChecking MTL Properties of Discrete Timed Automata via Bounded Model Checking
Checing MTL Properties of Discrete Timed Automata via Bounded Model Checing Extended Abstract Bożena Woźna-Szcześnia and Andrzej Zbrzezny IMCS, Jan D lugosz University. Al. Armii Krajowej 13/15, 42-200
More informationLow-Level Verification of Embedded Software: Addressing the Challenge
Low-Level Verification of Embedded Software: Addressing the Challenge Sanjit A. Seshia Assistant Professor EECS, UC Berkeley FMCAD 2010 Panel October 2010 Abstraction Layers in Computing Algorithms, Protocols,
More informationRuntime Verification - Monitor-oriented Programming - Monitor-based Runtime Reflection
Runtime Verification - Monitor-oriented Programming - Monitor-based Runtime Reflection Martin Leucker Technische Universität München (joint work with Andreas Bauer, Christian Schallhart et. al) FLACOS
More informationThe Course. http://www.cse.unsw.edu.au/~cs3153/
The Course http://www.cse.unsw.edu.au/~cs3153/ Lecturers Dr Peter Höfner NICTA L5 building Prof Rob van Glabbeek NICTA L5 building Dr Ralf Huuck NICTA ATP building 2 Plan/Schedule (1) Where and When Tuesday,
More informationDuncan McCaffery. Personal homepage URL: http://info.comp.lancs.ac.uk/computing/staff/person.php?member_id=140
Name: Institution: PhD thesis submission date: Duncan McCaffery Lancaster University, UK Not yet determined Personal homepage URL: http://info.comp.lancs.ac.uk/computing/staff/person.php?member_id=140
More informationRuntime Enforcement of Timed Properties
Runtime Enforcement of Timed Properties Srinivas Pinisetty 1,Yliès Falcone 2, Thierry Jéron 1, Hervé Marchand 1, Antoine Rollet 3 and Omer Nguena Timo 3 INRIA Rennes - Bretagne Atlantique, France LIG,
More informationSanity Checks in Formal Verification
Sanity Checks in Formal Verification Orna Kupferman Hebrew University, School of Engineering and Computer Science, Jerusalem 91904, Israel Email:orna@cs.huji.ac.il, URL: http://www.cs.huji.ac.il/ orna
More informationhttp://aejm.ca Journal of Mathematics http://rema.ca Volume 1, Number 1, Summer 2006 pp. 69 86
Atlantic Electronic http://aejm.ca Journal of Mathematics http://rema.ca Volume 1, Number 1, Summer 2006 pp. 69 86 AUTOMATED RECOGNITION OF STUTTER INVARIANCE OF LTL FORMULAS Jeffrey Dallien 1 and Wendy
More informationSystem Reconfigurability Of Modern Workflows - A Review
Applied Mathematical Sciences, Vol. 8, 2014, no. 172, 8581-8600 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.410816 LTL-based Verification of Reconfigurable Workflows Manuel Mazzara
More informationOptimised Realistic Test Input Generation
Optimised Realistic Test Input Generation Mustafa Bozkurt and Mark Harman {m.bozkurt,m.harman}@cs.ucl.ac.uk CREST Centre, Department of Computer Science, University College London. Malet Place, London
More informationLecture Objectives. Lecture 07 Mobile Networks: TCP in Wireless Networks. Agenda. TCP Flow Control. Flow Control Can Limit Throughput (1)
Lecture Objectives Wireless and Mobile Systems Design Lecture 07 Mobile Networks: TCP in Wireless Networks Describe TCP s flow control mechanism Describe operation of TCP Reno and TCP Vegas, including
More informationProgram Monitoring with LTL in EAGLE
Howard Barringer University of Manchester, England Program Monitoring with LTL in EAGLE Allen Goldberg, Klaus Havelund Kestrel Technology, NASA Ames Research Center, USA Koushik Sen University of Illinois,
More informationBüchi Complementation Made Tighter
International Journal of Foundations of Computer Science c World Scientific Publishing Company Büchi Complementation Made Tighter Ehud Friedgut Hebrew University, Institute of Mathematics, Jerusalem 91904,
More informationSymbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking
Int J Softw Tools Technol Transfer (20) 3:39 335 DOI.7/s9-0-068-4 REGULAR PAPER Symbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking Roberto Sebastiani Stefano Tonetta
More informationFirewall Verification and Redundancy Checking are Equivalent
Firewall Verification and Redundancy Checking are Equivalent H. B. Acharya University of Texas at Austin acharya@cs.utexas.edu M. G. Gouda National Science Foundation University of Texas at Austin mgouda@nsf.gov
More informationA Framework of Context-Sensitive Visualization for User-Centered Interactive Systems
Proceedings of 10 th International Conference on User Modeling, pp423-427 Edinburgh, UK, July 24-29, 2005. Springer-Verlag Berlin Heidelberg 2005 A Framework of Context-Sensitive Visualization for User-Centered
More informationAutomated Route Planning for Milk-Run Transport Logistics with the NuSMV Model Checker
IEICE TRANS. INF. & SYST., VOL.E96 D, NO.12 DECEMBER 2013 2555 PAPER Special Section on Parallel and Distributed Computing and Networking Automated Route Planning for Milk-Run Transport Logistics with
More informationConstruction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL
Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL Alexander Schimpf 1, Stephan Merz 2, and Jan-Georg Smaus 1 1 University of Freiburg, Germany, {schimpfa smaus}@informatik.uni-freiburg.de
More informationVincent Cheval. Curriculum Vitae. Research
Vincent Cheval School of Computing University of Kent Canterbury, CT2 7NF, UK +44 (0)7479 555701 +44 (0)1227 823816 vincent.cheval@icloud.com homepage: www.cs.kent.ac.uk/ vc218/web Nationality : French
More informationTemporal Logics. Computation Tree Logic
Temporal Logics CTL: definition, relationship between operators, adequate sets, specifying properties, safety/liveness/fairness Modeling: sequential, concurrent systems; maximum parallelism/interleaving
More informationNetwork (Tree) Topology Inference Based on Prüfer Sequence
Network (Tree) Topology Inference Based on Prüfer Sequence C. Vanniarajan and Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai 600036 vanniarajanc@hcl.in,
More informationLecture 2.1 : The Distributed Bellman-Ford Algorithm. Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol
Lecture 2 : The DSDV Protocol Lecture 2.1 : The Distributed Bellman-Ford Algorithm Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol The Routing Problem S S D D The routing problem
More informationAdministrative Issues
CSC 3210 Computer Organization and Programming Introduction and Overview Dr. Anu Bourgeois (modified by Yuan Long) Administrative Issues Required Prerequisites CSc 2010 Intro to CSc CSc 2310 Java Programming
More informationStochastic Protocol Modeling for Anomaly-Based Network Intrusion Detection
2003 IEEE International Workshop on Information Assurance March 24th, 2003 Darmstadt, Germany Stochastic Protocol Modeling for Anomaly-Based Network Intrusion Detection Juan M. Estévez-Tapiador (tapiador@ugr.es)
More informationSample Configuration Using the ip nat outside source list C
Sample Configuration Using the ip nat outside source list C Table of Contents Sample Configuration Using the ip nat outside source list Command...1 Introduction...1 Before You Begin...1 Conventions...1
More informationRuntime Verification for LTL and TLTL
Runtime Verification for LTL and TLTL ANDREAS BAUER NICTA and Australian National University MARTIN LEUCKER Technische Universität München and CHRISTIAN SCHALLHART Technische Universität Darmstadt This
More informationJ-Sim: An Integrated Environment for Simulation and Model Checking of Network Protocols
J-Sim: An Integrated Environment for Simulation and Model Checking of Network Protocols Ahmed Sobeih, Mahesh Viswanathan, Darko Marinov and Jennifer C. Hou Department of Computer Science University of
More informationHIGH DENSITY DATA STORAGE IN DNA USING AN EFFICIENT MESSAGE ENCODING SCHEME Rahul Vishwakarma 1 and Newsha Amiri 2
HIGH DENSITY DATA STORAGE IN DNA USING AN EFFICIENT MESSAGE ENCODING SCHEME Rahul Vishwakarma 1 and Newsha Amiri 2 1 Tata Consultancy Services, India derahul@ieee.org 2 Bangalore University, India ABSTRACT
More informationSoftware Model Checking: Theory and Practice
Software Model Checking: Theory and Practice Lecture: Secification Checking - Temoral Logic Coyright 2004, Matt Dwyer, John Hatcliff, and Robby. The syllabus and all lectures for this course are coyrighted
More informationThe Model Checker SPIN
The Model Checker SPIN Author: Gerard J. Holzmann Presented By: Maulik Patel Outline Introduction Structure Foundation Algorithms Memory management Example/Demo SPIN-Introduction Introduction SPIN (Simple(
More informationPROTECTING NETWORKS WITH FIREWALLS
83-10-44 DATA SECURITY MANAGEMENT PROTECTING NETWORKS WITH FIREWALLS Gilbert Held INSIDE Connecting to the Internet; Router Packet Filtering; Firewalls; Address Hiding; Proxy Services; Authentication;
More informationModel Checking II Temporal Logic Model Checking
1/32 Model Checking II Temporal Logic Model Checking Edmund M Clarke, Jr School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 2/32 Temporal Logic Model Checking Specification Language:
More informationBuilding SMT-based Software Model Checkers: an Experience Report
Building SMT-based Software Model Checkers: an Experience Report Alessandro Armando Artificial Intelligence Laboratory (AI-Lab) Dipartimento di Informatica Sistemistica e Telematica (DIST) University of
More informationFrom Workflow Design Patterns to Logical Specifications
AUTOMATYKA/ AUTOMATICS 2013 Vol. 17 No. 1 http://dx.doi.org/10.7494/automat.2013.17.1.59 Rados³aw Klimek* From Workflow Design Patterns to Logical Specifications 1. Introduction Formal methods in software
More informationFirewall Policy Anomalies- Detection and Resolution
Firewall Policy Anomalies- Detection and Resolution Jitha C K #1, Sreekesh Namboodiri *2 #1 MTech student(cse),mes College of Engineering,Kuttippuram,India #2 Assistant Professor(CSE),MES College of Engineering,Kuttippuram,India
More informationDesign and Verification of Nine port Network Router
Design and Verification of Nine port Network Router G. Sri Lakshmi 1, A Ganga Mani 2 1 Assistant Professor, Department of Electronics and Communication Engineering, Pragathi Engineering College, Andhra
More informationDesign, Specification, and Synthesis of Aircraft Electric Power Systems Control Logic
Design, Specification, and Synthesis of Aircraft Electric Power Systems Control Logic Thesis by Huan Xu In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute
More informationAssertion Synthesis Enabling Assertion-Based Verification For Simulation, Formal and Emulation Flows
Assertion Synthesis Enabling Assertion-Based Verification For Simulation, Formal and Emulation Flows Manual Assertion Creation is ABV Bottleneck Assertion-Based Verification adopted by leading design companies
More informationOptimal Scheduling. Kim G. Larsen DENMARK
Priced Timed Automata Optimal Scheduling Kim G. Larsen Aalborg University it DENMARK Overview Timed Automata Scheduling Priced Timed Automata Optimal Reachability Optimal Infinite Scheduling Multi Objectives
More informationSoftware Active Online Monitoring Under. Anticipatory Semantics
Software Active Online Monitoring Under Anticipatory Semantics Changzhi Zhao, Wei Dong, Ji Wang, Zhichang Qi National Laboratory for Parallel and Distributed Processing P.R.China 7/21/2009 Overview Software
More informationA WEB-BASED TRAFFIC INFORMATION SYSTEM USING WIRELESS COMMUNICATION TECHNIQUES
Advanced OR and AI Methods in Transportation A WEB-BASED TRAFFIC INFORMATION SYSTEM USING WIRELESS COMMUNICATION TECHNIQUES Akmal ABDELFATAH 1, Abdul-Rahman AL-ALI 2 Abstract. This paper presents a procedure
More informationIntroduction to Software Verification
Introduction to Software Verification Orna Grumberg Lectures Material winter 2013-14 Lecture 4 5.11.13 Model Checking Automated formal verification: A different approach to formal verification Model Checking
More informationMultiagent Control of Traffic Signals Vision Document 2.0. Vision Document. For Multiagent Control of Traffic Signals. Version 2.0
Vision Document For Multiagent Control of Traffic Signals Version 2.0 Submitted in partial fulfillment of the requirements of the degree of MSE Bryan Nehl CIS 895 MSE Project Kansas State University Page
More informationBRAESS-LIKE PARADOXES FOR NON-COOPERATIVE DYNAMIC LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS
GESJ: Computer Science and Telecommunications 21 No.3(26) BRAESS-LIKE PARADOXES FOR NON-COOPERATIVE DYNAMIC LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS Said Fathy El-Zoghdy Department of Computer Science,
More informationToday s Agenda. Automata and Logic. Quiz 4 Temporal Logic. Introduction Buchi Automata Linear Time Logic Summary
Today s Agenda Quiz 4 Temporal Logic Formal Methods in Software Engineering 1 Automata and Logic Introduction Buchi Automata Linear Time Logic Summary Formal Methods in Software Engineering 2 1 Buchi Automata
More informationTest Case Generation for Ultimately Periodic Paths Joint work with Saddek Bensalem Hongyang Qu Stavros Tripakis Lenore Zuck Accepted to HVC 2007 How to find the condition to execute a path? (weakest precondition
More informationThe Interoperability of Wireless Sensor Networks
The Interoperability of Wireless Sensor Networks Daniela Ballari, Miguel Angel Manso-Callejo, Monica Wachowicz Technical University of Madrid daniela@topografia.upm.es; m.manso@upm.es; m.wachowicz@topografia.upm.es
More information(Enabling Technologies for Transport Efficiencies)
Research project ETTE (Enabling Technologies for Transport Efficiencies) FFI TrpEff - projektdag Presenter:, torbjorn.e.andersson@volvocars.com Datum: 24 September 2013 Global Marketing, Richard Monturo,
More informationPractical Programming, 2nd Edition
Extracted from: Practical Programming, 2nd Edition An Introduction to Computer Science Using Python 3 This PDF file contains pages extracted from Practical Programming, 2nd Edition, published by the Pragmatic
More informationCONTROL CODE GENERATOR USED FOR CONTROL EXPERIMENTS IN SHIP SCALE MODEL
CONTROL CODE GENERATOR USED FOR CONTROL EXPERIMENTS IN SHIP SCALE MODEL Polo, O. R. (1), Esteban, S. (2), Maron, A. (3), Grau, L. (4), De la Cruz, J.M. (2) (1) Dept Arquitectura de Computadores y Automatica.
More informationMetaGame: An Animation Tool for Model-Checking Games
MetaGame: An Animation Tool for Model-Checking Games Markus Müller-Olm 1 and Haiseung Yoo 2 1 FernUniversität in Hagen, Fachbereich Informatik, LG PI 5 Universitätsstr. 1, 58097 Hagen, Germany mmo@ls5.informatik.uni-dortmund.de
More informationTesting LTL Formula Translation into Büchi Automata
Testing LTL Formula Translation into Büchi Automata Heikki Tauriainen and Keijo Heljanko Helsinki University of Technology, Laboratory for Theoretical Computer Science, P. O. Box 5400, FIN-02015 HUT, Finland
More informationSignature Region of Interest using Auto cropping
ISSN (Online): 1694-0784 ISSN (Print): 1694-0814 1 Signature Region of Interest using Auto cropping Bassam Al-Mahadeen 1, Mokhled S. AlTarawneh 2 and Islam H. AlTarawneh 2 1 Math. And Computer Department,
More information