var bibbase_data = {"data":"<img src=\"//bibbase.org/img/ajax-loader.gif\" id=\"spinner\"\n  style=\"display: none;\" alt=\"Loading..\" />\n\n<div id=\"bibbase\">\n\n  <script type=\"text/javascript\">\n    var bibbase = {\n      params: {\"bib\":\"https://franck44.github.io/publications/franck-pubs.bib\",\"jsonp\":\"1\",\"host\":\"bibbase.org\"},\n      data: [{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Joanne\"],\"propositions\":[],\"lastnames\":[\"Fuller\"],\"suffixes\":[]},{\"firstnames\":[\"Milad\"],\"propositions\":[],\"lastnames\":[\"Ketabi\"],\"suffixes\":[]},{\"firstnames\":[\"David\"],\"propositions\":[],\"lastnames\":[\"Pearce\"],\"suffixes\":[]},{\"firstnames\":[\"Horacio\",\"Mijail\",\"Anton\"],\"propositions\":[],\"lastnames\":[\"Quiles\"],\"suffixes\":[]}],\"title\":\"Formal and Executable Semantics of the EVM in Dafny\",\"booktitle\":\"International Symposium on Formal Methods (FM'23)\",\"xxpages\":\"445-462\",\"year\":\"2023\",\"series\":\"Lecture Notes in Computer Science\",\"xxxvolume\":\"13047\",\"publisher\":\"Springer\",\"note\":\"Forthcoming.\",\"urlxx\":\"\",\"xxxdoi\":\"http://doi.org/10.1007/978-3-030-90870-6 24\",\"urlpaper\":\"papers/dafnyevm-fm-23.pdf\",\"abstract\":\"The Ethereum protocol implements a replicated state machine. The network participants keep track of the system state by: 1) agreeing on the sequence of transactions to be processed and 2) computing the state transitions that correspond to the sequence of transactions. Ethereum transactions are programs, called smart contracts, and computing a state transition requires executing some code. The Ethereum Virtual Machine (EVM) provides this capability and can execute programs written in EVM bytecode. We present a formal and executable semantics of the EVM written in the verification-friendly language Dafny: it provides (i) a readable, formal and verified specification of the semantics of the EVM; (ii) a framework to formally reason about bytecode.\",\"bibtex\":\"@inproceedings{dafnyevm-fm-23,\\n  author    = {Franck Cassez and\\n               Joanne Fuller and Milad Ketabi and David Pearce and \\n               Horacio Mijail Anton Quiles},\\n  title     = {Formal and Executable Semantics of the EVM in Dafny},\\n  booktitle = {International Symposium on Formal Methods (FM'23)},\\n  xxpages     = {445-462},\\n  year      = {2023},\\n  series    = {Lecture Notes in Computer Science},\\n  xxxvolume    = {13047},\\n  publisher = {Springer},  \\n  note        = {Forthcoming.},\\n  urlxx       = {},\\n  xxxdoi       = {http://doi.org/10.1007/978-3-030-90870-6 24},\\n\\n  urlpaper = {papers/dafnyevm-fm-23.pdf},\\n  abstract = {The Ethereum protocol implements a replicated state machine. The network participants keep track of the system state by: 1) agreeing on the sequence of transactions to be processed and 2) computing the state transitions that correspond to the sequence of transactions. Ethereum transactions are programs, called smart contracts, and computing a state transition requires executing some code. The Ethereum Virtual Machine (EVM) provides this capability and can execute programs written in EVM bytecode. We present a formal and executable semantics of the EVM written in the verification-friendly language Dafny: it provides (i) a readable, formal and verified specification of the semantics of the EVM; (ii) a framework to formally reason about bytecode.}\\n}\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Fuller, J.\",\"Ketabi, M.\",\"Pearce, D.\",\"Quiles, H. M. A.\"],\"key\":\"dafnyevm-fm-23\",\"id\":\"dafnyevm-fm-23\",\"bibbaseid\":\"cassez-fuller-ketabi-pearce-quiles-formalandexecutablesemanticsoftheevmindafny-2023\",\"role\":\"author\",\"urls\":{\"Xx\":\"https://franck44.github.io/publications/franck-pubs.bib\",\"Paper\":\"https://franck44.github.io/publications/papers/dafnyevm-fm-23.pdf\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"downloads\":9,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Joanne\"],\"propositions\":[],\"lastnames\":[\"Fuller\"],\"suffixes\":[]},{\"firstnames\":[\"Horacio\",\"Mijail\",\"Anton\"],\"propositions\":[],\"lastnames\":[\"Quiles\"],\"suffixes\":[]}],\"editor\":[{\"firstnames\":[\"Jan\",\"Friso\"],\"propositions\":[],\"lastnames\":[\"Groote\"],\"suffixes\":[]},{\"firstnames\":[\"Marieke\"],\"propositions\":[],\"lastnames\":[\"Huisman\"],\"suffixes\":[]}],\"title\":\"Deductive Verification of Smart Contracts with Dafny\",\"booktitle\":\"Formal Methods for Industrial Critical Systems - 27th International Conference, FMICS 2022, Warsaw, Poland, September 14-15, 2022, Proceedings\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"13487\",\"pages\":\"50–66\",\"publisher\":\"Springer\",\"year\":\"2022\",\"url\":\"https://doi.org/10.1007/978-3-031-15008-1\\\\_5\",\"doi\":\"10.1007/978-3-031-15008-1_5\",\"timestamp\":\"Sat, 10 Sep 2022 20:58:36 +0200\",\"biburl\":\"https://dblp.org/rec/conf/fmics/CassezFQ22.bib\",\"bibsource\":\"dblp computer science bibliography, https://dblp.org\",\"note\":\"FMICS Best Paper Award\",\"abstract\":\"We present a methodology to develop verified smart contracts. We write smart contracts, their specifications and implementations in the verification-friendly language DAFNY. In our methodology the ability to write specifications, implementations and to reason about correctness is a primary concern. We propose a simple, concise yet powerful solution to reasoning about contracts that have external calls. This includes arbitrary re-entrancy which is a major source of bugs and attacks in smart contracts. Although we do not yet have a compiler from DAFNY to EVM bytecode, the results we obtain on the DAFNY code can reasonably be assumed to hold on Solidity code: the translation of the DAFNY code to Solidity is straightforward. As a result our approach can readily be used to develop and deploy safer contracts. \",\"bibtex\":\"@inproceedings{DBLP:conf/fmics/CassezFQ22,\\n  author    = {Franck Cassez and\\n               Joanne Fuller and\\n               Horacio Mijail Anton Quiles},\\n  editor    = {Jan Friso Groote and\\n               Marieke Huisman},\\n  title     = {Deductive Verification of Smart Contracts with Dafny},\\n  booktitle = {Formal Methods for Industrial Critical Systems - 27th International\\n               Conference, {FMICS} 2022, Warsaw, Poland, September 14-15, 2022, Proceedings},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {13487},\\n  pages     = {50--66},\\n  publisher = {Springer},\\n  year      = {2022},\\n  url       = {https://doi.org/10.1007/978-3-031-15008-1\\\\_5},\\n  doi       = {10.1007/978-3-031-15008-1\\\\_5},\\n  timestamp = {Sat, 10 Sep 2022 20:58:36 +0200},\\n  biburl    = {https://dblp.org/rec/conf/fmics/CassezFQ22.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org},\\n  note            = {FMICS Best Paper Award},\\n  abstract = {\\n    We present a methodology to develop verified smart contracts. We write smart contracts, their specifications and implementations in the verification-friendly language DAFNY. In our methodology the ability to write specifications, implementations and to reason about correctness is a primary concern. We propose a simple, concise yet powerful solution to reasoning about contracts that have external calls. This includes arbitrary re-entrancy which is a major source of bugs and attacks in smart contracts. Although we do not yet have a compiler from DAFNY to EVM bytecode, the results we obtain on the DAFNY code can reasonably be assumed to hold on Solidity code: the translation of the DAFNY code to Solidity is straightforward. As a result our approach can readily be used to develop and deploy safer contracts.\\n  }\\n}\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Fuller, J.\",\"Quiles, H. M. A.\"],\"editor_short\":[\"Groote, J. F.\",\"Huisman, M.\"],\"key\":\"DBLP:conf/fmics/CassezFQ22\",\"id\":\"DBLP:conf/fmics/CassezFQ22\",\"bibbaseid\":\"cassez-fuller-quiles-deductiveverificationofsmartcontractswithdafny-2022\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1007/978-3-031-15008-1\\\\_5\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"downloads\":4,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Joanne\"],\"propositions\":[],\"lastnames\":[\"Fuller\"],\"suffixes\":[]},{\"firstnames\":[\"Horacio\",\"Mijail\",\"Anton\"],\"propositions\":[],\"lastnames\":[\"Quiles\"],\"suffixes\":[]}],\"title\":\"Deductive Verification of Smart Contracts with Dafny\",\"journal\":\"CoRR\",\"volume\":\"abs/2208.02920\",\"year\":\"2022\",\"url\":\"https://doi.org/10.48550/arXiv.2208.02920\",\"doi\":\"10.48550/arXiv.2208.02920\",\"eprinttype\":\"arXiv\",\"eprint\":\"2208.02920\",\"timestamp\":\"Wed, 10 Aug 2022 14:49:54 +0200\",\"biburl\":\"https://dblp.org/rec/journals/corr/abs-2208-02920.bib\",\"bibsource\":\"dblp computer science bibliography, https://dblp.org\",\"abstract\":\"We present a methodology to develop verified smart contracts. We write smart contracts, their specifications and implementations in the verification-friendly language DAFNY. In our methodology the ability to write specifications, implementations and to reason about correctness is a primary concern. We propose a simple, concise yet powerful solution to reasoning about contracts that have external calls. This includes arbitrary re-entrancy which is a major source of bugs and attacks in smart contracts. Although we do not yet have a compiler from DAFNY to EVM bytecode, the results we obtain on the DAFNY code can reasonably be assumed to hold on Solidity code: the translation of the DAFNY code to Solidity is straightforward. As a result our approach can readily be used to develop and deploy safer contracts.\",\"bibtex\":\"@article{DBLP:journals/corr/abs-2208-02920,\\n  author    = {Franck Cassez and\\n               Joanne Fuller and\\n               Horacio Mijail Anton Quiles},\\n  title     = {Deductive Verification of Smart Contracts with Dafny},\\n  journal   = {CoRR},\\n  volume    = {abs/2208.02920},\\n  year      = {2022},\\n  url       = {https://doi.org/10.48550/arXiv.2208.02920},\\n  doi       = {10.48550/arXiv.2208.02920},\\n  eprinttype = {arXiv},\\n  eprint    = {2208.02920},\\n  timestamp = {Wed, 10 Aug 2022 14:49:54 +0200},\\n  biburl    = {https://dblp.org/rec/journals/corr/abs-2208-02920.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org},\\n  abstract = {We present a methodology to develop verified smart contracts. We write smart contracts, their specifications and implementations in the verification-friendly language DAFNY. In our methodology the ability to write specifications, implementations and to reason about correctness is a primary concern. We propose a simple, concise yet powerful solution to reasoning about contracts that have external calls. This includes arbitrary re-entrancy which is a major source of bugs and attacks in smart contracts. Although we do not yet have a compiler from DAFNY to EVM bytecode, the results we obtain on the DAFNY code can reasonably be assumed to hold on Solidity code: the translation of the DAFNY code to Solidity is straightforward. As a result our approach can readily be used to develop and deploy safer contracts.}\\n}\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Fuller, J.\",\"Quiles, H. M. A.\"],\"key\":\"DBLP:journals/corr/abs-2208-02920\",\"id\":\"DBLP:journals/corr/abs-2208-02920\",\"bibbaseid\":\"cassez-fuller-quiles-deductiveverificationofsmartcontractswithdafny-2022\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.48550/arXiv.2208.02920\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"downloads\":4,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]}],\"title\":\"Verification of the Incremental Merkle Tree Algorithm with Dafny\",\"booktitle\":\"International Symposium on Formal Methods (FM'21)\",\"pages\":\"445-462\",\"year\":\"2021\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"13047\",\"publisher\":\"Springer\",\"xxxnote\":\"Forthcoming.\",\"urlxx\":\"\",\"doi\":\"http://doi.org/10.1007/978-3-030-90870-6 24\",\"urlpaper\":\"papers/merkle-fm-21.pdf\",\"abstract\":\"The Deposit Smart Contract (DSC) is an instrumental component of the Ethereum 2.0 Phase 0 infrastructure. We have developed the first machine-checkable version of the incremental Merkle tree algorithm used in the DSC. We present our new and original correctness proof of the algorithm along with the Dafny machine-checkable version. The main results are: 1) a new proof of total correctness; 2) a software artefact with the proof in the form of the complete Dafny code base and 3) new provably correct optimisations of the algorithm.\",\"bibtex\":\"@inproceedings{merkle-fm-21,\\n  author    = {Franck Cassez},\\n  title     = {Verification of the Incremental Merkle Tree Algorithm with Dafny},\\n  booktitle = {International Symposium on Formal Methods (FM'21)},\\n  pages     = {445-462},\\n  year      = {2021},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {13047},\\n  publisher = {Springer},  \\n  xxxnote        = {Forthcoming.},\\n  urlxx       = {},\\n  doi       = {http://doi.org/10.1007/978-3-030-90870-6 24},\\n\\n  urlpaper = {papers/merkle-fm-21.pdf},\\n  abstract = {The Deposit Smart Contract (DSC) is an instrumental component of the Ethereum 2.0 Phase 0 infrastructure. We have developed the first machine-checkable version of the incremental Merkle tree algorithm used in the DSC. We present our new and original correctness proof of the algorithm along with the Dafny machine-checkable version. The main results are: 1) a new proof of total correctness; 2) a software artefact with the proof in the form of the complete Dafny code base and 3) new provably correct optimisations of the algorithm.}\\n}\\n\\n\",\"author_short\":[\"Cassez, F.\"],\"key\":\"merkle-fm-21\",\"id\":\"merkle-fm-21\",\"bibbaseid\":\"cassez-verificationoftheincrementalmerkletreealgorithmwithdafny-2021\",\"role\":\"author\",\"urls\":{\"Xx\":\"https://franck44.github.io/publications/franck-pubs.bib\",\"Paper\":\"https://franck44.github.io/publications/papers/merkle-fm-21.pdf\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"downloads\":13,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Joanne\"],\"propositions\":[],\"lastnames\":[\"Fuller\"],\"suffixes\":[]},{\"firstnames\":[\"Aditya\"],\"propositions\":[],\"lastnames\":[\"Asgaonkar\"],\"suffixes\":[]}],\"editor\":[{\"firstnames\":[\"Dana\"],\"propositions\":[],\"lastnames\":[\"Fisman\"],\"suffixes\":[]},{\"firstnames\":[\"Grigore\"],\"propositions\":[],\"lastnames\":[\"Rosu\"],\"suffixes\":[]}],\"title\":\"Formal Verification of the Ethereum 2.0 Beacon Chain\",\"booktitle\":\"Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings, Part I\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"13243\",\"pages\":\"167–182\",\"publisher\":\"Springer\",\"year\":\"2022\",\"url\":\"https://doi.org/10.1007/978-3-030-99524-9\\\\_9\",\"doi\":\"10.1007/978-3-030-99524-9_9\",\"timestamp\":\"Fri, 29 Apr 2022 14:50:36 +0200\",\"biburl\":\"https://dblp.org/rec/conf/tacas/CassezFA22.bib\",\"bibsource\":\"dblp computer science bibliography, https://dblp.org\",\"urlpaper\":\"papers/eth2-tacas-22.pdf\",\"abstract\":\"We report our experience in the formal verification of the reference implementation of the Beacon Chain. The Beacon Chain is the backbone component of the new Proof-of-Stake Ethereum 2.0 network: it is in charge of tracking information about the validators, their stakes, their attestations (votes) and if some validators are found to be dishonest, to slash them (they lose some of their stakes). The Beacon Chain is mission-critical and any bug in it could compromise the whole network. The Beacon Chain reference implementation developed by the Ethereum Foundation is written in Python, and provides a detailed operational description of the state machine each Beacon Chain's network participant (node) must implement. We have formally specified and verified the absence of runtime errors in (a large and critical part of) the Beacon Chain reference implementation using the verification-friendly language Dafny. During the course of this work, we have uncovered several issues, proposed verified fixes. We have also synthesised functional correctness specifications that enable us to provide guarantees beyond runtime errors. Our software artefact with the code and proofs in Dafny is available at ˘rlhttps://github.com/ConsenSys/eth2.0-dafny.\",\"bibtex\":\"@inproceedings{DBLP:conf/tacas/CassezFA22,\\n  author    = {Franck Cassez and\\n               Joanne Fuller and\\n               Aditya Asgaonkar},\\n  editor    = {Dana Fisman and\\n               Grigore Rosu},\\n  title     = {Formal Verification of the Ethereum 2.0 Beacon Chain},\\n  booktitle = {Tools and Algorithms for the Construction and Analysis of Systems\\n               - 28th International Conference, {TACAS} 2022, Held as Part of the\\n               European Joint Conferences on Theory and Practice of Software, {ETAPS}\\n               2022, Munich, Germany, April 2-7, 2022, Proceedings, Part {I}},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {13243},\\n  pages     = {167--182},\\n  publisher = {Springer},\\n  year      = {2022},\\n  url       = {https://doi.org/10.1007/978-3-030-99524-9\\\\_9},\\n  doi       = {10.1007/978-3-030-99524-9\\\\_9},\\n  timestamp = {Fri, 29 Apr 2022 14:50:36 +0200},\\n  biburl    = {https://dblp.org/rec/conf/tacas/CassezFA22.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org},\\n  urlpaper = {papers/eth2-tacas-22.pdf},\\n  abstract = {We report our experience in the formal verification of the reference implementation of the Beacon Chain.\\n  The Beacon Chain is the backbone component of the new Proof-of-Stake Ethereum 2.0 network: it is in charge of tracking \\n  information about the validators,\\n  their stakes, their attestations (votes) and if some validators are found to be dishonest, to slash them (they lose some of their stakes).   \\n  The Beacon Chain is mission-critical and any bug in it could compromise the whole  network.\\n  The Beacon Chain reference implementation developed by the Ethereum Foundation is written in Python, and provides a detailed operational description of the state machine each Beacon Chain's network participant (node) must implement. \\n  We have formally specified and verified the absence of runtime errors in (a large and critical part of) the Beacon Chain reference implementation using the verification-friendly language Dafny.\\n  During the course of this work, we have uncovered several issues, proposed verified fixes.\\n  We have also synthesised functional correctness specifications that enable us to provide guarantees beyond\\n  runtime errors. Our software artefact with the code and proofs in Dafny is available at \\\\url{https://github.com/ConsenSys/eth2.0-dafny}.}\\n}\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Fuller, J.\",\"Asgaonkar, A.\"],\"editor_short\":[\"Fisman, D.\",\"Rosu, G.\"],\"key\":\"DBLP:conf/tacas/CassezFA22\",\"id\":\"DBLP:conf/tacas/CassezFA22\",\"bibbaseid\":\"cassez-fuller-asgaonkar-formalverificationoftheethereum20beaconchain-2022\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/eth2-tacas-22.pdf\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Joanne\"],\"propositions\":[],\"lastnames\":[\"Fuller\"],\"suffixes\":[]},{\"firstnames\":[\"Aditya\"],\"propositions\":[],\"lastnames\":[\"Asgaonkar\"],\"suffixes\":[]}],\"title\":\"Formal Verification of the Ethereum 2.0 Beacon Chain\",\"journal\":\"CoRR\",\"volume\":\"abs/2110.12909\",\"year\":\"2021\",\"url\":\"https://arxiv.org/abs/2110.12909\",\"eprinttype\":\"arXiv\",\"eprint\":\"2110.12909\",\"timestamp\":\"Thu, 28 Oct 2021 15:25:31 +0200\",\"biburl\":\"https://dblp.org/rec/journals/corr/abs-2110-12909.bib\",\"bibsource\":\"dblp computer science bibliography, https://dblp.org\",\"bibtex\":\"@article{DBLP:journals/corr/abs-2110-12909,\\n  author    = {Franck Cassez and\\n               Joanne Fuller and\\n               Aditya Asgaonkar},\\n  title     = {Formal Verification of the Ethereum 2.0 Beacon Chain},\\n  journal   = {CoRR},\\n  volume    = {abs/2110.12909},\\n  year      = {2021},\\n  url       = {https://arxiv.org/abs/2110.12909},\\n  eprinttype = {arXiv},\\n  eprint    = {2110.12909},\\n  timestamp = {Thu, 28 Oct 2021 15:25:31 +0200},\\n  biburl    = {https://dblp.org/rec/journals/corr/abs-2110-12909.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Fuller, J.\",\"Asgaonkar, A.\"],\"key\":\"DBLP:journals/corr/abs-2110-12909\",\"id\":\"DBLP:journals/corr/abs-2110-12909\",\"bibbaseid\":\"cassez-fuller-asgaonkar-formalverificationoftheethereum20beaconchain-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://arxiv.org/abs/2110.12909\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Verification of the Incremental Merkle Tree Algorithm with Dafny\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]}],\"year\":\"2021\",\"eprint\":\"2105.06009\",\"archiveprefix\":\"arXiv\",\"primaryclass\":\"cs.LO\",\"abstract\":\"The Deposit Smart Contract (DSC) is an instrumental component of the Ethereum 2.0 Phase 0 infrastructure. We have developed the first machine-checkable version of the incremental Merkle tree algorithm used in the DSC. We present our new and original correctness proof of the algorithm along with the Dafny machine-checkable version. The main results are: 1) a new proof of total correctness; 2) a software artefact with the proof in the form of the complete Dafny code base and 3) new provably correct optimisations of the algorithm. \",\"journal\":\"CoRR\",\"volume\":\"abs/2105.06009\",\"url\":\"https://arxiv.org/abs/2105.06009\",\"bibtex\":\"@article{DBLP:journals/corr/abs-2021,\\n    title={Verification of the Incremental Merkle Tree Algorithm with Dafny}, \\n    author={Franck Cassez},\\n    year={2021},\\n    eprint={2105.06009},\\n    archivePrefix={arXiv},\\n    primaryClass={cs.LO},\\n    abstract={\\n    The Deposit Smart Contract (DSC) is an instrumental component of the Ethereum 2.0 Phase 0 infrastructure. We have developed the first machine-checkable version of the incremental Merkle tree algorithm used in the DSC. We present our new and original correctness proof of the algorithm along with the Dafny machine-checkable version. The main results are: 1) a new proof of total correctness; 2) a software artefact with the proof in the form of the complete Dafny code base and 3) new provably correct optimisations of the algorithm.\\n    },\\n  journal   = {CoRR},\\n  volume    = {abs/2105.06009},\\n  url       = {https://arxiv.org/abs/2105.06009}\\n}\\n  \\n\",\"author_short\":[\"Cassez, F.\"],\"key\":\"DBLP:journals/corr/abs-2021\",\"id\":\"DBLP:journals/corr/abs-2021\",\"bibbaseid\":\"cassez-verificationoftheincrementalmerkletreealgorithmwithdafny-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://arxiv.org/abs/2105.06009\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"downloads\":13,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"Gjøl\"],\"propositions\":[],\"lastnames\":[\"Jensen\"],\"suffixes\":[]},{\"firstnames\":[\"Kim\",\"Guldstrand\"],\"propositions\":[],\"lastnames\":[\"Larsen\"],\"suffixes\":[]}],\"title\":\"Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction\",\"journal\":\"Fundam. Informaticae\",\"abstract\":\"We address the safety verification and synthesis problems for real-time systems. We introduce real-time programs that are made of instructions that can perform assignments to discrete and real-valued variables. They are general enough to capture interesting classes of timed systems such as timed automata, stopwatch automata, time(d) Petri nets and hybrid automata. We propose a semi-algorithm using refinement of trace abstractions to solve both the reachability verification problem and the parameter synthesis problem for real-time programs. All of the algorithms proposed have been implemented and we have conducted a series of experiments, comparing the performance of our new approach to state-of-the-art tools in classical reachability, robustness analysis and parameter synthesis for timed systems. We show that our new method provides solutions to problems which are unsolvable by the current state-of-the-art tools.\",\"volume\":\"178\",\"number\":\"1-2\",\"pages\":\"31–57\",\"year\":\"2021\",\"url\":\"https://doi.org/10.3233/FI-2021-1997\",\"doi\":\"10.3233/FI-2021-1997\",\"timestamp\":\"Fri, 22 Jan 2021 00:00:00 +0100\",\"biburl\":\"https://dblp.org/rec/journals/fuin/CassezJL21.bib\",\"bibsource\":\"dblp computer science bibliography, https://dblp.org\",\"urlpaper\":\"papers/fi-2021.pdf\",\"bibtex\":\"@article{DBLP:journals/fuin/CassezJL21,\\n  author    = {Franck Cassez and\\n               Peter Gj{\\\\o}l Jensen and\\n               Kim Guldstrand Larsen},\\n  title     = {Verification and Parameter Synthesis for Real-Time Programs using\\n               Refinement of Trace Abstraction},\\n  journal   = {Fundam. Informaticae},\\n  abstract = {We address the safety verification and synthesis problems for real-time systems. We introduce real-time programs that are made of instructions that can perform assignments to discrete and real-valued variables. They are general enough to capture interesting classes of timed systems such as timed automata, stopwatch automata, time(d) Petri nets and hybrid automata. \\nWe propose a semi-algorithm using refinement of trace abstractions to solve both the reachability verification problem and the parameter synthesis problem for real-time programs. \\nAll of the algorithms proposed have been implemented and we have conducted a series of experiments, comparing the performance of our new approach to state-of-the-art tools in classical reachability, robustness analysis and parameter synthesis for timed systems. We show that our new method provides solutions to problems which are unsolvable by the current state-of-the-art tools.},\\n\\n  volume    = {178},\\n  number    = {1-2},\\n  pages     = {31--57},\\n  year      = {2021},\\n  url       = {https://doi.org/10.3233/FI-2021-1997},\\n  doi       = {10.3233/FI-2021-1997},\\n  timestamp = {Fri, 22 Jan 2021 00:00:00 +0100},\\n  biburl    = {https://dblp.org/rec/journals/fuin/CassezJL21.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org},\\n   urlpaper = {papers/fi-2021.pdf},\\n}\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Jensen, P. G.\",\"Larsen, K. G.\"],\"key\":\"DBLP:journals/fuin/CassezJL21\",\"id\":\"DBLP:journals/fuin/CassezJL21\",\"bibbaseid\":\"cassez-jensen-larsen-verificationandparametersynthesisforrealtimeprogramsusingrefinementoftraceabstraction-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/fi-2021.pdf\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"downloads\":3,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"Gjøl\"],\"propositions\":[],\"lastnames\":[\"Jensen\"],\"suffixes\":[]},{\"firstnames\":[\"Kim\",\"Guldstrand\"],\"propositions\":[],\"lastnames\":[\"Larsen\"],\"suffixes\":[]}],\"title\":\"Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction\",\"journal\":\"CoRR\",\"abstract\":\"We address the safety verification and synthesis problems for real-time systems. We introduce real-time programs that are made of instructions that can perform assignments to discrete and real-valued variables. They are general enough to capture interesting classes of timed systems such as timed automata, stopwatch automata, time(d) Petri nets and hybrid automata. We propose a semi-algorithm using refinement of trace abstractions to solve both the reachability verification problem and the parameter synthesis problem for real-time programs. All of the algorithms proposed have been implemented and we have conducted a series of experiments, comparing the performance of our new approach to state-of-the-art tools in classical reachability, robustness analysis and parameter synthesis for timed systems. We show that our new method provides solutions to problems which are unsolvable by the current state-of-the-art tools.\",\"volume\":\"abs/2007.10539\",\"year\":\"2020\",\"url\":\"https://arxiv.org/abs/2007.10539\",\"archiveprefix\":\"arXiv\",\"eprint\":\"2007.10539\",\"timestamp\":\"Tue, 28 Jul 2020 01:00:00 +0200\",\"biburl\":\"https://dblp.org/rec/journals/corr/abs-2007-10539.bib\",\"bibsource\":\"dblp computer science bibliography, https://dblp.org\",\"bibtex\":\"@article{DBLP:journals/corr/abs-2007-10539,\\n  author    = {Franck Cassez and\\n               Peter Gj{\\\\o}l Jensen and\\n               Kim Guldstrand Larsen},\\n  title     = {Verification and Parameter Synthesis for Real-Time Programs using\\n               Refinement of Trace Abstraction},\\n  journal   = {CoRR},\\n  abstract = {We address the safety verification and synthesis problems for real-time systems. We introduce real-time programs that are made of instructions that can perform assignments to discrete and real-valued variables. They are general enough to capture interesting classes of timed systems such as timed automata, stopwatch automata, time(d) Petri nets and hybrid automata. \\nWe propose a semi-algorithm using refinement of trace abstractions to solve both the reachability verification problem and the parameter synthesis problem for real-time programs. \\nAll of the algorithms proposed have been implemented and we have conducted a series of experiments, comparing the performance of our new approach to state-of-the-art tools in classical reachability, robustness analysis and parameter synthesis for timed systems. We show that our new method provides solutions to problems which are unsolvable by the current state-of-the-art tools.},\\n  volume    = {abs/2007.10539},\\n  year      = {2020},\\n  url       = {https://arxiv.org/abs/2007.10539},\\n  archivePrefix = {arXiv},\\n  eprint    = {2007.10539},\\n  timestamp = {Tue, 28 Jul 2020 01:00:00 +0200},\\n  biburl    = {https://dblp.org/rec/journals/corr/abs-2007-10539.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Jensen, P. G.\",\"Larsen, K. G.\"],\"key\":\"DBLP:journals/corr/abs-2007-10539\",\"id\":\"DBLP:journals/corr/abs-2007-10539\",\"bibbaseid\":\"cassez-jensen-larsen-verificationandparametersynthesisforrealtimeprogramsusingrefinementoftraceabstraction-2020\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://arxiv.org/abs/2007.10539\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"downloads\":4,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Xi\"],\"propositions\":[],\"lastnames\":[\"Zheng\"],\"suffixes\":[]},{\"firstnames\":[\"Christine\"],\"propositions\":[],\"lastnames\":[\"Julien\"],\"suffixes\":[]},{\"firstnames\":[\"Rodion\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Podorozhny\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Thierry\"],\"propositions\":[],\"lastnames\":[\"Rakotoarivelo\"],\"suffixes\":[]}],\"title\":\"Efficient and Scalable Runtime Monitoring for Cyber-Physical System\",\"journal\":\"IEEE Syst. J.\",\"abstract\":\"Our reliance on cyber-physical systems (CPSs) is increasingly widespread, but scalable methods for the analysis of such systems remain a significant challenge. Runtime verification of CPSs provides a reasonable middle ground between formal verification and simulation approaches, but it comes with its own challenges. A runtime verification system must run directly on the deployed application. In the CPS domain, it is therefore critical that a runtime verification system exhibits low overhead and good scalability so that the verification does not interfere with the analyzed CPS application. In this paper, we introduce Brace, a runtime verification system whose focus is on ensuring these performance qualities for applications in the CPS domain. Brace strives to bound the computation overhead for CPS runtime verification while preserving a high level of monitoring accuracy in terms of the number of false positive and false negative reports. Brace is particularly suitable to systems in which scheduling is distributed across networked CPS components. We evaluate Brace to determine how effectively and efficiently it can detect injected errors in two existing real-life CPS applications with distributed scheduling. Our results demonstrate that Brace efficiently detects those errors and a few true bugs and is able to bound both the memory and computation overhead even in systems with large numbers of observed events.\",\"volume\":\"12\",\"number\":\"2\",\"pages\":\"1667–1678\",\"year\":\"2018\",\"url\":\"https://doi.org/10.1109/JSYST.2016.2614599\",\"doi\":\"10.1109/JSYST.2016.2614599\",\"timestamp\":\"Fri, 11 Sep 2020 15:02:08 +0200\",\"biburl\":\"https://dblp.org/rec/journals/sj/Zheng0PCR18.bib\",\"bibsource\":\"dblp computer science bibliography, https://dblp.org\",\"bibtex\":\"@article{DBLP:journals/sj/Zheng0PCR18,\\n  author    = {Xi Zheng and\\n               Christine Julien and\\n               Rodion M. Podorozhny and\\n               Franck Cassez and\\n               Thierry Rakotoarivelo},\\n  title     = {Efficient and Scalable Runtime Monitoring for Cyber-Physical System},\\n  journal   = {{IEEE} Syst. J.},\\n  abstract={\\n  Our reliance on cyber-physical systems (CPSs) is increasingly widespread, but scalable methods for the analysis of such systems remain a significant challenge. Runtime verification of CPSs provides a reasonable middle ground between formal verification and simulation approaches, but it comes with its own challenges. A runtime verification system must run directly on the deployed application. In the CPS domain, it is therefore critical that a runtime verification system exhibits low overhead and good scalability so that the verification does not interfere with the analyzed CPS application. In this paper, we introduce Brace, a runtime verification system whose focus is on ensuring these performance qualities for applications in the CPS domain. Brace strives to bound the computation overhead for CPS runtime verification while preserving a high level of monitoring accuracy in terms of the number of false positive and false negative reports. Brace is particularly suitable to systems in which scheduling is distributed across networked CPS components. We evaluate Brace to determine how effectively and efficiently it can detect injected errors in two existing real-life CPS applications with distributed scheduling. Our results demonstrate that Brace efficiently detects those errors and a few true bugs and is able to bound both the memory and computation overhead even in systems with large numbers of observed events.},\\n  volume    = {12},\\n  number    = {2},\\n  pages     = {1667--1678},\\n  year      = {2018},\\n  url       = {https://doi.org/10.1109/JSYST.2016.2614599},\\n  doi       = {10.1109/JSYST.2016.2614599},\\n  timestamp = {Fri, 11 Sep 2020 15:02:08 +0200},\\n  biburl    = {https://dblp.org/rec/journals/sj/Zheng0PCR18.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\",\"author_short\":[\"Zheng, X.\",\"Julien, C.\",\"Podorozhny, R. M.\",\"Cassez, F.\",\"Rakotoarivelo, T.\"],\"key\":\"DBLP:journals/sj/Zheng0PCR18\",\"id\":\"DBLP:journals/sj/Zheng0PCR18\",\"bibbaseid\":\"zheng-julien-podorozhny-cassez-rakotoarivelo-efficientandscalableruntimemonitoringforcyberphysicalsystem-2018\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1109/JSYST.2016.2614599\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Pablo\",\"González\"],\"propositions\":[\"de\"],\"lastnames\":[\"Aledo\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"Gjøl\"],\"propositions\":[],\"lastnames\":[\"Jensen\"],\"suffixes\":[]}],\"title\":\"WUPPAAL: Computation of Worst-Case Execution-Time for Binary Programs with UPPAAL\",\"booktitle\":\"Models, Algorithms, Logics and Tools - Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday\",\"pages\":\"560–577\",\"year\":\"2017\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"10460\",\"publisher\":\"Springer\",\"url\":\"https://doi.org/10.1007/978-3-319-63121-9_28\",\"doi\":\"10.1007/978-3-319-63121-9_28\",\"timestamp\":\"Tue, 22 Aug 2017 08:17:15 +0200\",\"biburl\":\"http://dblp.uni-trier.de/rec/bib/conf/birthday/CassezAJ17\",\"bibsource\":\"dblp computer science bibliography, http://dblp.org\",\"urlpaper\":\"papers/kim-fest-17.pdf\",\"abstract\":\"We address the problem of computing the worst-case execu- tion-time (WCET) of binary programs using a real-time model-checker. In our previous work, we introduced a fully automated and modular methodology to build a model (network of timed automata) that combined a binary program and the hardware to run the program on. Computing the WCET amounts to finding the longest path time-wise in this model, which can be done using a real-time model checker like Uppaal. In this work, we generalise the previous approach and we define a generic framework to support arbitrary binary language and hardware. We have implemented our new approach in an extended version of Uppaal, called Wuppaal. Experimental results using some standard benchmarks suite for WCET computation (from Malardalen University) show that our technique is practical and promising.\",\"bibtex\":\"@inproceedings{mod-17,\\n  author    = {Franck Cassez and\\n               Pablo Gonz{\\\\'{a}}lez de Aledo and\\n               Peter Gj{\\\\o}l Jensen},\\n  title     = {{WUPPAAL:} Computation of Worst-Case Execution-Time for Binary Programs\\n               with {UPPAAL}},\\n  booktitle = {Models, Algorithms, Logics and Tools - Essays Dedicated to Kim Guldstrand\\n               Larsen on the Occasion of His 60th Birthday},\\n  pages     = {560--577},\\n  year      = {2017},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {10460},\\n  publisher = {Springer},  \\n  url       = {https://doi.org/10.1007/978-3-319-63121-9_28},\\n  doi       = {10.1007/978-3-319-63121-9_28},\\n  timestamp = {Tue, 22 Aug 2017 08:17:15 +0200},\\n  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/birthday/CassezAJ17},\\n  bibsource = {dblp computer science bibliography, http://dblp.org},\\n\\n  urlpaper = {papers/kim-fest-17.pdf},\\n  abstract = {We address the problem of computing the worst-case execu- tion-time (WCET) of binary programs using a real-time model-checker. \\n  In our previous work, we introduced a fully automated and modular methodology to build a model (network of timed automata) that combined a binary \\n  program and the hardware to run the program on. \\n  Computing the WCET amounts to finding the longest path time-wise in this model, which can be done using a real-time model checker like Uppaal. \\n  In this work, we generalise the previous approach and we define a generic framework to support arbitrary binary language and hardware.\\nWe have implemented our new approach in an extended version of Uppaal, called Wuppaal. \\nExperimental results using some standard benchmarks suite for WCET computation (from Malardalen University) \\nshow that our technique is practical and promising.}\\n}\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"de Aledo, P. G.\",\"Jensen, P. G.\"],\"key\":\"mod-17\",\"id\":\"mod-17\",\"bibbaseid\":\"cassez-dealedo-jensen-wuppaalcomputationofworstcaseexecutiontimeforbinaryprogramswithuppaal-2017\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/kim-fest-17.pdf\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"Gjøl\"],\"propositions\":[],\"lastnames\":[\"Jensen\"],\"suffixes\":[]},{\"firstnames\":[\"Kim\",\"Guldstrand\"],\"propositions\":[],\"lastnames\":[\"Larsen\"],\"suffixes\":[]}],\"title\":\"Refinement of Trace Abstraction for Real-Time Programs\",\"booktitle\":\"Reachability Problems - 11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings\",\"volume\":\"10506\",\"pages\":\"42–58\",\"year\":\"2017\",\"publisher\":\"Springer\",\"url\":\"https://doi.org/10.1007/978-3-319-67089-8_4\",\"doi\":\"10.1007/978-3-319-67089-8_4\",\"timestamp\":\"Wed, 30 Aug 2017 15:59:47 +0200\",\"isbn\":\"978-3-319-67088-1\",\"biburl\":\"http://dblp.uni-trier.de/rec/bib/conf/rp/CassezJL17\",\"bibsource\":\"dblp computer science bibliography, http://dblp.org\",\"urlpaper\":\"papers/rp-17.pdf\",\"abstract\":\"Real-time programs are made of instructions that can perform assignments to discrete and real-valued variables. They are general enough to capture interesting classes of timed systems such as timed automata, stopwatch automata, time(d) Petri nets and hybrid automata. We propose a semi-algorithm using refinement of trace abstractions to solve the reachability verification problem for real-time programs. We report on the implementation of our algorithm and we show that our new method provides solutions to problems which are unsolvable by the current state-of-the-art tools.\",\"bibtex\":\"@inproceedings{rp-17,\\n  author    = {Franck Cassez and\\n               Peter Gj{\\\\o}l Jensen and\\n               Kim Guldstrand Larsen},\\n  title     = {Refinement of Trace Abstraction for Real-Time Programs},\\n  booktitle = {Reachability Problems - 11th International Workshop, {RP} 2017, London,\\n               UK, September 7-9, 2017, Proceedings},\\n  volume    = {10506},\\n  pages     = {42--58},\\n  year      = {2017},\\n  publisher = {Springer},\\n  url       = {https://doi.org/10.1007/978-3-319-67089-8_4},\\n  doi       = {10.1007/978-3-319-67089-8_4},\\n  timestamp = {Wed, 30 Aug 2017 15:59:47 +0200},\\n  isbn      = {978-3-319-67088-1},\\n  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/rp/CassezJL17},\\n  bibsource = {dblp computer science bibliography, http://dblp.org},\\n  urlpaper = {papers/rp-17.pdf},\\n  abstract = {Real-time programs are made of instructions that can perform assignments to discrete and real-valued variables. \\n  They are general enough to capture interesting classes of timed systems such as timed automata, stopwatch automata, time(d) Petri nets and hybrid automata. \\n  We propose a semi-algorithm using refinement of trace abstractions to solve the reachability verification problem for real-time programs. \\n  We report on the implementation of our algorithm and we show that our new method provides solutions to problems which are unsolvable by the current state-of-the-art tools.}\\n}\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Jensen, P. G.\",\"Larsen, K. G.\"],\"key\":\"rp-17\",\"id\":\"rp-17\",\"bibbaseid\":\"cassez-jensen-larsen-refinementoftraceabstractionforrealtimeprograms-2017\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/rp-17.pdf\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Anthony M.\"],\"propositions\":[],\"lastnames\":[\"Sloane\"],\"suffixes\":[]}],\"title\":\"ScalaSMT: Satisfiability Modulo Theory in Scala (Tool Paper)\",\"booktitle\":\"SCALA'17, October 23–27, 2017, Vancouver, BC, Canada. Proceedings.\",\"pages\":\"\",\"year\":\"2017\",\"xxxurl\":\"http://dx.doi.org/10.1007/978-3-662-46681-0_39\",\"xxxdoi\":\"10.1007/978-3-662-46681-0_39\",\"publisher\":\"acm\",\"xvolume\":\"9035\",\"xxxseries\":\"lncs\",\"mywebpage\":\"soft-verif\",\"keywords\":\"scala, SMT solvers\",\"category\":\"soft-verif\",\"show\":\"\",\"note\":\"forthcoming\",\"urlpaper\":\"papers/scala-17.pdf\",\"abstract\":\"A Satisfiability Modulo Theory (SMT) solver is a program that implements algorithms to automatically determine whether a logical formula is satisfiable. The performance of SMT solvers has dramatically increased in the last decade and for instance, many of the state-of-the-art software analysis tools heavily rely on SMT solving to analyse source code. We present ScalaSMT, a Scala library that leverages the power of SMT solvers and makes SMT solving directly usable in Scala. ScalaSMT provides seamless access to numerous popular SMT solvers like Z3, CVC4, Yices, MathSat or SMTInterpol. Our library comes with a domain-specific language to write terms and logical formulas for a wide range of logical theories, thereby isolating users from the details of particular solvers.\",\"bibtex\":\"@inproceedings{scala-17,\\nauthor    = {Franck Cassez\\nand {Anthony M.} Sloane},\\n  title     = {ScalaSMT: Satisfiability Modulo Theory in Scala (Tool Paper)},\\n  booktitle = {SCALA'17, October 23--27, 2017, Vancouver, BC, Canada. Proceedings.},\\n  pages     = {},\\n  year      = {2017},\\n  xxxurl       = {http://dx.doi.org/10.1007/978-3-662-46681-0_39},\\n  xxxdoi       = {10.1007/978-3-662-46681-0_39},\\n  publisher = \\\"acm\\\",\\n  xvolume = 9035,\\n  xxxseries    = lncs,\\n  mywebpage = {soft-verif},\\n  keywords = {scala, SMT solvers},\\n  category = {soft-verif},\\n  show = {},\\n  note={forthcoming},\\n  urlpaper = {papers/scala-17.pdf},\\n  abstract = {A Satisfiability Modulo Theory (SMT) solver is a program that implements algorithms to automatically determine whether \\n  a logical formula is satisfiable. \\n  The performance of SMT solvers has dramatically increased in the last decade and for instance, \\n  many of the state-of-the-art software analysis tools heavily rely on SMT solving to analyse source code. \\n  We present ScalaSMT, a Scala library that leverages the power of SMT solvers and makes SMT solving directly usable in Scala. \\n  ScalaSMT provides seamless access to numerous popular SMT solvers like Z3, CVC4, Yices, MathSat or SMTInterpol. \\n  Our library comes with a domain-specific language to write terms and logical formulas for a wide range of logical theories, \\n  thereby isolating users from the details of particular solvers.},\\n    Type = {B - International Conferences},\\n    show = {},\\n}\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Sloane, A.\"],\"key\":\"scala-17\",\"id\":\"scala-17\",\"bibbaseid\":\"cassez-sloane-scalasmtsatisfiabilitymodulotheoryinscalatoolpaper-2017\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/scala-17.pdf\"},\"keyword\":[\"scala\",\"SMT solvers\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"downloads\":3,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Xi\"],\"propositions\":[],\"lastnames\":[\"Zheng\"],\"suffixes\":[]},{\"firstnames\":[\"Christine\"],\"propositions\":[],\"lastnames\":[\"Julien\"],\"suffixes\":[]},{\"firstnames\":[\"Hongxu\"],\"propositions\":[],\"lastnames\":[\"Chen\"],\"suffixes\":[]},{\"firstnames\":[\"Rodion\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Podorozhny\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]}],\"title\":\"Real-Time Simulation Support for Runtime Verification of Cyber-Physical Systems\",\"journal\":\"ACM Trans. Embed. Comput. Syst.\",\"volume\":\"16\",\"number\":\"4\",\"abstract\":\"In Cyber-Physical Systems (CPS), cyber and physical components must work seamlessly in tandem. Runtime verification of CPS is essential yet very difficult, due to deployment environments that are expensive, dangerous, or simply impossible to use for verification tasks. A key enabling factor of runtime verification of CPS is the ability to integrate real-time simulations of portions of the CPS into live running systems. We propose a verification approach that allows CPS application developers to opportunistically leverage real-time simulation to support runtime verification. Our approach, termed BraceBind, allows selecting, at runtime, between actual physical processes or simulations of them to support a running CPS application. To build BraceBind, we create a real-time simulation architecture to generate and manage multiple real-time simulation environments based on existing simulation models in a manner that ensures sufficient accuracy for verifying a CPS application. Specifically, BraceBind aims to both improve simulation speed and minimize latency, thereby making it feasible to integrate simulations of physical processes into the running CPS application. BraceBind then integrates this real-time simulation architecture with an existing runtime verification approach that has low computational overhead and high accuracy. This integration uses an aspect-oriented adapter architecture that connects the variables in the cyber portion of the CPS application with either sensors and actuators in the physical world or the automatically generated real-time simulation. Our experimental results show that, with a negligible performance penalty, our approach is both efficient and effective in detecting program errors that are otherwise only detectable in a physical deployment. \",\"pages\":\"106:1–106:24\",\"year\":\"2017\",\"url\":\"https://doi.org/10.1145/3063382\",\"doi\":\"10.1145/3063382\",\"timestamp\":\"Fri, 09 Apr 2021 18:25:32 +0200\",\"biburl\":\"https://dblp.org/rec/journals/tecs/ZhengJCPC17.bib\",\"bibsource\":\"dblp computer science bibliography, https://dblp.org\",\"bibtex\":\"@article{DBLP:journals/tecs/ZhengJCPC17,\\n  author    = {Xi Zheng and\\n               Christine Julien and\\n               Hongxu Chen and\\n               Rodion M. Podorozhny and\\n               Franck Cassez},\\n  title     = {Real-Time Simulation Support for Runtime Verification of Cyber-Physical\\n               Systems},\\n  journal   = {{ACM} Trans. Embed. Comput. Syst.},\\n  volume    = {16},\\n  number    = {4},\\n  abstract={\\n    In Cyber-Physical Systems (CPS), cyber and physical components must work seamlessly in tandem. Runtime verification of CPS is essential yet very difficult, due to deployment environments that are expensive, dangerous, or simply impossible to use for verification tasks. A key enabling factor of runtime verification of CPS is the ability to integrate real-time simulations of portions of the CPS into live running systems. We propose a verification approach that allows CPS application developers to opportunistically leverage real-time simulation to support runtime verification. Our approach, termed BraceBind, allows selecting, at runtime, between actual physical processes or simulations of them to support a running CPS application. To build BraceBind, we create a real-time simulation architecture to generate and manage multiple real-time simulation environments based on existing simulation models in a manner that ensures sufficient accuracy for verifying a CPS application. Specifically, BraceBind aims to both improve simulation speed and minimize latency, thereby making it feasible to integrate simulations of physical processes into the running CPS application. BraceBind then integrates this real-time simulation architecture with an existing runtime verification approach that has low computational overhead and high accuracy. This integration uses an aspect-oriented adapter architecture that connects the variables in the cyber portion of the CPS application with either sensors and actuators in the physical world or the automatically generated real-time simulation. Our experimental results show that, with a negligible performance penalty, our approach is both efficient and effective in detecting program errors that are otherwise only detectable in a physical deployment.\\n  },\\n  pages     = {106:1--106:24},\\n  year      = {2017},\\n  url       = {https://doi.org/10.1145/3063382},\\n  doi       = {10.1145/3063382},\\n  timestamp = {Fri, 09 Apr 2021 18:25:32 +0200},\\n  biburl    = {https://dblp.org/rec/journals/tecs/ZhengJCPC17.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org}\\n}\\n\\n\\n\",\"author_short\":[\"Zheng, X.\",\"Julien, C.\",\"Chen, H.\",\"Podorozhny, R. M.\",\"Cassez, F.\"],\"key\":\"DBLP:journals/tecs/ZhengJCPC17\",\"id\":\"DBLP:journals/tecs/ZhengJCPC17\",\"bibbaseid\":\"zheng-julien-chen-podorozhny-cassez-realtimesimulationsupportforruntimeverificationofcyberphysicalsystems-2017\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.1145/3063382\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"misc\",\"type\":\"misc\",\"title\":\"Analysis of program code\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Cassez\"],\"firstnames\":[\"F.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Müller\"],\"firstnames\":[\"C.\"],\"suffixes\":[]}],\"url\":\"https://www.google.com/patents/US9760469\",\"year\":\"2017\",\"mywebpage\":\"soft-verif\",\"abstract\":\"This disclosure relates to the analysis of a program based on source code where the source code comprises a call to a function associated with a function implementation. A processor determines, based on a summary that over-approximates the function, an assignment of an input variable and an output variable of the function call to reach a predefined state. The processor then determines, based on the implementation of the function whether the assignment of the input variable results in the assignment of the output variable. If it does not, the processor determines a narrowed summary for the function such that the narrowed summary over-approximates the function and excludes the assignment of the input variable and the output variable. Finally, the processor stores the narrowed summary on a datastore. Inlining of function code and unfolding of loops is avoided and parallel processing of multiple functions is possible. \",\"keywords\":\"software verification\",\"category\":\"soft-verif\",\"month\":\"September 12\",\"note\":\"US Patent 9,760,469\",\"bibtex\":\"@misc{cassez2017analysis,\\n  title={Analysis of program code},\\n  author={Cassez, F. and M{\\\\\\\"u}ller, C.},\\n  url={https://www.google.com/patents/US9760469},\\n  year={2017},\\n  mywebpage = {soft-verif},\\n  abstract={\\n  This disclosure relates to the analysis of a program based on source code where the source code comprises a call to a function associated with a function implementation. A processor determines, based on a summary that over-approximates the function, an assignment of an input variable and an output variable of the function call to reach a predefined state. The processor then determines, based on the implementation of the function whether the assignment of the input variable results in the assignment of the output variable. If it does not, the processor determines a narrowed summary for the function such that the narrowed summary over-approximates the function and excludes the assignment of the input variable and the output variable. Finally, the processor stores the narrowed summary on a datastore. Inlining of function code and unfolding of loops is avoided and parallel processing of multiple functions is possible.\\n  },\\n  keywords = {software verification},\\n  category = {soft-verif},\\n  month=sep # \\\"~12\\\",\\n  note={US Patent 9,760,469}\\n}\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Müller, C.\"],\"key\":\"cassez2017analysis\",\"id\":\"cassez2017analysis\",\"bibbaseid\":\"cassez-mller-analysisofprogramcode-2017\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://www.google.com/patents/US9760469\"},\"keyword\":[\"software verification\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"A - International Conferences\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Anthony M.\"],\"propositions\":[],\"lastnames\":[\"Sloane\"],\"suffixes\":[]},{\"firstnames\":[\"Matthew\"],\"propositions\":[],\"lastnames\":[\"Roberts\"],\"suffixes\":[]},{\"firstnames\":[\"Matthew\"],\"propositions\":[],\"lastnames\":[\"Pigram\"],\"suffixes\":[]},{\"firstnames\":[\"Pongsak\"],\"propositions\":[],\"lastnames\":[\"Suvanpong\"],\"suffixes\":[]},{\"firstnames\":[\"Pablo\",\"González\"],\"propositions\":[\"de\"],\"lastnames\":[\"Aledo\",\"Marugán\"],\"suffixes\":[]}],\"title\":\"Skink: Static Analysis of Programs in LLVM Intermediate Representation (Competition contribution)\",\"booktitle\":\"Tools and Algorithms for the Construction and Analysis of Systems - 23rd International Conference, TACAS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017. Proceedings\",\"pages\":\"380–384\",\"year\":\"2017\",\"url\":\"https://doi.org/10.1007/978-3-662-54580-5_27\",\"doi\":\"10.1007/978-3-662-54580-5_27\",\"publisher\":\"springv\",\"xvolume\":\"10206\",\"series\":\"lncs\",\"mywebpage\":\"soft-verif\",\"keywords\":\"refinement, software verification\",\"category\":\"soft-verif\",\"show\":\"\",\"xxnote\":\"forthcoming\",\"urlpaper\":\"papers/sv-comp-2017.pdf\",\"abstract\":\"Skink is a static analysis tool that analyses the LLVM intermediate representation (LLVM-IR) of a program source code. The analysis consists of checking whether there is a feasible execution that can reach a designated error block in the LLVM-IR. The result of a program analysis is ``correct'' if the error block is not reachable, ``incorrect'' if the error block is reachable, or ``inconclusive'' if the status of the program could not be determined. In this paper, we introduce Skink V2.0 to analyse single and multi-threaded C programs.\",\"bibtex\":\"@inproceedings{tacas-17,\\nauthor    = {Franck Cassez\\nand {Anthony M.} Sloane\\nand Matthew Roberts\\nand Matthew Pigram\\nand Pongsak Suvanpong\\nand Pablo Gonz{\\\\'{a}}lez de Aledo Marug{\\\\'{a}}n},\\n  title     = {Skink: Static Analysis of Programs in LLVM Intermediate Representation (Competition contribution)},\\n  booktitle = {Tools and Algorithms for the Construction and Analysis of Systems\\n               - 23rd International Conference, {TACAS} 2017, Held as Part of the\\n               European Joint Conferences on Theory and Practice of Software, {ETAPS}\\n               2017, Uppsala, Sweden, April 22-29, 2017. Proceedings},\\n  \\n pages     = {380--384},\\n  year      = {2017},\\n  url       = {https://doi.org/10.1007/978-3-662-54580-5_27},\\n  doi       = {10.1007/978-3-662-54580-5_27},\\n  publisher = springv,\\n  xvolume = 10206,\\n  series    = lncs,\\n  mywebpage = {soft-verif},\\n  keywords = {refinement, software verification},\\n  category = {soft-verif},\\n  show = {},\\n  xxnote={forthcoming},\\n  urlpaper = {papers/sv-comp-2017.pdf},\\n  abstract = {Skink is a static analysis tool that analyses the LLVM intermediate representation (LLVM-IR)\\nof a program source code.\\nThe analysis consists of checking whether there is a feasible execution that can reach a\\n designated error block in the LLVM-IR.\\nThe result of a program analysis is ``correct'' if the error block is not reachable,\\n``incorrect'' if the error block is reachable, or ``inconclusive'' if the status of the program could not be determined.\\nIn this paper, we introduce Skink V2.0 to analyse single and multi-threaded C programs.},\\n    Type = {A - International Conferences},\\n}\\n\\n\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n%%% 2016\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Sloane, A.\",\"Roberts, M.\",\"Pigram, M.\",\"Suvanpong, P.\",\"de Aledo Marugán, P. G.\"],\"key\":\"tacas-17\",\"id\":\"tacas-17\",\"bibbaseid\":\"cassez-sloane-roberts-pigram-suvanpong-dealedomarugn-skinkstaticanalysisofprogramsinllvmintermediaterepresentationcompetitioncontribution-2017\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/sv-comp-2017.pdf\"},\"keyword\":[\"refinement\",\"software verification\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Sloane\"],\"firstnames\":[\"Anthony M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cassez\"],\"firstnames\":[\"Franck\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Buckley\"],\"firstnames\":[\"Scott\"],\"suffixes\":[]}],\"title\":\"The Sbt-rats Parser Generator Plugin for Scala (Tool Paper)\",\"booktitle\":\"Proceedings of the 2016 7th ACM SIGPLAN Symposium on Scala\",\"series\":\"SCALA 2016\",\"year\":\"2016\",\"isbn\":\"978-1-4503-4648-1\",\"location\":\"Amsterdam, Netherlands\",\"pages\":\"110–113\",\"numpages\":\"4\",\"url\":\"http://doi.acm.org/10.1145/2998392.3001580\",\"doi\":\"10.1145/2998392.3001580\",\"urlpaper\":\"papers/scala-2016.pdf\",\"xxacmid\":\"3001580\",\"publisher\":\"ACM\",\"address\":\"New York, NY, USA\",\"keywords\":\"Parsing expression grammars, Scala build tool\",\"abstract\":\"Tools for creating parsers are a key part of a mature language eco-system. Scala has traditionally relied on combinator libraries for defining parsers but being libraries they come with fundamental implementation limitations. An alternative is to use a Java-based parser generator such as ANTLR or Rats! but these tools are quite verbose and not ideal to use with Scala code. We describe our experiences with Scala-focused parser generation that is embodied in our sbtrats plugin for the Scala Build Tool. At its simplest, sbtrats provides a bridge to the Rats! parser generator for Java. On top of this bridge, we have a simple grammar definition notation that incorporates annotations for tree construction and pretty-printing. As well as generating a Rats! grammar, sbtrats can optionally generate case class definitions for the tree structure and a pretty-printer defined using our Kiama language processing library. We explain the sbtrats grammar notation and describe our positive experiences using it to define grammars for LLVM assembly notation and the SMTLIB input/output language for SMT solvers.\",\"show\":\"\",\"bibtex\":\"@inproceedings{scala-16,\\n author = {Sloane, {Anthony M.} and Cassez, Franck and Buckley, Scott},\\n title = {The {Sbt-rats} Parser Generator Plugin for Scala (Tool Paper)},\\n booktitle = {Proceedings of the 2016 7th ACM SIGPLAN Symposium on Scala},\\n series = {SCALA 2016},\\n year = {2016},\\n isbn = {978-1-4503-4648-1},\\n location = {Amsterdam, Netherlands},\\n pages = {110--113},\\n numpages = {4},\\n url = {http://doi.acm.org/10.1145/2998392.3001580},\\n doi = {10.1145/2998392.3001580},\\n urlpaper={papers/scala-2016.pdf},\\n xxacmid = {3001580},\\n publisher = {ACM},\\n address = {New York, NY, USA},\\n keywords = {Parsing expression grammars, Scala build tool},\\n abstract={Tools for creating parsers are a key part of a mature language eco-system. Scala has traditionally relied on combinator libraries for defining parsers but being libraries they come with fundamental implementation limitations. An alternative is to use a Java-based parser generator such as ANTLR or Rats! but these tools are quite verbose and not ideal to use with Scala code. We describe our experiences with Scala-focused parser generation that is embodied in our sbtrats plugin for the Scala Build Tool. At its simplest, sbtrats provides a bridge to the Rats! parser generator for Java. On top of this bridge, we have a simple grammar definition notation that incorporates annotations for tree construction and pretty-printing. As well as generating a Rats! grammar, sbtrats can optionally generate case class definitions for the tree structure and a pretty-printer defined using our Kiama language processing library. We explain the sbtrats grammar notation and describe our positive experiences using it to define grammars for LLVM assembly notation and the SMTLIB input/output language for SMT solvers.},\\n show = {},\\n Type = {B - International Conferences},\\n\\n}\\n\\n\\n\\n\",\"author_short\":[\"Sloane, A.\",\"Cassez, F.\",\"Buckley, S.\"],\"key\":\"scala-16\",\"id\":\"scala-16\",\"bibbaseid\":\"sloane-cassez-buckley-thesbtratsparsergeneratorpluginforscalatoolpaper-2016\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/scala-2016.pdf\"},\"keyword\":[\"Parsing expression grammars\",\"Scala build tool\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"A - Journal\",\"title\":\"Efficient and Scalable Runtime Monitoring for Cyber–Physical System\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Zheng\"],\"firstnames\":[\"Xi\"],\"suffixes\":[]},{\"firstnames\":[\"Christine\"],\"propositions\":[],\"lastnames\":[\"Julien\"],\"suffixes\":[]},{\"firstnames\":[\"Rodion M.\"],\"propositions\":[],\"lastnames\":[\"Podorozhny\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Thierry\"],\"propositions\":[],\"lastnames\":[\"Rakotoarivelo\"],\"suffixes\":[]}],\"journal\":\"IEEE Systems Journal\",\"year\":\"2016\",\"volume\":\"99\",\"pages\":\"1–12\",\"publisher\":\"IEEE\",\"doi\":\"10.1109/JSYST.2016.2614599\",\"issn\":\"1932-8184\",\"urlpaper\":\"papers/ieee-systems-2016.pdf\",\"url_link\":\"http://ieeexplore.ieee.org/document/7605519/\",\"month\":\"October\",\"show\":\"\",\"keywords\":\"wcet, timed automata\",\"abstract\":\"Our reliance on cyber–physical systems (CPSs) is increasingly widespread, but scalable methods for the analysis of such systems remain a significant challenge. Runtime verification of CPSs provides a reasonable middle ground between formal verification and simulation approaches, but it comes with its own challenges. A runtime verification system must run directly on the deployed application. In the CPS domain, it is therefore critical that a runtime verification system exhibits low overhead and good scalability so that the verification does not interfere with the analyzed CPS application. In this paper, we introduce Brace, a runtime verification system whose focus is on ensuring these performance qualities for applications in the CPS domain. Brace strives to bound the computation overhead for CPS runtime verification while preserving a high level of monitoring accuracy in terms of the number of false positive and false negative reports. Brace is particularly suitable to systems in which scheduling is distributed across networked CPS components. We evaluate Brace to determine how effectively and efficiently it can detect injected errors in two existing real-life CPS applications with distributed scheduling. Our results demonstrate that Brace efficiently detects those errors and a few true bugs and is able to bound both the memory and computation overhead even in systems with large numbers of observed events.\",\"bibtex\":\"@article{ieee-16,\\n  title={Efficient and Scalable Runtime Monitoring for Cyber--Physical System},\\n  author={Zheng, Xi and Christine Julien and {Rodion M.} Podorozhny  and Franck Cassez and Thierry Rakotoarivelo},\\n  journal={IEEE Systems Journal},\\n  year={2016},\\n  volume=99,\\n  pages={1--12},\\n  publisher={IEEE},\\n  doi={10.1109/JSYST.2016.2614599},\\n  ISSN={1932-8184},\\n  urlpaper={papers/ieee-systems-2016.pdf},\\n  url_link={http://ieeexplore.ieee.org/document/7605519/},\\n  month=oct,\\n  show = {},\\n  keywords = {wcet, timed automata},\\n\\n  abstract={Our reliance on cyber–physical systems (CPSs) is increasingly widespread, but scalable methods for the analysis of such systems remain a significant challenge. Runtime verification of CPSs provides a reasonable middle ground between formal verification and simulation approaches, but it comes with its own challenges. A runtime verification system must run directly on the deployed application. In the CPS domain, it is therefore critical that a runtime verification system exhibits low overhead and good scalability so that the verification does not interfere with the analyzed CPS application. In this paper, we introduce Brace, a runtime verification system whose focus is on ensuring these performance qualities for applications in the CPS domain. Brace strives to bound the computation overhead for CPS runtime verification while preserving a high level of monitoring accuracy in terms of the number of false positive and false negative reports. Brace is particularly suitable to systems in which scheduling is distributed across networked CPS components. We evaluate Brace to determine how effectively and efficiently it can detect injected errors in two existing real-life CPS applications with distributed scheduling. Our results demonstrate that Brace efficiently detects those errors and a few true bugs and is able to bound both the memory and computation overhead even in systems with large numbers of observed events.},\\n  Type = {A - Journal},\\n\\n}\\n\\n\\n\\n\",\"author_short\":[\"Zheng, X.\",\"Julien, C.\",\"Podorozhny, R.\",\"Cassez, F.\",\"Rakotoarivelo, T.\"],\"key\":\"ieee-16\",\"id\":\"ieee-16\",\"bibbaseid\":\"zheng-julien-podorozhny-cassez-rakotoarivelo-efficientandscalableruntimemonitoringforcyberphysicalsystem-2016\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/ieee-systems-2016.pdf\",\" link\":\"http://ieeexplore.ieee.org/document/7605519/\"},\"keyword\":[\"wcet\",\"timed automata\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"A - Journal\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Ron\"],\"propositions\":[\"van\",\"der\"],\"lastnames\":[\"Meyden\"],\"suffixes\":[]},{\"firstnames\":[\"Chenyi\"],\"propositions\":[],\"lastnames\":[\"Zhang\"],\"suffixes\":[]}],\"title\":\"The complexity of synchronous notions of information flow security\",\"journal\":\"Theor. Comput. Sci.\",\"volume\":\"631\",\"pages\":\"16–42\",\"year\":\"2016\",\"urlpaper\":\"papers/tcs-2016.pdf\",\"url_link\":\"http://dx.doi.org/10.1016/j.tcs.2016.03.011\",\"doi\":\"10.1016/j.tcs.2016.03.011\",\"timestamp\":\"Tue, 17 May 2016 17:26:44 +0200\",\"biburl\":\"http://dblp.uni-trier.de/rec/bib/journals/tcs/CassezMZ16\",\"bibsource\":\"dblp computer science bibliography, http://dblp.org\",\"show\":\"\",\"abstract\":\"The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one in which agents operate synchronously with awareness of the global clock. This enables timing based attacks to be captured, whereas previous work on this topic has dealt primarily with asynchronous systems. Versions of the notions of nondeducibility on inputs, nondeducibility on strategies, and an unwinding based notion are formulated for this model. All three notions are shown to be decidable, and their computational complexity is characterised.\",\"keywords\":\"security, non-interference\",\"bibtex\":\"@article{cassez-tcs-2016,\\n  author    = {Franck Cassez and\\n               Ron van der Meyden and\\n               Chenyi Zhang},\\n  title     = {The complexity of synchronous notions of information flow security},\\n  journal   = {Theor. Comput. Sci.},\\n  volume    = {631},\\n  pages     = {16--42},\\n  year      = {2016},\\n  urlpaper = {papers/tcs-2016.pdf},\\n  url_link       = {http://dx.doi.org/10.1016/j.tcs.2016.03.011},\\n  doi       = {10.1016/j.tcs.2016.03.011},\\n  timestamp = {Tue, 17 May 2016 17:26:44 +0200},\\n  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/tcs/CassezMZ16},\\n  bibsource = {dblp computer science bibliography, http://dblp.org},\\n  show = {},\\n  abstract={The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one in which agents operate synchronously with awareness of the global clock. This enables timing based attacks to be captured, whereas previous work on this topic has dealt primarily with asynchronous systems. Versions of the notions of nondeducibility on inputs, nondeducibility on strategies, and an unwinding based notion are formulated for this model. All three notions are shown to be decidable, and their computational complexity is characterised.},\\n  Type = {A - Journal},\\n  keywords = {security, non-interference},\\n\\n\\n}\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n%%% 2015\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"van der Meyden, R.\",\"Zhang, C.\"],\"key\":\"cassez-tcs-2016\",\"id\":\"cassez-tcs-2016\",\"bibbaseid\":\"cassez-vandermeyden-zhang-thecomplexityofsynchronousnotionsofinformationflowsecurity-2016\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/tcs-2016.pdf\",\" link\":\"http://dx.doi.org/10.1016/j.tcs.2016.03.011\"},\"keyword\":[\"security\",\"non-interference\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Xi\"],\"propositions\":[],\"lastnames\":[\"Zheng\"],\"suffixes\":[]},{\"firstnames\":[\"Christine\"],\"propositions\":[],\"lastnames\":[\"Julien\"],\"suffixes\":[]},{\"firstnames\":[\"Rodion M.\"],\"propositions\":[],\"lastnames\":[\"Podorozhny\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]}],\"title\":\"BraceAssertion: Runtime Verification of Cyber-Physical Systems\",\"booktitle\":\"12th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015, Dallas, TX, USA, October 19-22, 2015\",\"pages\":\"298–306\",\"year\":\"2015\",\"urlpaper\":\"papers/mass-2015.pdf\",\"url_link\":\"http://dx.doi.org/10.1109/MASS.2015.15\",\"doi\":\"10.1109/MASS.2015.15\",\"timestamp\":\"Fri, 06 May 2016 13:36:43 +0200\",\"biburl\":\"http://dblp.uni-trier.de/rec/bib/conf/mass/ZhengJPC15\",\"bibsource\":\"dblp computer science bibliography, http://dblp.org\",\"show\":\"\",\"keywords\":\"wcet, timed automata\",\"abstract\":\"Cyber-Physical Systems (CPS) have gained wide popularity, however, developing and debugging CPS remain significant challenges. Many bugs are detectable only at runtime under deployment conditions that may be unpredictable or at least unexpected at development time. The current state of the practice of debugging CPS is generally ad hoc, involving trial and error in a real deployment. For increased rigor, it is appealing to bring formal methods to CPS verification. However developers often eschew formal approaches due to complexity and lack of efficiency. This paper presents Brace Assertion, a specification framework based on natural language queries that are automatically converted to a determinitic class of timed automata used for runtime monitoring. To reduce runtime overhead and support properties that reference predicate logic, we use a second monitor automaton to create filtered traces on which to run the analysis using the specification monitor. We evaluate the Brace Assertion framework using a real CPS case study and show that the framework is able to minimize runtime overhead with an increasing number of monitors.\",\"bibtex\":\"@inproceedings{mass-Zheng-15,\\n  author    = {Xi Zheng and\\n               Christine Julien and\\n               {Rodion M.} Podorozhny and\\n               Franck Cassez},\\n  title     = {BraceAssertion: Runtime Verification of Cyber-Physical Systems},\\n  booktitle = {12th {IEEE} International Conference on Mobile Ad Hoc and Sensor Systems,\\n               {MASS} 2015, Dallas, TX, USA, October 19-22, 2015},\\n  pages     = {298--306},\\n  year      = {2015},\\n  urlpaper = {papers/mass-2015.pdf},\\n  url_link       = {http://dx.doi.org/10.1109/MASS.2015.15},\\n  doi       = {10.1109/MASS.2015.15},\\n  timestamp = {Fri, 06 May 2016 13:36:43 +0200},\\n  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/mass/ZhengJPC15},\\n  bibsource = {dblp computer science bibliography, http://dblp.org},\\n  show = {},\\n  keywords = {wcet, timed automata},\\n\\n  abstract={Cyber-Physical Systems (CPS) have gained wide popularity, however, developing and debugging CPS remain significant challenges. Many bugs are detectable only at runtime under deployment conditions that may be unpredictable or at least unexpected at development time. The current state of the practice of debugging CPS is generally ad hoc, involving trial and error in a real deployment. For increased rigor, it is appealing to bring formal methods to CPS verification. However developers often eschew formal approaches due to complexity and lack of efficiency. This paper presents Brace Assertion, a specification framework based on natural language queries that are automatically converted to a determinitic class of timed automata used for runtime monitoring. To reduce runtime overhead and support properties that reference predicate logic, we use a second monitor automaton to create filtered traces on which to run the analysis using the specification monitor. We evaluate the Brace Assertion framework using a real CPS case study and show that the framework is able to minimize runtime overhead with an increasing number of monitors.},\\n  Type = {B - International Conferences},\\n\\n}\\n\\n\\n\\n\",\"author_short\":[\"Zheng, X.\",\"Julien, C.\",\"Podorozhny, R.\",\"Cassez, F.\"],\"key\":\"mass-Zheng-15\",\"id\":\"mass-Zheng-15\",\"bibbaseid\":\"zheng-julien-podorozhny-cassez-braceassertionruntimeverificationofcyberphysicalsystems-2015\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/mass-2015.pdf\",\" link\":\"http://dx.doi.org/10.1109/MASS.2015.15\"},\"keyword\":[\"wcet\",\"timed automata\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Pablo\",\"González\"],\"propositions\":[\"de\"],\"lastnames\":[\"Aledo\",\"Marugán\"],\"suffixes\":[]}],\"title\":\"Timed Automata for Modelling Caches and Pipelines\",\"booktitle\":\"Proceedings Workshop on Models for Formal Analysis of Real Systems, MARS 2015, Suva, Fiji, November 23, 2015.\",\"pages\":\"37–45\",\"year\":\"2015\",\"editor\":[{\"firstnames\":[\"Rob\",\"J.\"],\"propositions\":[\"van\"],\"lastnames\":[\"Glabbeek\"],\"suffixes\":[]},{\"firstnames\":[\"Jan\",\"Friso\"],\"propositions\":[],\"lastnames\":[\"Groote\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Höfner\"],\"suffixes\":[]}],\"series\":\"EPTCS\",\"volume\":\"196\",\"url_link\":\"http://dx.doi.org/10.4204/EPTCS.196.4\",\"urlslides\":\"papers/slides-mars-2015.pdf\",\"doi\":\"10.4204/EPTCS.196.4\",\"category\":\"wcet\",\"mywebpage\":\"wcet\",\"show\":\"\",\"keywords\":\"wcet, timed automata\",\"abstract\":\"In this paper, we focus on modelling the timing aspects of binary programs running on architectures featuring caches and pipelines. The objective is to obtain a timed automaton model to compute tight bounds for the worst-case execution time (WCET) of the programs using model-checking techniques. \",\"bibtex\":\"@inproceedings{cassez-mars-2015,\\n  author    = {Franck Cassez and\\n               Pablo Gonz{\\\\'{a}}lez de Aledo Marug{\\\\'{a}}n},\\n  title     = {Timed Automata for Modelling Caches and Pipelines},\\n  booktitle = {Proceedings Workshop on Models for Formal Analysis of Real Systems,\\n               {MARS} 2015, Suva, Fiji, November 23, 2015.},\\n  pages     = {37--45},\\n  year      = {2015},\\n   editor    = {Rob J. van Glabbeek and\\n               Jan Friso Groote and\\n               Peter H{\\\\\\\"{o}}fner},\\n                series    = {{EPTCS}},\\n  volume    = {196},\\n  year      = {2015},\\n  url_link       = {http://dx.doi.org/10.4204/EPTCS.196.4},\\n    urlslides = {papers/slides-mars-2015.pdf},\\n  doi       = {10.4204/EPTCS.196.4},\\n  category= {wcet},\\n  mywebpage = {wcet},\\n  show = {},\\n  keywords = {wcet, timed automata},\\n  abstract = {\\n  In this paper, we focus on modelling the timing aspects of binary programs running on architectures featuring caches and pipelines. The objective is to obtain a timed automaton model to compute tight bounds for the worst-case execution time (WCET) of the programs using model-checking techniques.\\n  },\\n  Type = {B - International Conferences},\\n}\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"de Aledo Marugán, P. G.\"],\"editor_short\":[\"van Glabbeek, R. J.\",\"Groote, J. F.\",\"Höfner, P.\"],\"key\":\"cassez-mars-2015\",\"id\":\"cassez-mars-2015\",\"bibbaseid\":\"cassez-dealedomarugn-timedautomataformodellingcachesandpipelines-2015\",\"role\":\"author\",\"urls\":{\" link\":\"http://dx.doi.org/10.4204/EPTCS.196.4\",\"Slides\":\"https://franck44.github.io/publications/papers/slides-mars-2015.pdf\"},\"keyword\":[\"wcet\",\"timed automata\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Frowin\"],\"propositions\":[],\"lastnames\":[\"Ziegler\"],\"suffixes\":[]}],\"editor\":[{\"firstnames\":[\"Martin\"],\"propositions\":[],\"lastnames\":[\"Davis\"],\"suffixes\":[]},{\"firstnames\":[\"Ansgar\"],\"propositions\":[],\"lastnames\":[\"Fehnker\"],\"suffixes\":[]},{\"firstnames\":[\"Annabelle\"],\"propositions\":[],\"lastnames\":[\"McIver\"],\"suffixes\":[]},{\"firstnames\":[\"Andrei\"],\"propositions\":[],\"lastnames\":[\"Voronkov\"],\"suffixes\":[]}],\"title\":\"Verification of Concurrent Programs Using Trace Abstraction Refinement\",\"booktitle\":\"Logic for Programming, Artificial Intelligence, and Reasoning - 20th International Conference, LPAR-20 2015, Suva, Fiji, November 24-28, 2015, Proceedings\",\"pages\":\"233–248\",\"year\":\"2015\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"9450\",\"publisher\":\"Springer\",\"url\":\"http://dx.doi.org/10.1007/978-3-662-48899-7_17\",\"mywebpage\":\"soft-verif\",\"category\":\"soft-verif\",\"isbn\":\"978-3-662-48898-0\",\"doi\":\"10.1007/978-3-662-48899-7_17\",\"show\":\"\",\"note\":\"LPAR FMICS paper award\",\"urlpaper\":\"papers/lpar-2015.pdf\",\"urlslides\":\"papers/slides-lpar-2015.pdf\",\"abstract\":\"Verifying concurrent programs is notoriously hard due to the state explosion problem: (1) the data state space can be very large as the variables can range over very large sets, and (2) the control state space is the Cartesian product of the control state space of the concurrent com- ponents and thus grows exponentially in the number of components. On the one hand, the most successful approaches to address the control state explosion problem are based on assume-guarantee reasoning or model-checking coupled with partial order reduction. On the other hand, the most successful techniques to address the data space explosion problem for sequential programs verification are based on the abstraction/refine- ment paradigm which consists in refining an abstract over-approximation of a program via predicate refinement. In this paper, we show that we can combine partial order reduction techniques with trace abstraction refinement. We apply our approach to standard benchmarks and show that it matches current state-of-the-art analysis techniques.\",\"bibtex\":\"@inproceedings{cassez-lpar-2015,\\n  author    = {Franck Cassez and\\n               Frowin Ziegler},\\n                editor    = {Martin Davis and\\n               Ansgar Fehnker and\\n               Annabelle McIver and\\n               Andrei Voronkov},\\n  title     = {Verification of Concurrent Programs Using Trace Abstraction Refinement},\\n  booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning - 20th\\n               International Conference, {LPAR-20} 2015, Suva, Fiji, November 24-28,\\n               2015, Proceedings},\\n  pages     = {233--248},\\n  year      = {2015},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {9450},\\n  publisher = {Springer},\\n  year      = {2015},\\n  url       = {http://dx.doi.org/10.1007/978-3-662-48899-7_17},\\n  mywebpage = {soft-verif},\\n  category = {soft-verif},\\n  isbn      = {978-3-662-48898-0},\\n  doi       = {10.1007/978-3-662-48899-7_17},\\n  show = {},\\n  note = {LPAR FMICS  paper award},\\n  urlpaper = {papers/lpar-2015.pdf},\\n    urlslides = {papers/slides-lpar-2015.pdf},\\n  abstract = {Verifying concurrent programs is notoriously hard due to the state explosion problem: (1) the data state space can be very large as the variables can range over very large sets, and (2) the control state space is the Cartesian product of the control state space of the concurrent com- ponents and thus grows exponentially in the number of components. On the one hand, the most successful approaches to address the control state explosion problem are based on assume-guarantee reasoning or model-checking coupled with partial order reduction. On the other hand, the most successful techniques to address the data space explosion problem for sequential programs verification are based on the abstraction/refine- ment paradigm which consists in refining an abstract over-approximation of a program via predicate refinement. In this paper, we show that we can combine partial order reduction techniques with trace abstraction refinement. We apply our approach to standard benchmarks and show that it matches current state-of-the-art analysis techniques.},\\n  Type = {B - International Conferences},\\n}\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Ziegler, F.\"],\"editor_short\":[\"Davis, M.\",\"Fehnker, A.\",\"McIver, A.\",\"Voronkov, A.\"],\"key\":\"cassez-lpar-2015\",\"id\":\"cassez-lpar-2015\",\"bibbaseid\":\"cassez-ziegler-verificationofconcurrentprogramsusingtraceabstractionrefinement-2015\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/lpar-2015.pdf\",\"Slides\":\"https://franck44.github.io/publications/papers/slides-lpar-2015.pdf\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Takashi\"],\"propositions\":[],\"lastnames\":[\"Matsuoka\"],\"suffixes\":[]},{\"firstnames\":[\"Edward\"],\"propositions\":[],\"lastnames\":[\"Pierzchalski\"],\"suffixes\":[]},{\"firstnames\":[\"Nathan\"],\"propositions\":[],\"lastnames\":[\"Smyth\"],\"suffixes\":[]}],\"title\":\"Perentie: Modular Trace Refinement and Selective Value Tracking - (Competition Contribution)\",\"booktitle\":\"Tools and Algorithms for the Construction and Analysis of Systems - 21st International Conference, TACAS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015. Proceedings\",\"pages\":\"439–442\",\"year\":\"2015\",\"url\":\"http://dx.doi.org/10.1007/978-3-662-46681-0_39\",\"doi\":\"10.1007/978-3-662-46681-0_39\",\"publisher\":\"springv\",\"volume\":\"9035\",\"series\":\"lncs\",\"mywebpage\":\"soft-verif\",\"keywords\":\"refinement, software verification\",\"category\":\"soft-verif\",\"show\":\"\",\"urlpaper\":\"papers/sv-comp-2015.pdf\",\"abstract\":\"Perentie is a software analysis tool based on iterative refinement of trace abstraction: if the refinement process terminates, the program is either declared correct or a counterexample is provided and the program is incorrect.\",\"bibtex\":\"@inproceedings{tacas-15,\\nauthor    = {Franck Cassez and\\n               Takashi Matsuoka and\\n               Edward Pierzchalski and\\n               Nathan Smyth},\\n  title     = {Perentie: Modular Trace Refinement and Selective Value Tracking -\\n               (Competition Contribution)},\\n  booktitle = {Tools and Algorithms for the Construction and Analysis of Systems\\n               - 21st International Conference, {TACAS} 2015, Held as Part of the\\n               European Joint Conferences on Theory and Practice of Software, {ETAPS}\\n               2015, London, UK, April 11-18, 2015. Proceedings},\\n  pages     = {439--442},\\n  year      = {2015},\\n  url       = {http://dx.doi.org/10.1007/978-3-662-46681-0_39},\\n  doi       = {10.1007/978-3-662-46681-0_39},\\n  publisher = springv,\\n  volume = 9035,\\n  series    = lncs,\\n  mywebpage = {soft-verif},\\n  keywords = {refinement, software verification},\\n  category = {soft-verif},\\n  show = {},\\n  urlpaper = {papers/sv-comp-2015.pdf},\\n  abstract = {Perentie is a software analysis tool based on iterative refinement of trace abstraction:\\n  if the refinement process terminates, the program is either declared correct or a counterexample is\\n  provided and the program is incorrect.},\\n    Type = {B - International Conferences},\\n\\n}\\n\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n%%% 2014\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Matsuoka, T.\",\"Pierzchalski, E.\",\"Smyth, N.\"],\"key\":\"tacas-15\",\"id\":\"tacas-15\",\"bibbaseid\":\"cassez-matsuoka-pierzchalski-smyth-perentiemodulartracerefinementandselectivevaluetrackingcompetitioncontribution-2015\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/sv-comp-2015.pdf\"},\"keyword\":[\"refinement\",\"software verification\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"A - Journal\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Benattar\"],\"firstnames\":[\"Gilles\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Lime\"],\"firstnames\":[\"Didier\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Roux\"],\"firstnames\":[\"Olivier\",\"H.\"],\"suffixes\":[]}],\"title\":\"Control and Synthesis of Non-Interferent Timed Systems\",\"journal\":\"International Journal of Control\",\"volume\":\"88\",\"number\":\"2\",\"pages\":\"217–236\",\"year\":\"2015\",\"doi\":\"10.1080/00207179.2014.944356\",\"mywebpage\":\"timed\",\"urlpaper\":\"papers/ijc-2014.pdf\",\"ee\":\"http://www.tandfonline.com/eprint/h7nIKxnegMGR5M7EaeSF/full\",\"keywords\":\"security, non-interference\",\"category\":\"Non-interference\",\"abstract\":\"We focus on the control and the synthesis of secure timed systems which are modelled as timed automata. The security property that the system must satisfy is a non-interference property. Intuitively, non-interference ensures the absence of any causal dependency from a high-level domain to a lower level domain. Various notions of non-interference have been defined in the literature, and in this paper, we focus on strong non- deterministic non-interference (SNNI) and two (bi)simulation-based variants thereof (cosimulation-based SNNI and bisimulation-based SNNI). These properties and their extensions have been mostly studied in the context of discrete event systems, while it is now well-known that time is an important attack vector against secure systems. At the same time, there is an obvious interest in going beyond simple verification to control problems: to be able to automatically make systems secure. We consider non-interference properties in the challenging setting of control of dense-time systems specified by timed automata and we study the two following problems: (1) check whether it is possible to find a sub-system so that it is non- interferent; if yes, (2) compute a (largest) sub- system which is non- interferent. We exhibit decidable sub-classes for these problems, assess their theoretical complexities and provide effective algorithms based on the classical framework of timed games.\",\"bibtex\":\"@article{ijc-14,\\nauthor = {Benattar, Gilles and Franck Cassez and Lime, Didier\\nand Roux, Olivier H.},\\ntitle = {Control and Synthesis of Non-Interferent Timed\\nSystems},\\nType = {A - Journal},\\njournal = {International Journal of Control}, \\nvolume = {88}, \\nnumber =\\n{2},\\npages = {217--236},\\nyear = {2015},\\ndoi = {10.1080/00207179.2014.944356},\\nmywebpage = {timed},\\nurlpaper = {papers/ijc-2014.pdf},\\nee = {http://www.tandfonline.com/eprint/h7nIKxnegMGR5M7EaeSF/full},\\nkeywords = {security, non-interference},\\ncategory = {Non-interference},\\nabstract = {We focus on the control and the\\nsynthesis of secure timed systems which are modelled as timed automata. The\\nsecurity property that the system must satisfy is a non-interference property.\\nIntuitively, non-interference ensures the absence of any causal dependency from\\na high-level domain to a lower level domain. Various notions of non-interference\\nhave been defined in the literature, and in this paper, we focus on strong non-\\ndeterministic non-interference (SNNI) and two (bi)simulation-based variants\\nthereof (cosimulation-based SNNI and bisimulation-based SNNI). These properties\\nand their extensions have been mostly studied in the context of discrete event\\nsystems, while it is now well-known that time is an important attack vector\\nagainst secure systems. At the same time, there is an obvious interest in going\\nbeyond simple verification to control problems: to be able to automatically make\\nsystems secure. We consider non-interference properties in the challenging\\nsetting of control of dense-time systems specified by timed automata and we\\nstudy the two following problems: (1) check whether it is possible to find a\\nsub-system so that it is non- interferent; if yes, (2) compute a (largest) sub-\\nsystem which is non- interferent. We exhibit decidable sub-classes for these\\nproblems, assess their theoretical complexities and provide effective algorithms\\nbased on the classical framework of timed games.}\\n}\\n\\n\\n\\n\\n\",\"author_short\":[\"Benattar, G.\",\"Cassez, F.\",\"Lime, D.\",\"Roux, O. H.\"],\"key\":\"ijc-14\",\"id\":\"ijc-14\",\"bibbaseid\":\"benattar-cassez-lime-roux-controlandsynthesisofnoninterferenttimedsystems-2015\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/ijc-2014.pdf\",\"Link\":\"http://www.tandfonline.com/eprint/h7nIKxnegMGR5M7EaeSF/full\"},\"keyword\":[\"security\",\"non-interference\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"proceedings\",\"type\":\"D - Conference Proceedings\",\"editor\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Jean-François\"],\"propositions\":[],\"lastnames\":[\"Raskin\"],\"suffixes\":[]}],\"title\":\"Automated Technology for Verification and Analysis - 12th International Symposium, ATVA 2014, Sydney, NSW, Australia, November 3-7, 2014, Proceedings\",\"series\":\"lncs\",\"volume\":\"8837\",\"publisher\":\"springv\",\"year\":\"2014\",\"url\":\"http://dx.doi.org/10.1007/978-3-319-11936-6\",\"doi\":\"10.1007/978-3-319-11936-6\",\"show\":\"\",\"category\":\"Proceedings (Editor)\",\"isbn\":\"978-3-319-11935-9\",\"bibtex\":\"@proceedings{atva-14,\\n  editor    = {Franck Cassez and\\n               Jean-François Raskin},\\n  title     = {Automated Technology for Verification and Analysis - 12th International\\n               Symposium, {ATVA} 2014, Sydney, NSW, Australia, November 3-7, 2014,\\n               Proceedings},\\n  series    = lncs,\\n  volume    = {8837},\\n  publisher = springv,\\n  year      = {2014},\\n  url       = {http://dx.doi.org/10.1007/978-3-319-11936-6},\\n  doi       = {10.1007/978-3-319-11936-6},\\n  show = {},\\n  category = {Proceedings (Editor)},\\n  isbn      = {978-3-319-11935-9},\\n  Type = {D - Conference Proceedings},\\n}\\n\\n\\n\\n\\n\",\"editor_short\":[\"Cassez, F.\",\"Raskin, J.\"],\"key\":\"atva-14\",\"id\":\"atva-14\",\"bibbaseid\":\"cassez-raskin-automatedtechnologyforverificationandanalysis12thinternationalsymposiumatva2014sydneynswaustralianovember372014proceedings-2014\",\"role\":\"editor\",\"urls\":{\"Paper\":\"http://dx.doi.org/10.1007/978-3-319-11936-6\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Christian\"],\"propositions\":[],\"lastnames\":[\"Müller\"],\"suffixes\":[]},{\"firstnames\":[\"Karla\"],\"propositions\":[],\"lastnames\":[\"Burnett\"],\"suffixes\":[]}],\"title\":\"Summary-Based Inter-Procedural Analysis via Modular Trace Refinement\",\"booktitle\":\"34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, December 15-17, 2014, New Delhi, India\",\"pages\":\"545–556\",\"year\":\"2014\",\"mywebpage\":\"soft-verif\",\"category\":\"Software verification\",\"keywords\":\"trace refinement, software verification, Hoare logic\",\"url_link\":\"http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2014.545\",\"doi\":\"10.4230/LIPIcs.FSTTCS.2014.545\",\"abstract\":\"We propose a generalisation of trace refinement for the verification of inter-procedural programs. Our method is a top-down modular, summary-based approach, and analyses inter-procedural programs by building function summaries on-demand and improving the summaries each time a function is analysed. Our method is sound, and complete relative to the existence of a modular Hoare proof for a non-recursive program. We have implemented a prototype analyser that demonstrates the main features of our approach and yields promising results. \",\"bibtex\":\"@inproceedings{fsttcs-14,\\n  author    = {Franck Cassez and\\n               Christian Müller and\\n               Karla Burnett},\\n  title     = {Summary-Based Inter-Procedural Analysis via Modular Trace Refinement},\\n  booktitle = {34th International Conference on Foundation of Software Technology\\n               and Theoretical Computer Science, {FSTTCS} 2014, December 15-17, 2014,\\n               New Delhi, India},\\n  pages     = {545--556},\\n  year      = {2014},\\n  mywebpage = {soft-verif},\\n  category = {Software verification},\\n  keywords = {trace refinement, software verification, Hoare logic},\\n  url_link       = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2014.545},\\n  doi       = {10.4230/LIPIcs.FSTTCS.2014.545},\\n  abstract = {We propose a generalisation of trace refinement for the verification of inter-procedural programs.\\n  Our method is a top-down modular, summary-based approach, and analyses inter-procedural programs by building function summaries on-demand\\n  and improving the summaries each time a function is analysed. Our method is sound, and complete relative to the existence of a\\n  modular Hoare proof for a non-recursive program. We have implemented a prototype analyser that demonstrates the\\n  main features of our approach and yields promising results.\\n  },\\n  Type = {B - International Conferences},\\n}\\n\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Müller, C.\",\"Burnett, K.\"],\"key\":\"fsttcs-14\",\"id\":\"fsttcs-14\",\"bibbaseid\":\"cassez-mller-burnett-summarybasedinterproceduralanalysisviamodulartracerefinement-2014\",\"role\":\"author\",\"urls\":{\" link\":\"http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2014.545\"},\"keyword\":[\"trace refinement\",\"software verification\",\"Hoare logic\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Romain\"],\"propositions\":[],\"lastnames\":[\"Brenguier\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Jean-François\"],\"propositions\":[],\"lastnames\":[\"Raskin\"],\"suffixes\":[]}],\"title\":\"Energy and mean-payoff timed games\",\"booktitle\":\"17th International Conference on Hybrid Systems: Computation and Control, HSCC'14\",\"year\":\"2014\",\"pages\":\"283-292\",\"urlpaper\":\"papers/hscc-2014.pdf\",\"url_link\":\"http://doi.acm.org/10.1145/2562059.2562116\",\"mywebpage\":\"timed\",\"show\":\"\",\"keywords\":\"hybrid, timed automata, games\",\"abstract\":\"In this paper, we study energy and mean-payoff timed games. The decision problems that consist in determining the existence of winning strategies in those games are undecidable, and we thus provide semi-algorithms for solving these strategy synthesis problems. We then identify a large class of timed games for which our semi-algorithms terminate and are thus complete. We also study in detail the relation between mean-payoff and energy timed games. Finally, we provide a symbolic algorithm to solve energy timed games and demonstrate its use on small examples using HyTech.\",\"bibtex\":\"@inproceedings{hscc-14,\\n  author    = {Romain Brenguier and\\n               Franck Cassez and\\n               Jean-François Raskin},\\n  title     = {Energy and mean-payoff timed games},\\n  booktitle = {17th International Conference on Hybrid Systems: Computation\\n               and Control, HSCC'14},\\n  year      = {2014},\\n  pages     = {283-292},\\n  urlpaper = {papers/hscc-2014.pdf},\\n  url_link     = {http://doi.acm.org/10.1145/2562059.2562116},\\n  mywebpage = {timed},\\n  show = {},\\n  keywords = {hybrid, timed automata, games},\\n  abstract = {In this paper, we study energy and mean-payoff timed games.\\n  The decision problems that consist in determining the existence of winning strategies in those games are undecidable,\\n  and we thus provide semi-algorithms for solving these strategy synthesis problems.\\n  We then identify a large class of timed games for which our semi-algorithms terminate and are thus complete.\\n  We also study in detail the relation between mean-payoff and energy timed games. Finally,\\n  we provide a symbolic algorithm to solve energy timed games and demonstrate its use on small examples using HyTech.},\\n  Type = {B - International Conferences},\\n\\n}\\n\\n\\n\\n\",\"author_short\":[\"Brenguier, R.\",\"Cassez, F.\",\"Raskin, J.\"],\"key\":\"hscc-14\",\"id\":\"hscc-14\",\"bibbaseid\":\"brenguier-cassez-raskin-energyandmeanpayofftimedgames-2014\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/hscc-2014.pdf\",\" link\":\"http://doi.acm.org/10.1145/2562059.2562116\"},\"keyword\":[\"hybrid\",\"timed automata\",\"games\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"E - Reports\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Ron\"],\"propositions\":[\"van\",\"der\"],\"lastnames\":[\"Meyden\"],\"suffixes\":[]},{\"firstnames\":[\"Chenyi\"],\"propositions\":[],\"lastnames\":[\"Zhang\"],\"suffixes\":[]}],\"title\":\"The Complexity of Synchronous Notions of Information Flow Security\",\"journal\":\"CoRR\",\"volume\":\"abs/1402.0601\",\"year\":\"2014\",\"url\":\"http://arxiv.org/abs/1402.0601\",\"timestamp\":\"Wed, 05 Mar 2014 14:43:44 +0100\",\"biburl\":\"http://dblp.uni-trier.de/rec/bib/journals/corr/CassezMZ14\",\"bibsource\":\"dblp computer science bibliography, http://dblp.org\",\"keywords\":\"security, non-interference, complexity\",\"show\":\"\",\"category\":\"Non-interference\",\"abstract\":\"The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one in which agents operate synchronously with awareness of the global clock. This enables timing based attacks to be captured, whereas previous work on this topic has dealt primarily with asynchronous systems. Versions of the notions of nondeducibility on inputs, nondeducibility on strategies, and an unwinding based notion are formulated for this model. All three notions are shown to be decidable, and their computational complexity is characterised. \",\"bibtex\":\"@article{DBLP:journals/corr/CassezMZ14,\\n  author    = {Franck Cassez and\\n               Ron van der Meyden and\\n               Chenyi Zhang},\\n  title     = {The Complexity of Synchronous Notions of Information Flow Security},\\n  journal   = {CoRR},\\n  Type = {E - Reports},\\n  volume    = {abs/1402.0601},\\n  year      = {2014},\\n  url       = {http://arxiv.org/abs/1402.0601},\\n  timestamp = {Wed, 05 Mar 2014 14:43:44 +0100},\\n  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/CassezMZ14},\\n  bibsource = {dblp computer science bibliography, http://dblp.org},\\n  keywords = {security, non-interference, complexity},\\n  show = {},\\n  category = {Non-interference},\\n  abstract = {The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one in which agents operate synchronously with awareness of the global clock. This enables timing based attacks to be captured, whereas previous work on this topic has dealt primarily with asynchronous systems. Versions of the notions of nondeducibility on inputs, nondeducibility on strategies, and an unwinding based notion are formulated for this model. All three notions are shown to be decidable, and their computational complexity is characterised.\\n  }\\n}\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n%%% 2013\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"van der Meyden, R.\",\"Zhang, C.\"],\"key\":\"DBLP:journals/corr/CassezMZ14\",\"id\":\"DBLP:journals/corr/CassezMZ14\",\"bibbaseid\":\"cassez-vandermeyden-zhang-thecomplexityofsynchronousnotionsofinformationflowsecurity-2014\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://arxiv.org/abs/1402.0601\"},\"keyword\":[\"security\",\"non-interference\",\"complexity\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inbook\",\"type\":\"C - Book Chapters\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Markey\"],\"firstnames\":[\"Nicolas\"],\"suffixes\":[]}],\"title\":\"Communicating Embedded Systems\",\"editor\":[{\"propositions\":[],\"lastnames\":[\"Jard\"],\"firstnames\":[\"Claude\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Roux\"],\"firstnames\":[\"Olivier\",\"H.\"],\"suffixes\":[]}],\"month\":\"February\",\"pages\":\"67–105\",\"publisher\":\"ISTE Ltd. – John Wiley &amp; Sons, Ltd\",\"chapter\":\"Control of Timed Systems\",\"url\":\"http://onlinelibrary.wiley.com/book/10.1002/9781118558188\",\"year\":\"2013\",\"note\":\"New edition, 2013\",\"doi\":\"10.1002/9781118558188\",\"isbn\":\"9781848211438\",\"keywords\":\"control, timed automata\",\"mywbepage\":\"timed\",\"abstract\":\"In this book Chapter we address the problem of controller synthesis for timed systems. By timed systems we refer to systems which are subject to quantitative (hard) real-time constraints. We assume the reader is familiar with the basics of Timed Automata theory, or has read Chapter 1 and Chapter 2 in this book. \",\"bibtex\":\"@inbook{cassez-control-iste-2013,\\n   author = {Franck Cassez and Markey, Nicolas},\\n   title = {Communicating Embedded Systems},\\n   editor = {Jard, Claude and Roux, Olivier H.},\\n   month = feb,\\n   pages = {67--105},\\n   publisher = {ISTE Ltd. -- John Wiley \\\\&amp; Sons, Ltd},\\n   chapter = {Control of Timed Systems},\\n  url = {http://onlinelibrary.wiley.com/book/10.1002/9781118558188},\\n   year = {2013},\\n   note = {New edition, 2013},\\n   doi = {10.1002/9781118558188},\\n   isbn = {9781848211438},\\n   keywords = {control, timed automata},\\n  mywbepage = {timed},\\nabstract={In this book Chapter we address the problem of controller synthesis for timed systems. By\\ntimed systems we refer to systems which are subject to quantitative (hard) real-time\\nconstraints. We assume the reader is familiar with the basics of Timed Automata\\ntheory, or has read Chapter 1 and Chapter 2 in this book. },\\n  Type = {C - Book Chapters},\\n\\n}\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Markey, N.\"],\"editor_short\":[\"Jard, C.\",\"Roux, O. H.\"],\"key\":\"cassez-control-iste-2013\",\"id\":\"cassez-control-iste-2013\",\"bibbaseid\":\"cassez-markey-communicatingembeddedsystems-2013\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://onlinelibrary.wiley.com/book/10.1002/9781118558188\"},\"keyword\":[\"control\",\"timed automata\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inbook\",\"type\":\"C - Book Chapters\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tripakis\"],\"firstnames\":[\"Stavros\"],\"suffixes\":[]}],\"title\":\"Communicating Embedded Systems\",\"editor\":[{\"propositions\":[],\"lastnames\":[\"Jard\"],\"firstnames\":[\"Claude\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Roux\"],\"firstnames\":[\"Olivier\",\"H.\"],\"suffixes\":[]}],\"month\":\"February\",\"pages\":\"107–138\",\"publisher\":\"ISTE Ltd. – John Wiley &amp; Sons, Ltd\",\"chapter\":\"Fault Diagnosis of Timed Systems\",\"keywords\":\"diagnosis, timed automata\",\"mywbepage\":\"timed\",\"url\":\"http://onlinelibrary.wiley.com/book/10.1002/9781118558188\",\"year\":\"2013\",\"note\":\"New edition, 2013\",\"doi\":\"10.1002/9781118558188\",\"isbn\":\"9781848211438\",\"abstract\":\"In this book Chapter, we review the main results pertaining to the problem of fault diagnosis of timed automata. Timed automata are introduced in Chapter 1 and Chapter 2 in this book, and the reader not familiar with this model is invited to read them first.\",\"bibtex\":\"@inbook{cassez-diag-iste-2013,\\n   author = {Franck Cassez and Tripakis, Stavros},\\n   title = {Communicating Embedded Systems},\\n   editor = {Jard, Claude and Roux, Olivier H.},\\n   month = feb,\\n   pages = {107--138},\\n   publisher = {ISTE Ltd. -- John Wiley \\\\&amp; Sons, Ltd},\\n   chapter = {Fault Diagnosis of Timed Systems},\\n   keywords = {diagnosis, timed automata},\\n  mywbepage = {timed},\\n  url = {http://onlinelibrary.wiley.com/book/10.1002/9781118558188},\\n   year = {2013},\\n      note = {New edition, 2013},\\n    doi = {10.1002/9781118558188},\\n   isbn = {9781848211438},\\nabstract={In this book Chapter, we review the main results pertaining\\n                  to the problem of fault diagnosis of timed\\n                  automata. Timed automata are introduced in Chapter 1\\n                  and Chapter 2 in this book, and the reader not\\n                  familiar with this model is invited to read them\\n                  first.},\\n                    Type = {C - Book Chapters},\\n\\n}\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Tripakis, S.\"],\"editor_short\":[\"Jard, C.\",\"Roux, O. H.\"],\"key\":\"cassez-diag-iste-2013\",\"id\":\"cassez-diag-iste-2013\",\"bibbaseid\":\"cassez-tripakis-communicatingembeddedsystems-2013\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://onlinelibrary.wiley.com/book/10.1002/9781118558188\"},\"keyword\":[\"diagnosis\",\"timed automata\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Alban\"],\"propositions\":[],\"lastnames\":[\"Grastien\"],\"suffixes\":[]}],\"title\":\"Predictability of Event Occurrences in Timed Systems\",\"booktitle\":\"Formal Modeling and Analysis of Timed Systems - 11th International Conference, FORMATS 2013, Buenos Aires, Argentina, August 29-31, 2013. Proceedings\",\"pages\":\"62–76\",\"year\":\"2013\",\"urlpaper\":\"papers/formats-2013.pdf\",\"urlslides\":\"papers/slides-formats-2013.pdf\",\"url_link\":\"http://dx.doi.org/10.1007/978-3-642-40229-6_5\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"8053\",\"publisher\":\"Springer\",\"doi\":\"10.1007/978-3-642-40229-6_5\",\"show\":\"\",\"keywords\":\"predictability, diagnosis, timed automata\",\"mywbepage\":\"timed\",\"category\":\"Fault diagnosis\",\"abstract\":\"We address the problem of predicting events' occurrences in partially observable timed systems modelled by timed automata. Our contribution is many-fold: 1) we give a definition of bounded predictability, namely k-predictability, that takes into account the minimum delay between the prediction and the actual event's occurrence; 2) we show that 0-predictability is equivalent to the original notion of predictability of S. Genc and S. Lafortune; 3) we provide a necessary and sufficient condition for k-predictability (which is very similar to k-diagnosability) and give a simple algorithm to check k-predictability; 4) we address the problem of predictability of events' occurrences in timed automata and show that the problem is PSPACE-complete. \",\"bibtex\":\"@inproceedings{cassez-formats-2013,\\n  author    = {Franck Cassez and\\n               Alban Grastien},\\n  title     = {Predictability of Event Occurrences in Timed Systems},\\n  booktitle = {Formal Modeling and Analysis of Timed Systems - 11th International\\n               Conference, {FORMATS} 2013, Buenos Aires, Argentina, August 29-31,\\n               2013. Proceedings},\\n  pages     = {62--76},\\n  year      = {2013},\\n  urlpaper = {papers/formats-2013.pdf},\\n  urlslides = {papers/slides-formats-2013.pdf},\\n   url_link       = {http://dx.doi.org/10.1007/978-3-642-40229-6_5},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {8053},\\n  publisher = {Springer},\\n  doi       = {10.1007/978-3-642-40229-6_5},\\n  show = {},\\n  keywords = {predictability, diagnosis, timed automata},\\n  mywbepage = {timed},\\n  category = {Fault diagnosis},\\n  abstract = {\\n    We address the problem of predicting events' occurrences in partially observable timed systems modelled by timed automata. Our contribution is many-fold: 1) we give a definition of bounded predictability, namely k-predictability, that takes into account the minimum delay between the prediction and the actual event's occurrence; 2) we show that 0-predictability is equivalent to the original notion of predictability of S. Genc and S. Lafortune; 3) we provide a necessary and sufficient condition for k-predictability (which is very similar to k-diagnosability) and give a simple algorithm to check k-predictability; 4) we address the problem of predictability of events' occurrences in timed automata and show that the problem is PSPACE-complete.\\n  },\\n   Type = {B - International Conferences},\\n\\n}\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Grastien, A.\"],\"key\":\"cassez-formats-2013\",\"id\":\"cassez-formats-2013\",\"bibbaseid\":\"cassez-grastien-predictabilityofeventoccurrencesintimedsystems-2013\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/formats-2013.pdf\",\"Slides\":\"https://franck44.github.io/publications/papers/slides-formats-2013.pdf\",\" link\":\"http://dx.doi.org/10.1007/978-3-642-40229-6_5\"},\"keyword\":[\"predictability\",\"diagnosis\",\"timed automata\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Sebastian\"],\"propositions\":[],\"lastnames\":[\"Biallas\"],\"suffixes\":[]},{\"firstnames\":[\"Mads\",\"Chr.\"],\"propositions\":[],\"lastnames\":[\"Olesen\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Ralf\"],\"propositions\":[],\"lastnames\":[\"Huuck\"],\"suffixes\":[]}],\"title\":\"PtrTracker: Pragmatic pointer analysis\",\"booktitle\":\"13th IEEE International Working Conference on Source Code Analysis and Manipulation, SCAM 2013, Eindhoven, Netherlands, September 22-23, 2013\",\"pages\":\"69–73\",\"year\":\"2013\",\"publisher\":\"IEEE Computer Society\",\"urlpaper\":\"papers/scam-2013.pdf\",\"url_link\":\"http://dx.doi.org/10.1109/SCAM.2013.6648186\",\"doi\":\"10.1109/SCAM.2013.6648186\",\"keywords\":\"Software verification, pointers, static analysis\",\"mywebpage\":\"soft-verif\",\"category\":\"Software verification\",\"abstract\":\"Static program analysis for bug detection in industrial C/C++ code has many challenges. One of them is to analyze pointer and pointer structures efficiently. While there has been much research into various aspects of pointer analysis either for compiler optimization or for verification tasks, both classical categories are not optimized for bug detection, where speed and precision are important, but soundness (no missed bugs) and completeness (no false positives) do not necessarily need to be guaranteed. \",\"bibtex\":\"@inproceedings{scam-2013,\\n  author    = {Sebastian Biallas and\\n               Mads Chr. Olesen and\\n               Franck Cassez and\\n               Ralf Huuck},\\n  title     = {PtrTracker: Pragmatic pointer analysis},\\n  booktitle = {13th {IEEE} International Working Conference on Source Code Analysis\\n               and Manipulation, {SCAM} 2013, Eindhoven, Netherlands, September 22-23,\\n               2013},\\n  pages     = {69--73},\\n  year      = {2013},\\n  publisher = {{IEEE} Computer Society},\\n  urlpaper = {papers/scam-2013.pdf},\\n  url_link       = {http://dx.doi.org/10.1109/SCAM.2013.6648186},\\n  doi       = {10.1109/SCAM.2013.6648186},\\n  keywords = {Software verification, pointers, static analysis},\\n  mywebpage = {soft-verif},\\n  category = {Software verification},\\n  abstract = {\\n  Static program analysis for bug detection in industrial C/C++ code has many challenges. One of them is to analyze pointer and pointer structures efficiently. While there has been much research into various aspects of pointer analysis either for compiler optimization or for verification tasks, both classical categories are not optimized for bug detection, where speed and precision are important, but soundness (no missed bugs) and completeness (no false positives) do not necessarily need to be guaranteed.\\n  },\\n    Type = {B - International Conferences},\\n}\\n\\n\\n\\n\",\"author_short\":[\"Biallas, S.\",\"Olesen, M. C.\",\"Cassez, F.\",\"Huuck, R.\"],\"key\":\"scam-2013\",\"id\":\"scam-2013\",\"bibbaseid\":\"biallas-olesen-cassez-huuck-ptrtrackerpragmaticpointeranalysis-2013\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/scam-2013.pdf\",\" link\":\"http://dx.doi.org/10.1109/SCAM.2013.6648186\"},\"keyword\":[\"Software verification\",\"pointers\",\"static analysis\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"E - Reports\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Alban\"],\"propositions\":[],\"lastnames\":[\"Grastien\"],\"suffixes\":[]}],\"title\":\"Predictability of Event Occurrences in Timed Systems\",\"journal\":\"CoRR\",\"volume\":\"abs/1306.0662\",\"year\":\"2013\",\"url\":\"http://arxiv.org/abs/1306.0662\",\"timestamp\":\"Mon, 01 Jul 2013 20:31:24 +0200\",\"biburl\":\"http://dblp.uni-trier.de/rec/bib/journals/corr/CassezG13\",\"bibsource\":\"dblp computer science bibliography, http://dblp.org\",\"category\":\"Fault diagnosis\",\"abstract\":\"We address the problem of predicting events' occurrences in partially observable timed systems modelled by timed automata. Our contribution is many-fold: 1) we give a definition of bounded predictability, namely k-predictability, that takes into account the minimum delay between the prediction and the actual event's occurrence; 2) we show that 0-predictability is equivalent to the original notion of predictability of S. Genc and S. Lafortune; 3) we provide a necessary and sufficient condition for k-predictability (which is very similar to k-diagnosability) and give a simple algorithm to check k-predictability; 4) we address the problem of predictability of events' occurrences in timed automata and show that the problem is PSPACE-complete. \",\"mywebpage\":\"\",\"bibtex\":\"@article{DBLP:journals/corr/CassezG13,\\n  author    = {Franck Cassez and\\n               Alban Grastien},\\n  title     = {Predictability of Event Occurrences in Timed Systems},\\n  journal   = {CoRR},\\n  Type = {E - Reports},\\n  volume    = {abs/1306.0662},\\n  year      = {2013},\\n  url       = {http://arxiv.org/abs/1306.0662},\\n  timestamp = {Mon, 01 Jul 2013 20:31:24 +0200},\\n  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/CassezG13},\\n  bibsource = {dblp computer science bibliography, http://dblp.org},\\n  category = {Fault diagnosis},\\n  abstract = {\\n  We address the problem of predicting events' occurrences in partially observable timed systems modelled by timed automata. Our contribution is many-fold: 1) we give a definition of bounded predictability, namely k-predictability, that takes into account the minimum delay between the prediction and the actual event's occurrence; 2) we show that 0-predictability is equivalent to the original notion of predictability of S. Genc and S. Lafortune; 3) we provide a necessary and sufficient condition for k-predictability (which is very similar to k-diagnosability) and give a simple algorithm to check k-predictability; 4) we address the problem of predictability of events' occurrences in timed automata and show that the problem is PSPACE-complete.\\n  },\\n  mywebpage = {}\\n}\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Grastien, A.\"],\"key\":\"DBLP:journals/corr/CassezG13\",\"id\":\"DBLP:journals/corr/CassezG13\",\"bibbaseid\":\"cassez-grastien-predictabilityofeventoccurrencesintimedsystems-2013\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://arxiv.org/abs/1306.0662\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"A - Journal\",\"author\":[{\"firstnames\":[\"Béatrice\"],\"propositions\":[],\"lastnames\":[\"Bérard\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Serge\"],\"propositions\":[],\"lastnames\":[\"Haddad\"],\"suffixes\":[]},{\"firstnames\":[\"Didier\"],\"propositions\":[],\"lastnames\":[\"Lime\"],\"suffixes\":[]},{\"firstnames\":[\"Olivier\",\"H.\"],\"propositions\":[],\"lastnames\":[\"Roux\"],\"suffixes\":[]}],\"title\":\"The expressive power of time Petri nets\",\"journal\":\"Theoretical Computer Science\",\"volume\":\"474\",\"year\":\"2013\",\"pages\":\"1-20\",\"doi\":\"http://dx.doi.org/10.1016/j.tcs.2012.12.005\",\"bibsource\":\"DBLP, http://dblp.uni-trier.de\",\"category\":\"Timed Petri nets\",\"mywebpage\":\"timed\",\"keywords\":\"time petri nets, timed automata\",\"urlpaper\":\"papers/tcs-2013.pdf\",\"abstract\":\"We investigate expressiveness questions for time Petri nets (TPNs) and some of their most useful extensions. We first introduce generalised time Petri nets (GTPNs) as an abstract model that encompasses variants of TPNs such as self modifications and read, reset and inhibitor arcs. We give a syntactical translation from bounded GTPNs to timed automata (TA) that generates isomorphic transition systems. We prove that the class of bounded GTPNs is strictly l ess expressive than TA w.r.t. weak timed bisimilarity. We prove that bounded GTPNs, bounded TPNs and TA are equally expressive w.r.t. timed language acceptance. Finally, we characterise a syntactical subclass of TA that is equally expressive to bounded GTPNs \\\"á la Merlin\\\" w.r.t. weak timed bisimilarity. These results provide a unified comparison of the expressiveness of many variants of timed models often used in practice. It leads to new important results for TPNs. Among them are: 1-safe TPNs and bounded-TPNs are equally expressive; $ε$-transitions strictly increase the expressive power of TPNs; self modifying nets as well as read, inhibitor and reset arcs do not add expressiveness to bounded TPNs. \",\"bibtex\":\"@article{tpn-13,\\n  author    = {Béatrice Bérard and\\n               Franck Cassez and\\n               Serge Haddad and\\n               Didier Lime and\\n               Olivier H. Roux},\\n  title     = {The expressive power of time {Petri} nets},\\n  journal   =  {Theoretical Computer Science},\\n  Type = {A - Journal},\\n  volume    = {474},\\n  year      = {2013},\\n  pages     = {1-20},\\n  doi        = {http://dx.doi.org/10.1016/j.tcs.2012.12.005},\\n  bibsource = {DBLP, http://dblp.uni-trier.de},\\n  category= {Timed Petri nets},\\n  mywebpage = {timed},\\n  keywords = {time petri nets, timed automata},\\n  urlpaper = {papers/tcs-2013.pdf},\\n  abstract = {We investigate expressiveness questions for time Petri nets (TPNs)\\n  and some of their most useful extensions. We first introduce generalised time Petri nets (GTPNs)\\n  as an abstract model that encompasses variants of TPNs such as self modifications and read, reset and inhibitor arcs.\\nWe give a syntactical translation from bounded GTPNs to timed automata (TA)\\nthat generates isomorphic transition systems. We prove that the class of bounded GTPNs is strictly l\\ness expressive than TA w.r.t. weak timed bisimilarity.\\nWe prove that bounded GTPNs, bounded TPNs and TA are equally expressive w.r.t. timed language acceptance.\\nFinally, we characterise a syntactical subclass of TA that is equally expressive to bounded GTPNs \\\"á la Merlin\\\" w.r.t.\\nweak timed bisimilarity. These results provide a unified comparison of the expressiveness of\\nmany variants of timed models often used in practice. It leads to new important results for TPNs.\\nAmong them are: 1-safe TPNs and bounded-TPNs are equally expressive; $\\\\epsilon$-transitions strictly\\nincrease the expressive power of TPNs; self modifying nets as well as read,\\ninhibitor and reset arcs do not add expressiveness to bounded TPNs.\\n}\\n}\\n\\n\\n\\n\\n\",\"author_short\":[\"Bérard, B.\",\"Cassez, F.\",\"Haddad, S.\",\"Lime, D.\",\"Roux, O. H.\"],\"key\":\"tpn-13\",\"id\":\"tpn-13\",\"bibbaseid\":\"brard-cassez-haddad-lime-roux-theexpressivepoweroftimepetrinets-2013\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/tcs-2013.pdf\"},\"keyword\":[\"time petri nets\",\"timed automata\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Jean-Luc\"],\"propositions\":[],\"lastnames\":[\"Béchennec\"],\"suffixes\":[]}],\"title\":\"Timing Analysis of Binary Programs with UPPAAL\",\"booktitle\":\"13th International Conference on Application of Concurrency to System Design, ACSD 2013\",\"year\":\"2013\",\"month\":\"July\",\"pages\":\"41-50\",\"publisher\":\"IEEE Computer Society\",\"urlpaper\":\"papers/acsd-2013.pdf\",\"urlslides\":\"papers/slides-acsd-wcet-2013.pdf\",\"doi\":\"http://dx.doi.org/10.1109/ACSD.2013.7\",\"mywebpage\":\"wcet\",\"show\":\"\",\"keywords\":\"wcet, timed automata\",\"abstract\":\"We address the problem of computing accurate Worst-Case Execution Time (WCET). We propose a fully automatic and modular methodology based on program slicing and real-time model-checking. We have implemented our methodology and applied it to standard benchmarks. To further validate the approach, we also compare our results to the real execution times of the programs measured on a real board. \",\"bibtex\":\"@inproceedings{cassez-acsd-13,\\n  author    = {Franck Cassez and\\n               {Jean-Luc} Béchennec},\\n  title     = {Timing Analysis of Binary Programs with {UPPAAL}},\\n  booktitle = {13th International Conference on Application of Concurrency\\n               to System Design, ACSD 2013},\\n  year      = {2013},\\n  month = jul,\\n  pages     = {41-50},\\n    PUBLISHER = {IEEE Computer Society},\\n  urlpaper = {papers/acsd-2013.pdf},\\n  urlslides = {papers/slides-acsd-wcet-2013.pdf},\\n  doi       = {http://dx.doi.org/10.1109/ACSD.2013.7},\\n  mywebpage = {wcet},\\n  show = {},\\n  keywords = {wcet, timed automata},\\n  abstract = {\\n  We address the problem of computing accurate Worst-Case Execution Time (WCET). We propose a fully automatic and modular methodology based on program slicing and real-time model-checking. We have implemented our methodology and applied it to standard benchmarks. To further validate the approach, we also compare our results to the real execution times of the programs measured on a real board.\\n  },\\n      Type = {B - International Conferences},\\n\\n}\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n%%% 2012\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Béchennec, J.\"],\"key\":\"cassez-acsd-13\",\"id\":\"cassez-acsd-13\",\"bibbaseid\":\"cassez-bchennec-timinganalysisofbinaryprogramswithuppaal-2013\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/acsd-2013.pdf\",\"Slides\":\"https://franck44.github.io/publications/papers/slides-acsd-wcet-2013.pdf\"},\"keyword\":[\"wcet\",\"timed automata\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"downloads\":3,\"html\":\"\"},{\"bibtype\":\"proceedings\",\"type\":\"D - Conference Proceedings\",\"editor\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Ralf\"],\"propositions\":[],\"lastnames\":[\"Huuck\"],\"suffixes\":[]},{\"firstnames\":[\"Gerwin\"],\"propositions\":[],\"lastnames\":[\"Klein\"],\"suffixes\":[]},{\"firstnames\":[\"Bastian\"],\"propositions\":[],\"lastnames\":[\"Schlich\"],\"suffixes\":[]}],\"title\":\"Proceedings Seventh Conference on Systems Software Verification, SSV 2012, Sydney, Australia, 28-30 November 2012\",\"series\":\"EPTCS\",\"volume\":\"102\",\"year\":\"2012\",\"url\":\"http://dx.doi.org/10.4204/EPTCS.102\",\"doi\":\"10.4204/EPTCS.102\",\"category\":\"Proceedings (Editor)\",\"mywebpage\":\"\",\"show\":\"\",\"keywords\":\"Proceedings\",\"bibtex\":\"@proceedings{ssv-12,\\n  editor    = {Franck Cassez and\\n               Ralf Huuck and\\n               Gerwin Klein and\\n               Bastian Schlich},\\n  title     = {Proceedings Seventh Conference on Systems Software Verification, {SSV}\\n               2012, Sydney, Australia, 28-30 November 2012},\\n  series    = {{EPTCS}},\\n  volume    = {102},\\n  year      = {2012},\\n  url       = {http://dx.doi.org/10.4204/EPTCS.102},\\n  doi       = {10.4204/EPTCS.102},\\n  category= {Proceedings (Editor)},\\n  mywebpage = {},\\n  show = {},\\n  keywords = {Proceedings},\\n      Type = {D - Conference Proceedings},\\n}\\n\\n\\n\\n\",\"editor_short\":[\"Cassez, F.\",\"Huuck, R.\",\"Klein, G.\",\"Schlich, B.\"],\"key\":\"ssv-12\",\"id\":\"ssv-12\",\"bibbaseid\":\"cassez-huuck-klein-schlich-proceedingsseventhconferenceonsystemssoftwareverificationssv2012sydneyaustralia2830november2012-2012\",\"role\":\"editor\",\"urls\":{\"Paper\":\"http://dx.doi.org/10.4204/EPTCS.102\"},\"keyword\":[\"Proceedings\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"René\",\"Rydhof\"],\"propositions\":[],\"lastnames\":[\"Hansen\"],\"suffixes\":[]},{\"firstnames\":[\"Mads\",\"Chr.\"],\"propositions\":[],\"lastnames\":[\"Olesen\"],\"suffixes\":[]}],\"title\":\"What is a Timing Anomaly?\",\"booktitle\":\"12th International Workshop on Worst-Case Execution Time Analysis, WCET 2012, July 10, 2012, Pisa, Italy\",\"year\":\"2012\",\"pages\":\"1-12\",\"urlpaper\":\"papers/wcet-2012.pdf\",\"url_link\":\"http://dx.doi.org/10.4230/OASIcs.WCET.2012.1\",\"abstract\":\"Timing anomalies make worst-case execution time analysis much harder, because the analysis will have to consider all local choices. It has been widely recognised that certain hardware features are timing anomalous, while others are not. However, defining formally what a timing anomaly is, has been difficult. We examine previous definitions of timing anomalies, and identify examples where they do not align with common observations. We then provide a definition for consistently slower hardware traces that can be used to define timing anomalies and aligns with common observations.\",\"category\":\"wcet\",\"mywebpage\":\"soft-verif,wcet\",\"keywords\":\"wcet\",\"publisher\":\"Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik\",\"series\":\"OASICS\",\"volume\":\"23\",\"bibtex\":\"@inproceedings{wcet-12,\\n  author    = {Franck Cassez and\\n               René Rydhof Hansen and\\n               Mads Chr. Olesen},\\n  title     = {What is a Timing Anomaly?},\\n  booktitle = {12th International Workshop on Worst-Case Execution Time\\n               Analysis, WCET 2012, July 10, 2012, Pisa, Italy},\\n  year      = {2012},\\n  pages     = {1-12},\\n  urlpaper = {papers/wcet-2012.pdf},\\n  url_link        = {http://dx.doi.org/10.4230/OASIcs.WCET.2012.1},\\n  abstract = {Timing anomalies make worst-case execution time analysis much harder, because the analysis will have to consider all local choices. It has been widely recognised that certain hardware features are timing anomalous, while others are not. However, defining formally what a timing anomaly is, has been difficult. We examine previous definitions of timing anomalies, and identify examples where they do not align with common observations. We then provide a definition for consistently slower hardware traces that can be used to define timing anomalies and aligns with common observations.},\\n  category= {wcet},\\n  mywebpage = {soft-verif,wcet},\\n  keywords = {wcet},\\n   publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},\\n  series    = {OASICS},\\n  volume    = {23},\\n        Type = {B - International Conferences},\\n\\n}\\n\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Hansen, R. R.\",\"Olesen, M. C.\"],\"key\":\"wcet-12\",\"id\":\"wcet-12\",\"bibbaseid\":\"cassez-hansen-olesen-whatisatiminganomaly-2012\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/wcet-2012.pdf\",\" link\":\"http://dx.doi.org/10.4230/OASIcs.WCET.2012.1\"},\"keyword\":[\"wcet\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Peter\",\"E.\"],\"propositions\":[],\"lastnames\":[\"Bulychev\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Alexandre\"],\"propositions\":[],\"lastnames\":[\"David\"],\"suffixes\":[]},{\"firstnames\":[\"Kim\",\"Guldstrand\"],\"propositions\":[],\"lastnames\":[\"Larsen\"],\"suffixes\":[]},{\"firstnames\":[\"Jean-François\"],\"propositions\":[],\"lastnames\":[\"Raskin\"],\"suffixes\":[]},{\"firstnames\":[\"Pierre-Alain\"],\"propositions\":[],\"lastnames\":[\"Reynier\"],\"suffixes\":[]}],\"title\":\"Controllers with Minimal Observation Power (Application to Timed Systems)\",\"booktitle\":\"Automated Technology for Verification and Analysis - 10th International Symposium, ATVA 2012\",\"year\":\"2012\",\"pages\":\"223-237\",\"urlpaper\":\"papers/atva-2012.pdf\",\"url_link\":\"http://dx.doi.org/10.1007/978-3-642-33386-6_19\",\"mywebpage\":\"timed\",\"keywords\":\"timed automata, timed games, control\",\"abstract\":\"We consider the problem of controller synthesis under imperfect information in a setting where there is a set of available observable predicates equipped with a cost function. The problem that we address is the computation of a subset of predicates sufficient for control and whose cost is minimal. Our solution avoids a full exploration of all possible subsets of predicates and reuses some information between different iterations. We apply our approach to timed systems. We have developed a tool prototype and analyze the performance of our optimization algorithm on two case studies. \",\"bibtex\":\"@inproceedings{atva-12,\\n  author    = {Peter E. Bulychev and\\n               Franck Cassez and\\n               Alexandre David and\\n               Kim Guldstrand Larsen and\\n               Jean-François Raskin and\\n               Pierre-Alain Reynier},\\n  title     = {Controllers with Minimal Observation Power (Application\\n               to Timed Systems)},\\n  booktitle = {Automated Technology for Verification and Analysis - 10th\\n               International Symposium, ATVA 2012},\\n  year      = {2012},\\n  pages     = {223-237},\\n  urlpaper = {papers/atva-2012.pdf},\\n  url_link  = {http://dx.doi.org/10.1007/978-3-642-33386-6_19},\\n  mywebpage = {timed},\\n  keywords = {timed automata, timed games, control},\\n  abstract = {\\n  We consider the problem of controller synthesis under imperfect information in a setting where there is a set of available observable predicates equipped with a cost function. The problem that we address is the computation of a subset of predicates sufficient for control and whose cost is minimal. Our solution avoids a full exploration of all possible subsets of predicates and reuses some information between different iterations. We apply our approach to timed systems. We have developed a tool prototype and analyze the performance of our optimization algorithm on two case studies.\\n  },\\n        Type = {B - International Conferences},\\n\\n}\\n\\n\\n\\n\",\"author_short\":[\"Bulychev, P. E.\",\"Cassez, F.\",\"David, A.\",\"Larsen, K. G.\",\"Raskin, J.\",\"Reynier, P.\"],\"key\":\"atva-12\",\"id\":\"atva-12\",\"bibbaseid\":\"bulychev-cassez-david-larsen-raskin-reynier-controllerswithminimalobservationpowerapplicationtotimedsystems-2012\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/atva-2012.pdf\",\" link\":\"http://dx.doi.org/10.1007/978-3-642-33386-6_19\"},\"keyword\":[\"timed automata\",\"timed games\",\"control\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"E - Reports\",\"author\":[{\"firstnames\":[\"Peter\",\"E.\"],\"propositions\":[],\"lastnames\":[\"Bulychev\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Alexandre\"],\"propositions\":[],\"lastnames\":[\"David\"],\"suffixes\":[]},{\"firstnames\":[\"Kim\",\"G.\"],\"propositions\":[],\"lastnames\":[\"Larsen\"],\"suffixes\":[]},{\"firstnames\":[\"Jean-François\"],\"propositions\":[],\"lastnames\":[\"Raskin\"],\"suffixes\":[]},{\"firstnames\":[\"Pierre-Alain\"],\"propositions\":[],\"lastnames\":[\"Reynier\"],\"suffixes\":[]}],\"title\":\"Controllers with Minimal Observation Power (Application to Timed Systems)\",\"journal\":\"CoRR\",\"volume\":\"abs/1207.1276\",\"year\":\"2012\",\"urlpaper\":\"http://arxiv.org/abs/1207.1276\",\"timestamp\":\"Wed, 10 Oct 2012 21:28:54 +0200\",\"biburl\":\"http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1207-1276\",\"bibsource\":\"dblp computer science bibliography, http://dblp.org\",\"abstract\":\"We consider the problem of controller synthesis under imperfect information in a setting where there is a set of available observable predicates equipped with a cost function. The problem that we address is the computation of a subset of predicates sufficient for control and whose cost is minimal. Our solution avoids a full exploration of all possible subsets of predicates and reuses some information between different iterations. We apply our approach to timed systems. We have developed a tool prototype and analyze the performance of our optimization algorithm on two case studies. \",\"mywebpage\":\"timed\",\"keywords\":\"timed automata, timed games, control\",\"bibtex\":\"@article{bulychev-2012,\\n  author    = {Peter E. Bulychev and\\n               Franck Cassez and\\n               Alexandre David and\\n               Kim G. Larsen and\\n               Jean{-}Fran{\\\\c{c}}ois Raskin and\\n               Pierre{-}Alain Reynier},\\n  title     = {Controllers with Minimal Observation Power (Application to Timed Systems)},\\n  journal   = {CoRR},\\n  Type = {E - Reports},\\n  volume    = {abs/1207.1276},\\n  year      = {2012},\\n  urlpaper       = {http://arxiv.org/abs/1207.1276},\\n  timestamp = {Wed, 10 Oct 2012 21:28:54 +0200},\\n  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1207-1276},\\n  bibsource = {dblp computer science bibliography, http://dblp.org},\\n  abstract = {\\n  We consider the problem of controller synthesis under imperfect information in a setting where there is a set of available observable predicates equipped with a cost function. The problem that we address is the computation of a subset of predicates sufficient for control and whose cost is minimal. Our solution avoids a full exploration of all possible subsets of predicates and reuses some information between different iterations. We apply our approach to timed systems. We have developed a tool prototype and analyze the performance of our optimization algorithm on two case studies.\\n  },\\n   mywebpage = {timed},\\n  keywords = {timed automata, timed games, control},\\n\\n}\\n\\n\\n\\n\",\"author_short\":[\"Bulychev, P. E.\",\"Cassez, F.\",\"David, A.\",\"Larsen, K. G.\",\"Raskin, J.\",\"Reynier, P.\"],\"key\":\"bulychev-2012\",\"id\":\"bulychev-2012\",\"bibbaseid\":\"bulychev-cassez-david-larsen-raskin-reynier-controllerswithminimalobservationpowerapplicationtotimedsystems-2012\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://arxiv.org/abs/1207.1276\"},\"keyword\":[\"timed automata\",\"timed games\",\"control\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"A - Journal\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]}],\"title\":\"The Complexity of Codiagnosability for Discrete Event and Timed Systems\",\"journal\":\"IEEE Trans. Automat. Contr.\",\"volume\":\"57\",\"number\":\"7\",\"year\":\"2012\",\"pages\":\"1752-1764\",\"urlpaper\":\"papers/tac-2012.pdf\",\"url_link\":\"http://dx.doi.org/10.1109/TAC.2012.2183169\",\"doi\":\"http://dx.doi.org/10.1109/TAC.2012.2183169\",\"mywebpage\":\"timed\",\"keywords\":\"timed automata, Fault diagnosis, Complexity\",\"abstract\":\"In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform characterisation of codiagnosability for FA and TA which extends the necessary and sufficient condition that characterises diagosability. We also settle the complexity of the codiagnosability problems both for FA and TA and show that codiagnosability is PSPACE-complete in both cases. For FA this improves on the previously known bound (EXPTIME) and for TA it is a new result. We then generalise the previous results to the case of dynamic observers. Finally we show that the codiagnosis problem for TA under bounded resources is 2EXPTIME-complete. \",\"bibtex\":\"@article{tac-12,\\n  author    = {Franck Cassez},\\n  title     = {The Complexity of Codiagnosability for Discrete Event and\\n               Timed Systems},\\n  journal   = {IEEE Trans. Automat. Contr.},\\n  volume    = {57},\\n  number    = {7},\\n  year      = {2012},\\n  type = {A - Journal},\\n  pages     = {1752-1764},\\n  urlpaper = {papers/tac-2012.pdf},\\n  url_link       = {http://dx.doi.org/10.1109/TAC.2012.2183169},\\n  doi = {http://dx.doi.org/10.1109/TAC.2012.2183169},\\n  mywebpage = {timed},\\n  keywords = {timed automata, Fault diagnosis, Complexity},\\n  abstract = {\\n  In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform characterisation of codiagnosability for FA and TA which extends the necessary and sufficient condition that characterises diagosability. We also settle the complexity of the codiagnosability problems both for FA and TA and show that codiagnosability is PSPACE-complete in both cases. For FA this improves on the previously known bound (EXPTIME) and for TA it is a new result. We then generalise the previous results to the case of dynamic observers. Finally we show that the codiagnosis problem for TA under bounded resources is 2EXPTIME-complete.\\n  }\\n}\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\"],\"key\":\"tac-12\",\"id\":\"tac-12\",\"bibbaseid\":\"cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystems-2012\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/tac-2012.pdf\",\" link\":\"http://dx.doi.org/10.1109/TAC.2012.2183169\"},\"keyword\":[\"timed automata\",\"Fault diagnosis\",\"Complexity\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"A - Journal\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Jérémy\"],\"propositions\":[],\"lastnames\":[\"Dubreil\"],\"suffixes\":[]},{\"firstnames\":[\"Hervé\"],\"propositions\":[],\"lastnames\":[\"Marchand\"],\"suffixes\":[]}],\"title\":\"Synthesis of opaque systems with static and dynamic masks\",\"journal\":\"Formal Methods in System Design\",\"volume\":\"40\",\"number\":\"1\",\"year\":\"2012\",\"pages\":\"88-115\",\"urlpaper\":\"papers/fmsd-2012.pdf\",\"ee\":\"http://dx.doi.org/10.1007/s10703-012-0141-9\",\"bibsource\":\"DBLP, http://dblp.uni-trier.de\",\"mywebpage\":\"\",\"keywords\":\"security, opacity, diagnosis\",\"abstract\":\"Opacity is a security property formalizing the absence of secret information leakage and we address in this paper the problem of synthesizing opaque systems. A secret predicate S over the runs of a system G is opaque to an external user having partial observ- ability over G, if s/he can never infer from the observation of a run of G that the run belongs to S. We choose to control the observability of events by adding a device, called a mask, between the system G and the users. We first investigate the case of static partial observability where the set of events the user can observe is fixed a priori by a static mask. In this context, we show that checking whether a system is opaque is PSPACE-complete, which implies that computing an optimal static mask ensuring opacity is also a PSPACE-complete problem. Next, we introduce dynamic partial observability where the set of events the user can observe changes over time and is chosen by a dynamic mask. We show how to check that a system is opaque w.r.t. to a dynamic mask and also address the corresponding synthesis problem: given a system G and secret states S, compute the set of dynamic masks under which S is opaque. Our main result is that the set of such masks can be finitely represented and can be computed in EXPTIME and this is a lower bound. Finally we also address the problem of computing an optimal mask. \",\"bibtex\":\"@article{fmsd-12,\\n  author    = {Franck Cassez and\\n               Jérémy Dubreil and\\n               Hervé Marchand},\\n  title     = {Synthesis of opaque systems with static and dynamic masks},\\n  journal   = {Formal Methods in System Design},\\n  volume    = {40},\\n  number    = {1},\\n  year      = {2012},\\n  pages     = {88-115},\\n    type = {A - Journal},\\n\\n  urlpaper = {papers/fmsd-2012.pdf},\\n  ee        = {http://dx.doi.org/10.1007/s10703-012-0141-9},\\n  bibsource = {DBLP, http://dblp.uni-trier.de},\\n  mywebpage = {},\\n  keywords = {security, opacity, diagnosis},\\n  abstract = {\\nOpacity is a security property formalizing the absence of secret information leakage and we address in this paper the problem of synthesizing opaque systems. A secret predicate S over the runs of a system G is opaque to an external user having partial observ- ability over G, if s/he can never infer from the observation of a run of G that the run belongs to S. We choose to control the observability of events by adding a device, called a mask, between the system G and the users. We first investigate the case of static partial observability where the set of events the user can observe is fixed a priori by a static mask. In this context, we show that checking whether a system is opaque is PSPACE-complete, which implies that computing an optimal static mask ensuring opacity is also a PSPACE-complete problem. Next, we introduce dynamic partial observability where the set of events the user can observe changes over time and is chosen by a dynamic mask. We show how to check that a system is opaque w.r.t. to a dynamic mask and also address the corresponding synthesis problem: given a system G and secret states S, compute the set of dynamic masks under which S is opaque. Our main result is that the set of such masks can be finitely represented and can be computed in EXPTIME and this is a lower bound. Finally we also address the problem of computing an optimal mask.\\n\\n  },\\n}\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Dubreil, J.\",\"Marchand, H.\"],\"key\":\"fmsd-12\",\"id\":\"fmsd-12\",\"bibbaseid\":\"cassez-dubreil-marchand-synthesisofopaquesystemswithstaticanddynamicmasks-2012\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/fmsd-2012.pdf\",\"Link\":\"http://dx.doi.org/10.1007/s10703-012-0141-9\"},\"keyword\":[\"security\",\"opacity\",\"diagnosis\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Mark\"],\"propositions\":[],\"lastnames\":[\"Bradley\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Ansgar\"],\"propositions\":[],\"lastnames\":[\"Fehnker\"],\"suffixes\":[]},{\"firstnames\":[\"Thomas\"],\"propositions\":[],\"lastnames\":[\"Given-Wilson\"],\"suffixes\":[]},{\"firstnames\":[\"Ralf\"],\"propositions\":[],\"lastnames\":[\"Huuck\"],\"suffixes\":[]}],\"title\":\"High Performance Static Analysis for Industry\",\"journal\":\"Electr. Notes Theor. Comput. Sci.\",\"volume\":\"289\",\"year\":\"2012\",\"pages\":\"3-14\",\"urlpaper\":\"papers/tapas-2012.pdf\",\"ee\":\"http://dx.doi.org/10.1016/j.entcs.2012.11.002\",\"bibsource\":\"DBLP, http://dblp.uni-trier.de\",\"mywebpage\":\"soft-verif\",\"keywords\":\"software verification\",\"abstract\":\"Static source code analysis for software bug detection has come a long way since its early beginnings as a compiler technology. However, with the introduction of more sophisticated algorithmic techniques, such as model checking and constraint solving, questions about performance are a major concern. In this work we present an empirical study of our industrial strength source code analysis tool Goanna that uses a model checking core for static analysis of C/C++ code. We present the core technology and abstraction mechanism with a focus on performance, as guided by experience from having analyzed millions of lines of code. In particular, we present results from our recent study within the NIST/DHS SAMATE program. The results show that, maybe surprisingly, formal verification techniques can be used successfully in practical industry applications scaling roughly linearly, even for millions of lines of code. \",\"bibtex\":\"@article{tapas-12,\\n  author    = {Mark Bradley and\\n               Franck Cassez and\\n               Ansgar Fehnker and\\n               Thomas Given-Wilson and\\n               Ralf Huuck},\\n  title     = {High Performance Static Analysis for Industry},\\n  journal   = {Electr. Notes Theor. Comput. Sci.},\\n  volume    = {289},\\n  year      = {2012},\\n  pages     = {3-14},\\n  urlpaper = {papers/tapas-2012.pdf},\\n  ee        = {http://dx.doi.org/10.1016/j.entcs.2012.11.002},\\n  bibsource = {DBLP, http://dblp.uni-trier.de},\\n  mywebpage = {soft-verif},\\n  keywords = {software verification},\\n  abstract = {\\n  Static source code analysis for software bug detection has come a long way since its early beginnings as a compiler technology. However, with the introduction of more sophisticated algorithmic techniques, such as model checking and constraint solving, questions about performance are a major concern. In this work we present an empirical study of our industrial strength source code analysis tool Goanna that uses a model checking core for static analysis of C/C++ code. We present the core technology and abstraction mechanism with a focus on performance, as guided by experience from having analyzed millions of lines of code. In particular, we present results from our recent study within the NIST/DHS SAMATE program. The results show that, maybe surprisingly, formal verification techniques can be used successfully in practical industry applications scaling roughly linearly, even for millions of lines of code.\\n  },\\n        Type = {B - International Conferences},\\n\\n}\\n\\n\\n\\n\",\"author_short\":[\"Bradley, M.\",\"Cassez, F.\",\"Fehnker, A.\",\"Given-Wilson, T.\",\"Huuck, R.\"],\"key\":\"tapas-12\",\"id\":\"tapas-12\",\"bibbaseid\":\"bradley-cassez-fehnker-givenwilson-huuck-highperformancestaticanalysisforindustry-2012\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/tapas-2012.pdf\",\"Link\":\"http://dx.doi.org/10.1016/j.entcs.2012.11.002\"},\"keyword\":[\"software verification\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"E - Reports\",\"author\":[{\"firstnames\":[\"Gilles\"],\"propositions\":[],\"lastnames\":[\"Benattar\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Didier\"],\"propositions\":[],\"lastnames\":[\"Lime\"],\"suffixes\":[]},{\"firstnames\":[\"Olivier\",\"H.\"],\"propositions\":[],\"lastnames\":[\"Roux\"],\"suffixes\":[]}],\"title\":\"Control and Synthesis of Non-Interferent Timed Systems\",\"journal\":\"CoRR\",\"volume\":\"abs/1207.4984\",\"year\":\"2012\",\"url\":\"http://arxiv.org/abs/1207.4984\",\"timestamp\":\"Wed, 10 Oct 2012 21:28:54 +0200\",\"biburl\":\"http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1207-4984\",\"bibsource\":\"dblp computer science bibliography, http://dblp.org\",\"keywords\":\"sceurity, non-interference\",\"abstract\":\"In this paper, we focus on the synthesis of secure timed systems which are modelled as timed automata. The security property that the system must satisfy is a non-interference property. Intuitively, non-interference ensures the absence of any causal dependency from a high-level domain to a lower-level domain. Various notions of non-interference have been defined in the literature, and in this paper we focus on Strong Non-deterministic Non-Interference (SNNI) and two (bi)simulation based variants thereof (CSNNI and BSNNI). We consider timed non-interference properties for timed systems specified by timed automata and we study the two following problems: (1) check whether it is possible to find a sub-system so that it is non-interferent; if yes (2) compute a (largest) sub-system which is non-interferent. \",\"bibtex\":\"@article{benattar-2012,\\n  author    = {Gilles Benattar and\\n               Franck Cassez and\\n               Didier Lime and\\n               Olivier H. Roux},\\n  title     = {Control and Synthesis of Non-Interferent Timed Systems},\\n  journal   = {CoRR},\\n  Type = {E - Reports},\\n  volume    = {abs/1207.4984},\\n  year      = {2012},\\n  url       = {http://arxiv.org/abs/1207.4984},\\n  timestamp = {Wed, 10 Oct 2012 21:28:54 +0200},\\n  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1207-4984},\\n  bibsource = {dblp computer science bibliography, http://dblp.org},\\n  keywords = {sceurity, non-interference},\\n  abstract = {\\nIn this paper, we focus on the synthesis of secure timed systems which are modelled as timed automata. The security property that the system must satisfy is a non-interference property. Intuitively, non-interference ensures the absence of any causal dependency from a high-level domain to a lower-level domain. Various notions of non-interference have been defined in the literature, and in this paper we focus on Strong Non-deterministic Non-Interference (SNNI) and two (bi)simulation based variants thereof (CSNNI and BSNNI). We consider timed non-interference properties for timed systems specified by timed automata and we study the two following problems: (1) check whether it is possible to find a sub-system so that it is non-interferent; if yes (2) compute a (largest) sub-system which is non-interferent.\\n  }\\n}\\n\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n%%% 2011\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n\\n\\n\\n\",\"author_short\":[\"Benattar, G.\",\"Cassez, F.\",\"Lime, D.\",\"Roux, O. H.\"],\"key\":\"benattar-2012\",\"id\":\"benattar-2012\",\"bibbaseid\":\"benattar-cassez-lime-roux-controlandsynthesisofnoninterferenttimedsystems-2012\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://arxiv.org/abs/1207.4984\"},\"keyword\":[\"sceurity\",\"non-interference\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]}],\"title\":\"Timed Games for Computing WCET for Pipelined Processors with Caches\",\"booktitle\":\"11th International Conference on Application of Concurrency to System Design, ACSD 2011, Newcastle Upon Tyne, UK, 20-24 June, 2011\",\"pages\":\"195–204\",\"year\":\"2011\",\"publisher\":\"IEEE\",\"url\":\"http://doi.ieeecomputersociety.org/10.1109/ACSD.2011.15\",\"doi\":\"10.1109/ACSD.2011.15\",\"timestamp\":\"Wed, 15 Feb 2012 09:59:43 +0100\",\"biburl\":\"http://dblp.uni-trier.de/rec/bib/conf/acsd/Cassez11\",\"bibsource\":\"dblp computer science bibliography, http://dblp.org\",\"urlpaper\":\"papers/acsd-2011.pdf\",\"urlslides\":\"papers/slides-acsd-2011.pdf\",\"abstract\":\"In this paper we introduce a framework for computing upper bounds yet accurate WCET for hardware platforms with caches and pipelines. The methodology we propose consists of 3 steps: 1) given a program to analyse, compute an equivalent (WCET-wise) abstract program; 2) build a timed game by composing this abstract program with a network of timed automata modeling the architecture; and 3) compute the WCET as the optimal time to reach a winning state in this game. We demonstrate the applicability of our framework on standard benchmarks for an ARM9 processor with instruction and data caches, and compute the WCET with UPPAAL-TiGA. We also show that this framework can easily be extended to take into account dynamic changes in the speed of the processor during program execution. \",\"ee\":\"http://dx.doi.org/10.1109/ACSD.2011.15\",\"keywords\":\"wcet, timed automata\",\"category\":\"wcet\",\"show\":\"\",\"mywebpage\":\"wcet\",\"bibtex\":\"@inproceedings{cassez-acsd-2011,\\n  author    = {Franck Cassez},\\n  title     = {Timed Games for Computing {WCET} for Pipelined Processors with Caches},\\n  booktitle = {11th International Conference on Application of Concurrency to System\\n               Design, {ACSD} 2011, Newcastle Upon Tyne, UK, 20-24 June, 2011},\\n  pages     = {195--204},\\n  year      = {2011},\\n  publisher = {{IEEE}},\\n  url       = {http://doi.ieeecomputersociety.org/10.1109/ACSD.2011.15},\\n  doi       = {10.1109/ACSD.2011.15},\\n  timestamp = {Wed, 15 Feb 2012 09:59:43 +0100},\\n  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/acsd/Cassez11},\\n  bibsource = {dblp computer science bibliography, http://dblp.org},\\n   urlpaper = {papers/acsd-2011.pdf},\\n  urlslides = {papers/slides-acsd-2011.pdf},\\n  ABSTRACT = {In this paper we introduce a framework for computing upper bounds yet\\naccurate WCET for hardware platforms with caches and pipelines. The methodology\\nwe propose consists of 3 steps: 1) given a program to analyse, compute an\\nequivalent (WCET-wise) abstract program; 2) build a timed game by composing\\nthis abstract program with a network of timed automata modeling the\\narchitecture; and 3) compute the WCET as the optimal time to reach a winning\\nstate in this game. We demonstrate the applicability of our framework on\\nstandard benchmarks for an ARM9 processor with instruction and data caches, and\\ncompute the WCET with UPPAAL-TiGA. We also show that this framework can easily\\nbe extended to take into account dynamic changes in the speed of the processor\\nduring program execution.\\n},\\nee       = {http://dx.doi.org/10.1109/ACSD.2011.15},\\n  keywords = {wcet, timed automata},\\n  category = {wcet},\\n  show = {},\\n  category= {wcet},\\n  mywebpage = {wcet},\\n        Type = {B - International Conferences},\\n\\n}\\n\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\"],\"key\":\"cassez-acsd-2011\",\"id\":\"cassez-acsd-2011\",\"bibbaseid\":\"cassez-timedgamesforcomputingwcetforpipelinedprocessorswithcaches-2011\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/acsd-2011.pdf\",\"Slides\":\"https://franck44.github.io/publications/papers/slides-acsd-2011.pdf\",\"Link\":\"http://dx.doi.org/10.1109/ACSD.2011.15\"},\"keyword\":[\"wcet\",\"timed automata\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"E - Reports\",\"author\":[{\"firstnames\":[\"Jean-Luc\"],\"propositions\":[],\"lastnames\":[\"Béchennec\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]}],\"title\":\"Computation of WCET using Program Slicing and Real-Time Model-Checking\",\"journal\":\"CoRR\",\"volume\":\"abs/1105.1633\",\"year\":\"2011\",\"urlpaper\":\"http://arxiv.org/abs/1105.1633\",\"timestamp\":\"Mon, 05 Dec 2011 18:05:32 +0100\",\"biburl\":\"http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1105-1633\",\"bibsource\":\"dblp computer science bibliography, http://dblp.org\",\"abstract\":\"Computing accurate WCET on modern complex architectures is a challenging task. This problem has been devoted a lot of attention in the last decade but there are still some open issues. First, the control flow graph (CFG) of a binary program is needed to compute the WCET and this CFG is built using some internal knowledge of the compiler that generated the binary code; moreover once constructed the CFG has to be manually annotated with loop bounds. Second, the algorithms to compute the WCET (combining Abstract Interpretation and Integer Linear Programming) are tailored for specific architectures: changing the architecture (e.g. replacing an ARM7 by an ARM9) requires the design of a new ad hoc algorithm. Third, the tightness of the computed results (obtained using the available tools) are not compared to actual execution times measured on the real hardware. In this paper we address the above mentioned problems. We first describe a fully automatic method to compute a CFG based solely on the binary program to analyse. Second, we describe the model of the hardware as a product of timed automata, and this model is independent from the program description. The model of a program running on a hardware is obtained by synchronizing (the automaton of) the program with the (timed automata) model of the hardware. Computing the WCET is reduced to a reachability problem on the synchronised model and solved using the model-checker UPPAAL. Finally, we present a rigorous methodology that enables us to compare our computed results to actual execution times measured on a real platform, the ARM920T.\",\"category\":\"wcet\",\"keywords\":\"wcet, timed automata\",\"show\":\"\",\"mywebpage\":\"wcet\",\"bibtex\":\"@article{bech-wcet-2011,\\n  author    = {Jean{-}Luc B{\\\\'{e}}chennec and\\n               Franck Cassez},\\n  title     = {Computation of {WCET} using Program Slicing and Real-Time Model-Checking},\\n  journal   = {CoRR},\\n  Type = {E - Reports},\\n  volume    = {abs/1105.1633},\\n  year      = {2011},\\n  urlpaper       = {http://arxiv.org/abs/1105.1633},\\n  timestamp = {Mon, 05 Dec 2011 18:05:32 +0100},\\n  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1105-1633},\\n  bibsource = {dblp computer science bibliography, http://dblp.org},\\n  ABSTRACT = { Computing accurate WCET on modern complex architectures is a challenging task. This problem has been devoted a lot of attention in the last decade but there are still some open issues. First, the control flow graph (CFG) of a binary program is needed to compute the WCET and this CFG is built using some internal knowledge of the compiler that generated the binary code; moreover once constructed the CFG has to be manually annotated with loop bounds. Second, the algorithms to compute the WCET (combining Abstract Interpretation and Integer Linear Programming) are tailored for specific architectures: changing the architecture (e.g. replacing an ARM7 by an ARM9) requires the design of a new ad hoc algorithm. Third, the tightness of the computed results (obtained using the available tools) are not compared to actual execution times measured on the real hardware. In this paper we address the above mentioned problems. We first describe a fully automatic method to compute a CFG based solely on the binary program to analyse. Second, we describe the model of the hardware as a product of timed automata, and this model is independent from the program description. The model of a program running on a hardware is obtained by synchronizing (the automaton of) the program with the (timed automata) model of the hardware. Computing the WCET is reduced to a reachability problem on the synchronised model and solved using the model-checker UPPAAL. Finally, we present a rigorous methodology that enables us to compare our computed results to actual execution times measured on a real platform, the ARM920T.},\\n    category= {wcet},\\n  keywords = {wcet, timed automata},\\n  show = {},\\n  mywebpage = {wcet}\\n}\\n\\n\\n\\n\",\"author_short\":[\"Béchennec, J.\",\"Cassez, F.\"],\"key\":\"bech-wcet-2011\",\"id\":\"bech-wcet-2011\",\"bibbaseid\":\"bchennec-cassez-computationofwcetusingprogramslicingandrealtimemodelchecking-2011\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://arxiv.org/abs/1105.1633\"},\"keyword\":[\"wcet\",\"timed automata\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"A - Journal\",\"author\":[{\"firstnames\":[\"Patricia\"],\"propositions\":[],\"lastnames\":[\"Bouyer\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"François\"],\"propositions\":[],\"lastnames\":[\"Laroussinie\"],\"suffixes\":[]}],\"title\":\"Timed Modal Logics for Real-Time Systems - Specification, Verification and Control\",\"journal\":\"Journal of Logic, Language and Information\",\"volume\":\"20\",\"number\":\"2\",\"pages\":\"169–203\",\"year\":\"2011\",\"url\":\"http://dx.doi.org/10.1007/s10849-010-9127-4\",\"doi\":\"10.1007/s10849-010-9127-4\",\"timestamp\":\"Tue, 12 Apr 2011 09:14:59 +0200\",\"biburl\":\"http://dblp.uni-trier.de/rec/bib/journals/jolli/BouyerCL11\",\"bibsource\":\"dblp computer science bibliography, http://dblp.org\",\"urlpaper\":\"papers/jlli-2011.pdf\",\"category\":\"games\",\"mywebpage\":\"timed\",\"show\":\"\",\"keywords\":\"logics, real-time, timed automata, timed games\",\"abstract\":\"In this paper, a timed modal logic Lc is presented for the specification and verification of real-time systems. Several important results for Lc are discussed. First we address the model checking problem and we show that it is an EXPTIME-complete problem. Secondly we consider expressiveness and we explain how to express strong timed bisimilarity and how to build characteristic formulas for timed automata. We also propose a compositional algorithm for Lc model checking. Finally we consider several control problems for which Lc can be used to check controllability. \",\"bibtex\":\"@article{bouyer-jlli-2011,\\n  author    = {Patricia Bouyer and\\n               Franck Cassez and\\n               Fran{\\\\c{c}}ois Laroussinie},\\n  title     = {Timed Modal Logics for Real-Time Systems - Specification, Verification\\n               and Control},\\n  journal   = {Journal of Logic, Language and Information},\\n  volume    = {20},\\n  number    = {2},\\n  pages     = {169--203},\\n  year      = {2011},\\n  Type = {A - Journal},\\n  url       = {http://dx.doi.org/10.1007/s10849-010-9127-4},\\n  doi       = {10.1007/s10849-010-9127-4},\\n  timestamp = {Tue, 12 Apr 2011 09:14:59 +0200},\\n  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/jolli/BouyerCL11},\\n  bibsource = {dblp computer science bibliography, http://dblp.org},\\n  urlpaper = {papers/jlli-2011.pdf},\\n  category= {games},\\n  mywebpage = {timed},\\n  show = {},\\n  keywords = {logics, real-time, timed automata, timed games},\\n  abstract = {\\n  In this paper, a timed modal logic Lc is presented for the specification\\nand verification of real-time systems. Several important results for Lc are discussed.\\nFirst we address the model checking problem and we show that it is an EXPTIME-complete problem.\\nSecondly we consider expressiveness and we explain how to\\nexpress strong timed bisimilarity and how to build characteristic formulas for timed\\nautomata. We also propose a compositional algorithm for Lc model checking. Finally\\nwe consider several control problems for which Lc can be used to check controllability.\\n  }\\n}\\n\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n%%% 2010\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n\\n\\n\\n\",\"author_short\":[\"Bouyer, P.\",\"Cassez, F.\",\"Laroussinie, F.\"],\"key\":\"bouyer-jlli-2011\",\"id\":\"bouyer-jlli-2011\",\"bibbaseid\":\"bouyer-cassez-laroussinie-timedmodallogicsforrealtimesystemsspecificationverificationandcontrol-2011\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/jlli-2011.pdf\"},\"keyword\":[\"logics\",\"real-time\",\"timed automata\",\"timed games\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]}],\"title\":\"The Complexity of Codiagnosability for Discrete Event and Timed Systems (Extended abstract)\",\"booktitle\":\"Automated Technology for Verification and Analysis - 8th International Symposium, ATVA 2010, Singapore, September 21-24, 2010. Proceedings\",\"pages\":\"82–96\",\"year\":\"2010\",\"editor\":[{\"firstnames\":[\"Ahmed\"],\"propositions\":[],\"lastnames\":[\"Bouajjani\"],\"suffixes\":[]},{\"firstnames\":[\"Wei-Ngan\"],\"propositions\":[],\"lastnames\":[\"Chin\"],\"suffixes\":[]}],\"urlpaper\":\"papers/atva-10.pdf\",\"xxee\":\"http://arxiv.org/abs/1004.2550\",\"xxurl\":\"http://dx.doi.org/10.1007/978-3-642-15643-4_8\",\"doi\":\"10.1007/978-3-642-15643-4_8\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"6252\",\"mywebpage\":\"diagnosis\",\"show\":\"\",\"publisher\":\"Springer\",\"keywords\":\"diagnosis, complexity, timed automata\",\"abstract\":\"In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform characterization of codiagnosability for FA and TA which extends the necessary and sufficient condition that characterizes diagnosability. We also settle the complexity of the codiagnosability problems both for FA and TA and show that codiagnosability is PSPACE-complete in both cases. For FA this improves on the previously known bound (EXPTIME) and for TA it is a new result. Finally we address the codiagnosis problem for TA under bounded resources and show it is 2EXPTIME-complete.\",\"bibtex\":\"@inproceedings{DBLP:conf/atva/Cassez10,\\n  author    = {Franck Cassez},\\n  title     = {The Complexity of Codiagnosability for Discrete Event and Timed Systems (Extended abstract)},\\n  booktitle = {Automated Technology for Verification and Analysis - 8th International\\n               Symposium, {ATVA} 2010, Singapore, September 21-24, 2010. Proceedings},\\n  pages     = {82--96},\\n  year      = {2010},\\n  editor    = {Ahmed Bouajjani and\\n               Wei{-}Ngan Chin},\\n  urlpaper = {papers/atva-10.pdf},\\n  xxee = {http://arxiv.org/abs/1004.2550},\\n  xxurl       = {http://dx.doi.org/10.1007/978-3-642-15643-4_8},\\n  doi       = {10.1007/978-3-642-15643-4_8},\\n series    = {Lecture Notes in Computer Science},\\n  volume    = {6252},\\n   mywebpage = {diagnosis},\\n  show = {},\\n  publisher = {Springer},\\n  keywords = {diagnosis, complexity, timed automata},\\n  abstract = {In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform characterization of codiagnosability for FA and TA which extends the necessary and sufficient condition that characterizes diagnosability. We also settle the complexity of the codiagnosability problems both for FA and TA and show that codiagnosability is PSPACE-complete in both cases. For FA this improves on the previously known bound (EXPTIME) and for TA it is a new result. Finally we address the codiagnosis problem for TA under bounded resources and show it is 2EXPTIME-complete.},\\n        Type = {B - International Conferences},\\n\\n  }\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\"],\"editor_short\":[\"Bouajjani, A.\",\"Chin, W.\"],\"key\":\"DBLP:conf/atva/Cassez10\",\"id\":\"DBLP:conf/atva/Cassez10\",\"bibbaseid\":\"cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystemsextendedabstract-2010\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/atva-10.pdf\"},\"keyword\":[\"diagnosis\",\"complexity\",\"timed automata\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]}],\"title\":\"Dynamic Observers for Fault Diagnosis of Timed Systems\",\"booktitle\":\"49th IEEE Conference on Decision and Control and 28th Chinese Control Conference\",\"year\":\"2010\",\"address\":\"Atlanta\",\"month\":\"December\",\"publisher\":\"IEEE Computer Society\",\"urlpaper\":\"papers/cdc-2010.pdf\",\"url_link\":\"http://arxiv.org/abs/1004.2764\",\"abstract\":\"In this paper we extend the work on dynamic observers for fault diagnosis to timed automata. We study sensor minimization problems with static observers and then address the problem of computing the most permissive dynamic observer for a system given by a timed automaton. \",\"mywebpage\":\"diagnosis\",\"show\":\"\",\"keywords\":\"diagnosis, timed automata\",\"bibtex\":\"@INPROCEEDINGS{cassez-cdc-2010,\\n  AUTHOR = {Franck Cassez},\\n  TITLE = {{Dynamic Observers for Fault Diagnosis of Timed Systems}},\\n  BOOKTITLE = {49th IEEE Conference on Decision and Control and 28th Chinese Control Conference},\\n  YEAR = {2010},\\n  ADDRESS = {Atlanta},\\n  MONTH = DEC,\\n  PUBLISHER = {IEEE Computer Society},\\n  urlpaper = {papers/cdc-2010.pdf},\\n  url_link = {http://arxiv.org/abs/1004.2764},\\n  ABSTRACT = { In this paper we extend the work on dynamic observers for\\nfault diagnosis  to timed automata. We\\nstudy sensor minimization problems with static observers and\\nthen address the problem of computing the most permissive\\ndynamic observer for a system given by a timed automaton. },\\n  mywebpage = {diagnosis},\\n  show = {},\\n  keywords = {diagnosis, timed automata},\\n        Type = {B - International Conferences},\\n\\n}\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\"],\"key\":\"cassez-cdc-2010\",\"id\":\"cassez-cdc-2010\",\"bibbaseid\":\"cassez-dynamicobserversforfaultdiagnosisoftimedsystems-2010\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/cdc-2010.pdf\",\" link\":\"http://arxiv.org/abs/1004.2764\"},\"keyword\":[\"diagnosis\",\"timed automata\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Ron\"],\"propositions\":[\"van\",\"der\"],\"lastnames\":[\"Meyden\"],\"suffixes\":[]},{\"firstnames\":[\"Chenyi\"],\"propositions\":[],\"lastnames\":[\"Zhang\"],\"suffixes\":[]}],\"editor\":[{\"firstnames\":[\"C.-H.\",\"Luke\"],\"propositions\":[],\"lastnames\":[\"Ong\"],\"suffixes\":[]}],\"title\":\"The Complexity of Synchronous Notions of Information Flow Security\",\"booktitle\":\"Foundations of Software Science and Computational Structures, 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings\",\"pages\":\"282–296\",\"year\":\"2010\",\"volume\":\"6014\",\"urlpaper\":\"papers/fossacs-2010.pdf\",\"publisher\":\"Springer\",\"series\":\"Lecture Notes in Computer Science\",\"doi\":\"10.1007/978-3-642-12032-9_20\",\"keywords\":\"security, interference\",\"abstract\":\"The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one in which agents operate synchronously with awareness of the global clock. This enables timing based attacks to be captured, whereas previous work on this topic has dealt primarily with asynchronous systems. Versions of the notions of nondeducibility on inputs, nondeducibility on strategies, and an unwinding based notion are formulated for this model. All three notions are shown to be decidable, and their computational complexity is characterised.\",\"bibtex\":\"@inproceedings{cassez-fossacs-2010,\\n  author    = {Franck Cassez and\\n               Ron van der Meyden and\\n               Chenyi Zhang},\\n               editor    = {C.{-}H. Luke Ong},\\n  title     = {The Complexity of Synchronous Notions of Information Flow Security},\\n  booktitle = {Foundations of Software Science and Computational Structures, 13th\\n               International Conference, {FOSSACS} 2010, Held as Part of the Joint\\n               European Conferences on Theory and Practice of Software, {ETAPS} 2010,\\n               Paphos, Cyprus, March 20-28, 2010. Proceedings},\\n  pages     = {282--296},\\n  year      = {2010},\\n  volume    = {6014},\\n  urlpaper = {papers/fossacs-2010.pdf},\\n  publisher = {Springer},\\n  series    = {Lecture Notes in Computer Science},\\n  doi       = {10.1007/978-3-642-12032-9_20},\\n      keywords = {security, interference},\\n      Type = {B - International Conferences},\\n\\n  abstract = {The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one in which agents operate synchronously with awareness of the global clock. This enables timing based attacks to be captured, whereas previous work on this topic has dealt primarily with asynchronous systems. Versions of the notions of nondeducibility on inputs, nondeducibility on strategies, and an unwinding based notion are formulated for this model. All three notions are shown to be decidable, and their computational complexity is characterised.}\\n}\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"van der Meyden, R.\",\"Zhang, C.\"],\"editor_short\":[\"Ong, C. L.\"],\"key\":\"cassez-fossacs-2010\",\"id\":\"cassez-fossacs-2010\",\"bibbaseid\":\"cassez-vandermeyden-zhang-thecomplexityofsynchronousnotionsofinformationflowsecurity-2010\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/fossacs-2010.pdf\"},\"keyword\":[\"security\",\"interference\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"E - Reports\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]}],\"title\":\"The Complexity of Codiagnosability for Discrete Event and Timed Systems\",\"journal\":\"CoRR\",\"volume\":\"abs/1004.2550\",\"year\":\"2010\",\"url\":\"http://arxiv.org/abs/1004.2550\",\"timestamp\":\"Mon, 05 Dec 2011 18:05:32 +0100\",\"biburl\":\"http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1004-2550\",\"bibsource\":\"dblp computer science bibliography, http://dblp.org\",\"keywords\":\"fault diagnosis, timed automata\",\"abstract\":\"In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform characterization of codiagnosability for FA and TA which extends the necessary and sufficient condition that characterizes diagnosability. We also settle the complexity of the codiagnosability problems both for FA and TA and show that codiagnosability is PSPACE-complete in both cases. For FA this improves on the previously known bound (EXPTIME) and for TA it is a new result. Finally we address the codiagnosis problem for TA under bounded resources and show it is 2EXPTIME-complete.\",\"bibtex\":\"@article{DBLP:journals/corr/abs-1004-2550,\\n  author    = {Franck Cassez},\\n  title     = {The Complexity of Codiagnosability for Discrete Event and Timed Systems},\\n  journal   = {CoRR},\\n  Type = {E - Reports},\\n  volume    = {abs/1004.2550},\\n  year      = {2010},\\n  url       = {http://arxiv.org/abs/1004.2550},\\n  timestamp = {Mon, 05 Dec 2011 18:05:32 +0100},\\n  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1004-2550},\\n  bibsource = {dblp computer science bibliography, http://dblp.org},\\n      keywords = {fault diagnosis, timed automata},\\n\\n  abstract = {In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform characterization of codiagnosability for FA and TA which extends the necessary and sufficient condition that characterizes diagnosability. We also settle the complexity of the codiagnosability problems both for FA and TA and show that codiagnosability is PSPACE-complete in both cases. For FA this improves on the previously known bound (EXPTIME) and for TA it is a new result. Finally we address the codiagnosis problem for TA under bounded resources and show it is 2EXPTIME-complete.}\\n}\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\"],\"key\":\"DBLP:journals/corr/abs-1004-2550\",\"id\":\"DBLP:journals/corr/abs-1004-2550\",\"bibbaseid\":\"cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystems-2010\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://arxiv.org/abs/1004.2550\"},\"keyword\":[\"fault diagnosis\",\"timed automata\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"E - Reports\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]}],\"title\":\"A Note on Fault Diagnosis Algorithms\",\"journal\":\"CoRR\",\"volume\":\"abs/1004.2764\",\"year\":\"2010\",\"url\":\"http://arxiv.org/abs/1004.2764\",\"timestamp\":\"Mon, 05 Dec 2011 18:04:58 +0100\",\"biburl\":\"http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1004-2764\",\"bibsource\":\"dblp computer science bibliography, http://dblp.org\",\"keywords\":\"fault diagnosis, timed automata\",\"abstract\":\"In this paper we review algorithms for checking diagnosability of discrete-event systems and timed automata. We point out that the diagnosability problems in both cases reduce to the emptiness problem for (timed) Büchi automata. Moreover, it is known that, checking whether a discrete-event system is diagnosable, can also be reduced to checking bounded diagnosability. We establish a similar result for timed automata. We also provide a synthesis of the complexity results for the different fault diagnosis problems.\",\"bibtex\":\"@article{DBLP:journals/corr/abs-1004-2764,\\n  author    = {Franck Cassez},\\n  title     = {A Note on Fault Diagnosis Algorithms},\\n  journal   = {CoRR},\\n  Type = {E - Reports},\\n  volume    = {abs/1004.2764},\\n  year      = {2010},\\n  url       = {http://arxiv.org/abs/1004.2764},\\n  timestamp = {Mon, 05 Dec 2011 18:04:58 +0100},\\n  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1004-2764},\\n  bibsource = {dblp computer science bibliography, http://dblp.org},\\n      keywords = {fault diagnosis, timed automata},\\n\\n  abstract = {In this paper we review algorithms for checking diagnosability of discrete-event systems and timed automata. We point out that the diagnosability problems in both cases reduce to the emptiness problem for (timed) B\\\\\\\"uchi automata. Moreover, it is known that, checking whether a discrete-event system is diagnosable, can also be reduced to checking bounded diagnosability. We establish a similar result for timed automata. We also provide a synthesis of the complexity results for the different fault diagnosis problems.}\\n}\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\"],\"key\":\"DBLP:journals/corr/abs-1004-2764\",\"id\":\"DBLP:journals/corr/abs-1004-2764\",\"bibbaseid\":\"cassez-anoteonfaultdiagnosisalgorithms-2010\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://arxiv.org/abs/1004.2764\"},\"keyword\":[\"fault diagnosis\",\"timed automata\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"E - Reports\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Stavros\"],\"propositions\":[],\"lastnames\":[\"Tripakis\"],\"suffixes\":[]}],\"title\":\"Fault Diagnosis with Dynamic Observers\",\"journal\":\"CoRR\",\"volume\":\"abs/1004.2810\",\"year\":\"2010\",\"url\":\"http://arxiv.org/abs/1004.2810\",\"timestamp\":\"Mon, 05 Dec 2011 18:05:22 +0100\",\"biburl\":\"http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1004-2810\",\"bibsource\":\"dblp computer science bibliography, http://dblp.org\",\"keywords\":\"fault diagnosis, timed automata\",\"abstract\":\"In this paper, we review some recent results about the use of dynamic observers for fault diagnosis of discrete event systems. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in the plant as soon as possible after their occurrence. Existing literature on this problem has considered the case of fixed static observers, where the set of observable events is fixed and does not change during execution of the system. In this paper, we consider dynamic observers: an observer can \\\"switch\\\" sensors on or off, thus dynamically changing the set of events it wishes to observe. It is known that checking diagnosability (i.e., whether a given observer is capable of identifying faults) can be solved in polynomial time for static observers, and we show that the same is true for dynamic ones. We also solve the problem of dynamic observers' synthesis and prove that a most permissive observer can be computed in doubly exponential time, using a game-theoretic approach. We further investigate optimization problems for dynamic observers and define a notion of cost of an observer.\",\"bibtex\":\"@article{DBLP:journals/corr/abs-1004-2810,\\n  author    = {Franck Cassez and\\n               Stavros Tripakis},\\n  title     = {Fault Diagnosis with Dynamic Observers},\\n  journal   = {CoRR},\\n  Type = {E - Reports},\\n  volume    = {abs/1004.2810},\\n  year      = {2010},\\n  url       = {http://arxiv.org/abs/1004.2810},\\n  timestamp = {Mon, 05 Dec 2011 18:05:22 +0100},\\n  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1004-2810},\\n  bibsource = {dblp computer science bibliography, http://dblp.org},\\n    keywords = {fault diagnosis, timed automata},\\n\\n  abstract = {In this paper, we review some recent results about the use of dynamic observers for fault diagnosis of discrete event systems. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in the plant as soon as possible after their occurrence. Existing literature on this problem has considered the case of fixed static observers, where the set of observable events is fixed and does not change during execution of the system. In this paper, we consider dynamic observers: an observer can \\\"switch\\\" sensors on or off, thus dynamically changing the set of events it wishes to observe. It is known that checking diagnosability (i.e., whether a given observer is capable of identifying faults) can be solved in polynomial time for static observers, and we show that the same is true for dynamic ones. We also solve the problem of dynamic observers' synthesis and prove that a most permissive observer can be computed in doubly exponential time, using a game-theoretic approach. We further investigate optimization problems for dynamic observers and define a notion of cost of an observer.}\\n}\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Tripakis, S.\"],\"key\":\"DBLP:journals/corr/abs-1004-2810\",\"id\":\"DBLP:journals/corr/abs-1004-2810\",\"bibbaseid\":\"cassez-tripakis-faultdiagnosiswithdynamicobservers-2010\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://arxiv.org/abs/1004.2810\"},\"keyword\":[\"fault diagnosis\",\"timed automata\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"E - Reports\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]}],\"title\":\"Timed Games for Computing Worst-Case Execution-Times\",\"journal\":\"CoRR\",\"volume\":\"abs/1006.1951\",\"year\":\"2010\",\"url\":\"http://arxiv.org/abs/1006.1951\",\"timestamp\":\"Mon, 05 Dec 2011 18:04:54 +0100\",\"biburl\":\"http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1006-1951\",\"bibsource\":\"dblp computer science bibliography, http://dblp.org\",\"keywords\":\"wcet, timed automata\",\"abstract\":\"In this paper we introduce a framework for computing upper bounds yet accurate WCET for hardware platforms with caches and pipelines. The methodology we propose consists of 3 steps: 1) given a program to analyse, compute an equivalent (WCET-wise) abstract program; 2) build a timed game by composing this abstract program with a network of timed automata modeling the architecture; and 3) compute the WCET as the optimal time to reach a winning state in this game. We demonstrate the applicability of our framework on standard benchmarks for an ARM9 processor with instruction and data caches, and compute the WCET with UPPAAL-TiGA. We also show that this framework can easily be extended to take into account dynamic changes in the speed of the processor during program execution.\",\"bibtex\":\"@article{DBLP:journals/corr/abs-1006-1951,\\n  author    = {Franck Cassez},\\n  title     = {Timed Games for Computing Worst-Case Execution-Times},\\n  journal   = {CoRR},\\n  Type = {E - Reports},\\n  volume    = {abs/1006.1951},\\n  year      = {2010},\\n  url       = {http://arxiv.org/abs/1006.1951},\\n  timestamp = {Mon, 05 Dec 2011 18:04:54 +0100},\\n  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1006-1951},\\n  bibsource = {dblp computer science bibliography, http://dblp.org},\\n    keywords = {wcet, timed automata},\\n\\n  abstract= {In this paper we introduce a framework for computing upper bounds yet accurate WCET for hardware platforms with caches and pipelines. The methodology we propose consists of 3 steps: 1) given a program to analyse, compute an equivalent (WCET-wise) abstract program; 2) build a timed game by composing this abstract program with a network of timed automata modeling the architecture; and 3) compute the WCET as the optimal time to reach a winning state in this game. We demonstrate the applicability of our framework on standard benchmarks for an ARM9 processor with instruction and data caches, and compute the WCET with UPPAAL-TiGA. We also show that this framework can easily be extended to take into account dynamic changes in the speed of the processor during program execution.}\\n}\\n\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n%%% 2009\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\"],\"key\":\"DBLP:journals/corr/abs-1006-1951\",\"id\":\"DBLP:journals/corr/abs-1006-1951\",\"bibbaseid\":\"cassez-timedgamesforcomputingworstcaseexecutiontimes-2010\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://arxiv.org/abs/1006.1951\"},\"keyword\":[\"wcet\",\"timed automata\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Jérémy\"],\"propositions\":[],\"lastnames\":[\"Dubreil\"],\"suffixes\":[]},{\"firstnames\":[\"Hervé\"],\"propositions\":[],\"lastnames\":[\"Marchand\"],\"suffixes\":[]}],\"editor\":[{\"firstnames\":[\"Zhiming\"],\"propositions\":[],\"lastnames\":[\"Liu\"],\"suffixes\":[]},{\"firstnames\":[\"Anders\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Ravn\"],\"suffixes\":[]}],\"title\":\"Dynamic Observers for the Synthesis of Opaque Systems\",\"booktitle\":\"Automated Technology for Verification and Analysis, 7th International Symposium, ATVA 2009, Macao, China, October 14-16, 2009. Proceedings\",\"pages\":\"352–367\",\"year\":\"2009\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"5799\",\"publisher\":\"Springer\",\"url\":\"http://dx.doi.org/10.1007/978-3-642-04761-9_26\",\"doi\":\"10.1007/978-3-642-04761-9_26\",\"urlpaper\":\"papers/atva-09.pdf\",\"urlslides\":\"papers/slides-atva-09.pdf\",\"abstract\":\"In this paper, we address the problem of synthesizing \\\\emphopaque systems by selecting the set of observable events. We first investigate the case of \\\\emphstatic observability where the set of observable events is fixed a priori. In this context, we show that checking whether a system is opaque and computing an optimal static observer ensuring opacity are both PSPACE-complete problems. Next, we introduce \\\\emphdynamic partial observability where the set of observable events can change over time. We show how to check that a system is opaque ≀t a dynamic observer and also address the corresponding synthesis problem: given a system $G$ and secret states $S$, compute the set of dynamic observers under which $S$ is opaque. Our main result is that the synthesis problem can be solved in EXPTIME.\",\"bibtex\":\"@inproceedings{DBLP:conf/atva/CassezDM09,\\n  author    = {Franck Cassez and\\n               J{\\\\'{e}}r{\\\\'{e}}my Dubreil and\\n               Herv{\\\\'{e}} Marchand},\\n                 editor    = {Zhiming Liu and\\n               Anders P. Ravn},\\n  title     = {Dynamic Observers for the Synthesis of Opaque Systems},\\n  booktitle = {Automated Technology for Verification and Analysis, 7th International\\n               Symposium, {ATVA} 2009, Macao, China, October 14-16, 2009. Proceedings},\\n  pages     = {352--367},\\n  year      = {2009},\\n    series    = {Lecture Notes in Computer Science},\\n  volume    = {5799},\\n  publisher = {Springer},\\n  url       = {http://dx.doi.org/10.1007/978-3-642-04761-9_26},\\n  doi       = {10.1007/978-3-642-04761-9_26},\\n    urlpaper = {papers/atva-09.pdf},\\n  urlslides = {papers/slides-atva-09.pdf},\\n        Type = {B - International Conferences},\\n\\n  ABSTRACT = {   In this paper, we address the problem of synthesizing \\\\emph{opaque}\\n  systems by selecting the set of observable\\n  events.\\n  We first investigate the case of \\\\emph{static}  observability\\n  where the set of observable events\\n  is fixed a priori.  In this context, we show that checking whether a\\n  system is opaque and computing an optimal static observer ensuring\\n  opacity are both PSPACE-complete problems.\\n  Next, we introduce \\\\emph{dynamic} partial observability where the\\n  set of observable events\\n  can\\n  change over time.\\n  We show how to check that a system is opaque \\\\wrt a dynamic observer\\n  and also address the corresponding synthesis problem: given a system\\n  $G$ and secret states $S$, compute the set of dynamic observers\\n  under which $S$ is opaque. Our main result is that the synthesis\\n  problem can be solved in EXPTIME.},\\n}\\n\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Dubreil, J.\",\"Marchand, H.\"],\"editor_short\":[\"Liu, Z.\",\"Ravn, A. P.\"],\"key\":\"DBLP:conf/atva/CassezDM09\",\"id\":\"DBLP:conf/atva/CassezDM09\",\"bibbaseid\":\"cassez-dubreil-marchand-dynamicobserversforthesynthesisofopaquesystems-2009\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/atva-09.pdf\",\"Slides\":\"https://franck44.github.io/publications/papers/slides-atva-09.pdf\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]}],\"title\":\"A note on fault diagnosis algorithms\",\"booktitle\":\"Proceedings of the 48th IEEE Conference on Decision and Control, CDC 2009, combined withe the 28th Chinese Control Conference, December 16-18, 2009, Shanghai, China\",\"editor\":[{\"firstnames\":[\"Joël\"],\"propositions\":[],\"lastnames\":[\"Ouaknine\"],\"suffixes\":[]},{\"firstnames\":[\"Frits\",\"W.\"],\"propositions\":[],\"lastnames\":[\"Vaandrager\"],\"suffixes\":[]}],\"pages\":\"6941–6946\",\"year\":\"2009\",\"publisher\":\"IEEE\",\"url\":\"http://dx.doi.org/10.1109/CDC.2009.5399968\",\"doi\":\"10.1109/CDC.2009.5399968\",\"abstract\":\"In this paper we review algorithms for checking diagnosability of discrete-event systems and timed automata. We point out that the diagnosability problems in both cases reduce to the emptiness problem for (timed) Büchi automata. Moreover, it is known that, checking whether a discrete-event system is diagnosable, can also be reduced to checking bounded diagnosability. We establish a similar result for timed automata. We also provide a synthesis of the complexity results for the different fault diagnosis problems.\",\"urlpaper\":\"papers/cdc-09.pdf\",\"urlslides\":\"papers/slides-cdc-09.pdf\",\"keywords\":\"diagnosis, timed automata\",\"bibtex\":\"@inproceedings{DBLP:conf/cdc/Cassez09,\\n  author    = {Franck Cassez},\\n  title     = {A note on fault diagnosis algorithms},\\n  booktitle = {Proceedings of the 48th {IEEE} Conference on Decision and Control,\\n               {CDC} 2009, combined withe the 28th Chinese Control Conference, December\\n               16-18, 2009, Shanghai, China},\\n  editor    = {Jo{\\\\\\\"{e}}l Ouaknine and\\n               Frits W. Vaandrager},\\n  pages     = {6941--6946},\\n  year      = {2009},\\n   publisher = {{IEEE}},\\n  year      = {2009},\\n  url       = {http://dx.doi.org/10.1109/CDC.2009.5399968},\\n  doi       = {10.1109/CDC.2009.5399968},\\n  ABSTRACT = {   In this paper we review algorithms for checking diagnosability of\\n  discrete-event systems and timed automata. We point out that the\\n  diagnosability problems in both cases reduce to the emptiness\\n  problem for (timed) B\\\\\\\"uchi automata. Moreover, it is known that,\\n  checking whether a discrete-event system is diagnosable, can also be\\n  reduced to checking bounded diagnosability. We establish a similar\\n  result for timed automata.  We also provide a synthesis of the\\n  complexity results for the different fault diagnosis problems.},\\n  urlpaper = {papers/cdc-09.pdf},\\n  urlslides = {papers/slides-cdc-09.pdf},\\n        Type = {B - International Conferences},\\n\\n  keywords = {diagnosis, timed automata},\\n}\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\"],\"editor_short\":[\"Ouaknine, J.\",\"Vaandrager, F. W.\"],\"key\":\"DBLP:conf/cdc/Cassez09\",\"id\":\"DBLP:conf/cdc/Cassez09\",\"bibbaseid\":\"cassez-anoteonfaultdiagnosisalgorithms-2009\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/cdc-09.pdf\",\"Slides\":\"https://franck44.github.io/publications/papers/slides-cdc-09.pdf\"},\"keyword\":[\"diagnosis\",\"timed automata\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Gilles\"],\"propositions\":[],\"lastnames\":[\"Benattar\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Didier\"],\"propositions\":[],\"lastnames\":[\"Lime\"],\"suffixes\":[]},{\"firstnames\":[\"Olivier\",\"H.\"],\"propositions\":[],\"lastnames\":[\"Roux\"],\"suffixes\":[]}],\"title\":\"Synthesis of Non-Interferent Timed Systems\",\"booktitle\":\"Formal Modeling and Analysis of Timed Systems, 7th International Conference, FORMATS 2009, Budapest, Hungary, September 14-16, 2009. Proceedings\",\"pages\":\"28–42\",\"year\":\"2009\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"5813\",\"publisher\":\"Springer\",\"url\":\"http://dx.doi.org/10.1007/978-3-642-04368-0_5\",\"doi\":\"10.1007/978-3-642-04368-0_5\",\"urlpaper\":\"papers/formats-09.pdf\",\"urlslides\":\"papers/slides-formats-09.pdf\",\"abstract\":\"In this paper, we focus on the synthesis of secure timed systems which are given by timed automata. The security property that the system must satisfy is a \\\\emphnon-interference property. Various notions of non-interference have been defined in the literature, and in this paper we focus on \\\\emphStrong Non-deterministic Non-Interference (SNNI) and we study the two following problems: ($1$) check whether it is possible to enforce a system to be SNNI; if yes ($2$) compute a sub-system which is SNNI.\",\"keywords\":\"security, timed automata\",\"bibtex\":\"@inproceedings{DBLP:conf/formats/BenattarCLR09,\\n  author    = {Gilles Benattar and\\n               Franck Cassez and\\n               Didier Lime and\\n               Olivier H. Roux},\\n  title     = {Synthesis of Non-Interferent Timed Systems},\\n  booktitle = {Formal Modeling and Analysis of Timed Systems, 7th International Conference,\\n               {FORMATS} 2009, Budapest, Hungary, September 14-16, 2009. Proceedings},\\n  pages     = {28--42},\\n  year      = {2009},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {5813},\\n  publisher = {Springer},\\n  url       = {http://dx.doi.org/10.1007/978-3-642-04368-0_5},\\n  doi       = {10.1007/978-3-642-04368-0_5},\\n  urlpaper = {papers/formats-09.pdf},\\n  urlslides = {papers/slides-formats-09.pdf},\\n   ABSTRACT = {  In this paper, we focus on the synthesis of secure timed systems\\n  which are given by timed automata.\\n  The security property that the system must satisfy is a\\n  \\\\emph{non-interference} property.\\n  Various notions of non-interference have been defined in the\\n  literature, and in this paper we focus on \\\\emph{Strong\\n    Non-deterministic Non-Interference} (SNNI)\\n  and we study the two following problems: ($1$) check whether it is\\n  possible to enforce a system to be SNNI; if yes ($2$) compute a\\n  sub-system which is SNNI.},\\n        Type = {B - International Conferences},\\n\\n  keywords = {security, timed automata}\\n}\\n\\n\\n\\n\",\"author_short\":[\"Benattar, G.\",\"Cassez, F.\",\"Lime, D.\",\"Roux, O. H.\"],\"key\":\"DBLP:conf/formats/BenattarCLR09\",\"id\":\"DBLP:conf/formats/BenattarCLR09\",\"bibbaseid\":\"benattar-cassez-lime-roux-synthesisofnoninterferenttimedsystems-2009\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/formats-09.pdf\",\"Slides\":\"https://franck44.github.io/publications/papers/slides-formats-09.pdf\"},\"keyword\":[\"security\",\"timed automata\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Jan\",\"Jakob\"],\"propositions\":[],\"lastnames\":[\"Jessen\"],\"suffixes\":[]},{\"firstnames\":[\"Kim\",\"Guldstrand\"],\"propositions\":[],\"lastnames\":[\"Larsen\"],\"suffixes\":[]},{\"firstnames\":[\"Jean-François\"],\"propositions\":[],\"lastnames\":[\"Raskin\"],\"suffixes\":[]},{\"firstnames\":[\"Pierre-Alain\"],\"propositions\":[],\"lastnames\":[\"Reynier\"],\"suffixes\":[]}],\"editor\":[{\"firstnames\":[\"Rupak\"],\"propositions\":[],\"lastnames\":[\"Majumdar\"],\"suffixes\":[]},{\"firstnames\":[\"Paulo\"],\"propositions\":[],\"lastnames\":[\"Tabuada\"],\"suffixes\":[]}],\"title\":\"Automatic Synthesis of Robust and Optimal Controllers - An Industrial Case Study\",\"booktitle\":\"Hybrid Systems: Computation and Control, 12th International Conference, HSCC 2009, San Francisco, CA, USA, April 13-15, 2009. Proceedings\",\"pages\":\"90–104\",\"year\":\"2009\",\"crossref\":\"DBLP:conf/hybrid/2009\",\"url\":\"http://dx.doi.org/10.1007/978-3-642-00602-9_7\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"5469\",\"publisher\":\"Springer\",\"doi\":\"10.1007/978-3-642-00602-9_7\",\"urlpaper\":\"papers/hscc-09.pdf\",\"keywords\":\"control, synthesis, hybrid automata\",\"abstract\":\"Int his paper,we show how to apply recent tools for the automatic synthesis of robust and near-optimal controllers for a real industrial case study. We show how to use three different classes of models and their supporting existing tools, UPPAAL-TIGA for synthesis, PHAVER for verification, and SIMULINK for simulation, in a complementary way. We believe that this case study shows that our tools have reached a level of maturity that allows us to tackle interesting and relevant industrial control problems.\",\"bibtex\":\"@inproceedings{DBLP:conf/hybrid/CassezJLRR09,\\n  author    = {Franck Cassez and\\n               Jan Jakob Jessen and\\n               Kim Guldstrand Larsen and\\n               Jean{-}Fran{\\\\c{c}}ois Raskin and\\n               Pierre{-}Alain Reynier},\\n  editor    = {Rupak Majumdar and\\n               Paulo Tabuada},\\n  title     = {Automatic Synthesis of Robust and Optimal Controllers - An Industrial\\n               Case Study},\\n  booktitle = {Hybrid Systems: Computation and Control, 12th International Conference,\\n               {HSCC} 2009, San Francisco, CA, USA, April 13-15, 2009. Proceedings},\\n  pages     = {90--104},\\n  year      = {2009},\\n  crossref  = {DBLP:conf/hybrid/2009},\\n  url       = {http://dx.doi.org/10.1007/978-3-642-00602-9_7},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {5469},\\n  publisher = {Springer},\\n  doi       = {10.1007/978-3-642-00602-9_7},\\n  urlpaper = {papers/hscc-09.pdf},\\n  keywords = {control, synthesis, hybrid automata},\\n        Type = {B - International Conferences},\\n\\n  abstract = { Int his paper,we show how to apply recent tools for the automatic synthesis of robust and near-optimal controllers for a real industrial case study. We show how to use three different classes of models and their supporting existing tools, UPPAAL-TIGA for synthesis, PHAVER for verification, and SIMULINK for simulation, in a complementary way. We believe that this case study shows that our tools have reached a level of maturity that allows us to tackle interesting and relevant industrial control problems.}\\n }\\n\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Jessen, J. J.\",\"Larsen, K. G.\",\"Raskin, J.\",\"Reynier, P.\"],\"editor_short\":[\"Majumdar, R.\",\"Tabuada, P.\"],\"key\":\"DBLP:conf/hybrid/CassezJLRR09\",\"id\":\"DBLP:conf/hybrid/CassezJLRR09\",\"bibbaseid\":\"cassez-jessen-larsen-raskin-reynier-automaticsynthesisofrobustandoptimalcontrollersanindustrialcasestudy-2009\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/hscc-09.pdf\"},\"keyword\":[\"control\",\"synthesis\",\"hybrid automata\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]}],\"title\":\"The Dark Side of Timed Opacity\",\"editor\":[{\"firstnames\":[\"Jong\",\"Hyuk\"],\"propositions\":[],\"lastnames\":[\"Park\"],\"suffixes\":[]},{\"firstnames\":[\"Hsiao-Hwa\"],\"propositions\":[],\"lastnames\":[\"Chen\"],\"suffixes\":[]},{\"firstnames\":[\"Mohammed\"],\"propositions\":[],\"lastnames\":[\"Atiquzzaman\"],\"suffixes\":[]},{\"firstnames\":[\"Changhoon\"],\"propositions\":[],\"lastnames\":[\"Lee\"],\"suffixes\":[]},{\"firstnames\":[\"Tai-Hoon\"],\"propositions\":[],\"lastnames\":[\"Kim\"],\"suffixes\":[]},{\"firstnames\":[\"Sang-Soo\"],\"propositions\":[],\"lastnames\":[\"Yeo\"],\"suffixes\":[]}],\"booktitle\":\"Advances in Information Security and Assurance, Third International Conference and Workshops, ISA 2009, Seoul, Korea, June 25-27, 2009. Proceedings\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"5576\",\"publisher\":\"Springer\",\"pages\":\"21–30\",\"year\":\"2009\",\"crossref\":\"DBLP:conf/sersc-isa/2009\",\"urlpaper\":\"papers/isa-09.pdf\",\"urlslides\":\"papers/slides-isa-09.pdf\",\"doi\":\"10.1007/978-3-642-02617-1_3\",\"bibtex\":\"@inproceedings{DBLP:conf/sersc-isa/Cassez09,\\n  author    = {Franck Cassez},\\n  title     = {The Dark Side of Timed Opacity},\\n  editor    = {Jong Hyuk Park and\\n               Hsiao{-}Hwa Chen and\\n               Mohammed Atiquzzaman and\\n               Changhoon Lee and\\n               Tai{-}Hoon Kim and\\n               Sang{-}Soo Yeo},\\n  booktitle = {Advances in Information Security and Assurance, Third International\\n               Conference and Workshops, {ISA} 2009, Seoul, Korea, June 25-27, 2009.\\n               Proceedings},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {5576},\\n  publisher = {Springer},\\n  pages     = {21--30},\\n  year      = {2009},\\n  crossref  = {DBLP:conf/sersc-isa/2009},\\n  urlpaper       = {papers/isa-09.pdf},\\n  urlslides = {papers/slides-isa-09.pdf},\\n        Type = {B - International Conferences},\\n\\n  doi       = {10.1007/978-3-642-02617-1_3},\\n}\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\"],\"editor_short\":[\"Park, J. H.\",\"Chen, H.\",\"Atiquzzaman, M.\",\"Lee, C.\",\"Kim, T.\",\"Yeo, S.\"],\"key\":\"DBLP:conf/sersc-isa/Cassez09\",\"id\":\"DBLP:conf/sersc-isa/Cassez09\",\"bibbaseid\":\"cassez-thedarksideoftimedopacity-2009\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/isa-09.pdf\",\"Slides\":\"https://franck44.github.io/publications/papers/slides-isa-09.pdf\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inbook\",\"type\":\"C - Book Chapters\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Markey\"],\"firstnames\":[\"Nicolas\"],\"suffixes\":[]}],\"title\":\"Communicating Embedded Systems\",\"editor\":[{\"propositions\":[],\"lastnames\":[\"Jard\"],\"firstnames\":[\"Claude\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Roux\"],\"firstnames\":[\"Olivier\",\"H.\"],\"suffixes\":[]}],\"month\":\"October\",\"pages\":\"83–120\",\"publisher\":\"ISTE Ltd. – John Wiley &amp; Sons, Ltd\",\"chapter\":\"Control of Timed Systems\",\"xxurl\":\"http://www.iste.co.uk/index.php?ACTION=Browse&amp;CatParent=FUB2\",\"year\":\"2009\",\"urlpaper\":\"papers/iste-wiley-book-control.pdf\",\"abstract\":\"In this book Chapter we address the problem of controller synthesis for timed systems. By timed systems we refer to systems which are subject to quantitative (hard) real-time constraints. We assume the reader is familiar with the basics of Timed Automata theory, or has read Chapter 1 and Chapter 2 in this book. \",\"xxnote\":\"Draft version may differ from published one.\",\"bibtex\":\"@inbook{cassez-control-iste-2009,\\n   author = {Franck Cassez and Markey, Nicolas},\\n   title = {Communicating Embedded Systems},\\n   editor = {Jard, Claude and Roux, Olivier H.},\\n   month = oct,\\n   pages = {83--120},\\n   publisher = {ISTE Ltd. -- John Wiley \\\\&amp; Sons, Ltd},\\n   chapter = {Control of Timed Systems},\\n  xxurl = {http://www.iste.co.uk/index.php?ACTION=Browse&amp;CatParent=FUB2},\\n   year = {2009},\\n  urlpaper = {papers/iste-wiley-book-control.pdf},\\nabstract={In this book Chapter we address the problem of controller synthesis for timed systems. By\\ntimed systems we refer to systems which are subject to quantitative (hard) real-time\\nconstraints. We assume the reader is familiar with the basics of Timed Automata\\ntheory, or has read Chapter 1 and Chapter 2 in this book. },\\nXXnote={Draft version may differ from published one.},\\n      Type = {C - Book Chapters},\\n\\n}\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Markey, N.\"],\"editor_short\":[\"Jard, C.\",\"Roux, O. H.\"],\"key\":\"cassez-control-iste-2009\",\"id\":\"cassez-control-iste-2009\",\"bibbaseid\":\"cassez-markey-communicatingembeddedsystems-2009\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/iste-wiley-book-control.pdf\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inbook\",\"type\":\"C - Book Chapters\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tripakis\"],\"firstnames\":[\"Stavros\"],\"suffixes\":[]}],\"title\":\"Communicating Embedded Systems\",\"editor\":[{\"propositions\":[],\"lastnames\":[\"Jard\"],\"firstnames\":[\"Claude\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Roux\"],\"firstnames\":[\"Olivier\",\"H.\"],\"suffixes\":[]}],\"month\":\"October\",\"pages\":\"120–151\",\"publisher\":\"ISTE Ltd. – John Wiley &amp; Sons, Ltd\",\"chapter\":\"Fault Diagnosis of Timed Systems\",\"xxurl\":\"http://www.iste.co.uk/index.php?ACTION=Browse&amp;CatParent=FUB2\",\"year\":\"2009\",\"urlpaper\":\"papers/iste-wiley-book-diag.pdf\",\"abstract\":\"In this book Chapter, we review the main results pertaining to the problem of fault diagnosis of timed automata. Timed automata are introduced in Chapter 1 and Chapter 2 in this book, and the reader not familiar with this model is invited to read them first.\",\"xxnote\":\"Draft version may differ from published one.\",\"bibtex\":\"@inbook{cassez-diag-iste-2009,\\n   author = {Franck Cassez and Tripakis, Stavros},\\n   title = {Communicating Embedded Systems},\\n   editor = {Jard, Claude and Roux, Olivier H.},\\n   month = oct,\\n   pages = {120--151},\\n   publisher = {ISTE Ltd. -- John Wiley \\\\&amp; Sons, Ltd},\\n   chapter = {Fault Diagnosis of Timed Systems},\\n  xxurl = {http://www.iste.co.uk/index.php?ACTION=Browse&amp;CatParent=FUB2},\\n   year = {2009},\\n      Type = {C - Book Chapters},\\n\\n  urlpaper = {papers/iste-wiley-book-diag.pdf},\\nabstract={In this book Chapter, we review the main results pertaining\\n                  to the problem of fault diagnosis of timed\\n                  automata. Timed automata are introduced in Chapter 1\\n                  and Chapter 2 in this book, and the reader not\\n                  familiar with this model is invited to read them\\n                  first.},\\nXXnote={Draft version  may differ from published one.}\\n}\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Tripakis, S.\"],\"editor_short\":[\"Jard, C.\",\"Roux, O. H.\"],\"key\":\"cassez-diag-iste-2009\",\"id\":\"cassez-diag-iste-2009\",\"bibbaseid\":\"cassez-tripakis-communicatingembeddedsystems-2009\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/iste-wiley-book-diag.pdf\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"misc\",\"type\":\"E - Reports\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]}],\"howpublished\":\"Short Note, NICTA, Sydney, Australia\",\"keywords\":\"PHAVer, OS X\",\"title\":\"How to Install PHAVer on Mac OS X\",\"urlpaper\":\"papers/install-phaver-09.pdf\",\"year\":\"2009\",\"url_link\":\"http://www-verimag.imag.fr/~frehse/phaver_web/index.html\",\"abstract\":\"This short note explains how to install PHAVer (and the needed libraries) for a single user on Mac OS X running Leopard (10.5.6). It might also work for earlier versions (you can report to me in case of a successful install on earlier version).\",\"bibtex\":\"@MISC{cassez-compile-phaver-09,\\n  AUTHOR = {Franck Cassez},\\n HOWPUBLISHED = {Short Note, NICTA, Sydney, Australia},\\n  KEYWORDS = {PHAVer, OS X},\\n  TITLE = {{How to Install PHAVer on Mac OS X}},\\n  urlpaper = {papers/install-phaver-09.pdf},\\n  YEAR = {2009},\\nURL_link={http://www-verimag.imag.fr/~frehse/phaver_web/index.html},\\nabstract={This short note explains how to install PHAVer (and the\\n                  needed libraries) for a single user on Mac OS X\\n                  running Leopard (10.5.6). It might also work for\\n                  earlier versions (you can report to me in case of a\\n                  successful install on earlier version).},\\n Type = {E - Reports},\\n}\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n%%% 2008\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\"],\"key\":\"cassez-compile-phaver-09\",\"id\":\"cassez-compile-phaver-09\",\"bibbaseid\":\"cassez-howtoinstallphaveronmacosx-2009\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/install-phaver-09.pdf\",\" link\":\"http://www-verimag.imag.fr/~frehse/phaver_web/index.html\"},\"keyword\":[\"PHAVer\",\"OS X\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"proceedings\",\"type\":\"D - Conference Proceedings\",\"editor\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Claude\"],\"propositions\":[],\"lastnames\":[\"Jard\"],\"suffixes\":[]}],\"title\":\"Formal Modeling and Analysis of Timed Systems, 6th International Conference, FORMATS 2008, Saint Malo, France, September 15-17, 2008. Proceedings\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"5215\",\"publisher\":\"springv\",\"year\":\"2008\",\"isbn\":\"978-3-540-85777-8\",\"timestamp\":\"Fri, 05 Sep 2008 08:05:45 +0200\",\"biburl\":\"http://dblp.uni-trier.de/rec/bib/conf/formats/2008\",\"bibsource\":\"dblp computer science bibliography, http://dblp.org\",\"bibtex\":\"@proceedings{cassez-formats-2008,\\n  editor    = {Franck Cassez and\\n               Claude Jard},\\n  title     = {Formal Modeling and Analysis of Timed Systems, 6th International Conference,\\n               {FORMATS} 2008, Saint Malo, France, September 15-17, 2008. Proceedings},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {5215},\\n  publisher = springv,\\n  year      = {2008},\\n  isbn      = {978-3-540-85777-8},\\n          Type = {D - Conference Proceedings},\\n\\n  timestamp = {Fri, 05 Sep 2008 08:05:45 +0200},\\n  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/formats/2008},\\n  bibsource = {dblp computer science bibliography, http://dblp.org}\\n}\\n\\n\\n\\n\\n\",\"editor_short\":[\"Cassez, F.\",\"Jard, C.\"],\"key\":\"cassez-formats-2008\",\"id\":\"cassez-formats-2008\",\"bibbaseid\":\"cassez-jard-formalmodelingandanalysisoftimedsystems6thinternationalconferenceformats2008saintmalofranceseptember15172008proceedings-2008\",\"role\":\"editor\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"A - Journal\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tripakis\"],\"firstnames\":[\"Stavros\"],\"suffixes\":[]}],\"title\":\"Fault Diagnosis with Static and Dynamic Diagnosers\",\"journal\":\"Fundamenta Informaticae\",\"year\":\"2008\",\"volume\":\"88\",\"number\":\"4\",\"pages\":\"497–540\",\"keywords\":\"fault diagnosis, automata\",\"month\":\"November\",\"abstract\":\"We study sensor minimization problems in the context of fault diagnosis. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in the plant as soon as possible after their occurrence. Existing literature on this problem has considered the case of fixed static observers, where the set of observable events is fixed and does not change during execution of the system. In this paper, we consider static observers where the set of observable events is not fixed, but needs to be optimized (e.g., minimized in size). We also consider dynamic observers, where the observer can ``switc'' sensors on or off, thus dynamically changing the set of events it wishes to observe. It is known that checking diagnosability (i.e., whether a given observer is capable of identifying faults) can be solved in polynomial time for static observers, and we show that the same is true for dynamic ones. On the other hand, minimizing the number of (static) observable events required to achieve diagnosability is NP-complete. We show that this is true also in the case of mask-based observation, where some events are observable but not distinguishable. For dynamic observers' synthesis, we prove that a most permissive finite-state observer can be computed in doubly exponential time, using a game-theoretic approach. We further investigate optimization problems for dynamic observers and define a notion of cost of an observer. We show how to compute an optimal observer using results on mean-payoff games by Zwick and Paterson. \",\"urlpaper\":\"papers/diag-fi-08.pdf\",\"bibtex\":\"@article{cassez-fi-08,\\n  AUTHOR = {Franck Cassez and Tripakis, Stavros},\\n  TITLE = {Fault Diagnosis with Static and Dynamic Diagnosers},\\n  JOURNAL = {Fundamenta Informaticae},\\n  YEAR = {2008},\\n    Type = {A - Journal},\\n\\n  VOLUME = {88},\\n  NUMBER = {4},\\n  PAGES = {497--540},\\n  keywords = {fault diagnosis, automata},\\n  MONTH = NOV,\\n  ABSTRACT = {We study sensor minimization problems in the context of\\n                  fault diagnosis. Fault diagnosis consists in\\n                  synthesizing a diagnoser that observes a given plant\\n                  and identifies faults in the plant as soon as\\n                  possible after their occurrence. Existing literature\\n                  on this problem has considered the case of fixed\\n                  static observers, where the set of observable events\\n                  is fixed and does not change during execution of the\\n                  system. In this paper, we consider static observers\\n                  where the set of observable events is not fixed, but\\n                  needs to be optimized (e.g., minimized in size). We\\n                  also consider dynamic observers, where the observer\\n                  can ``switc'' sensors on or off, thus dynamically\\n                  changing the set of events it wishes to observe. It\\n                  is known that checking diagnosability (i.e., whether\\n                  a given observer is capable of identifying faults)\\n                  can be solved in polynomial time for static\\n                  observers, and we show that the same is true for\\n                  dynamic ones. On the other hand, minimizing the\\n                  number of (static) observable events required to\\n                  achieve diagnosability is NP-complete. We show that\\n                  this is true also in the case of mask-based\\n                  observation, where some events are observable but\\n                  not distinguishable. For dynamic observers'\\n                  synthesis, we prove that a most permissive\\n                  finite-state observer can be computed in doubly\\n                  exponential time, using a game-theoretic\\n                  approach. We further investigate optimization\\n                  problems for dynamic observers and define a notion of\\n                  cost of an observer. We show how to compute an\\n                  optimal observer using results on mean-payoff games\\n                  by Zwick and Paterson.  },\\n  urlpaper = {papers/diag-fi-08.pdf},\\n}\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Tripakis, S.\"],\"key\":\"cassez-fi-08\",\"id\":\"cassez-fi-08\",\"bibbaseid\":\"cassez-tripakis-faultdiagnosiswithstaticanddynamicdiagnosers-2008\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/diag-fi-08.pdf\"},\"keyword\":[\"fault diagnosis\",\"automata\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"A - Journal\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Bérard\"],\"firstnames\":[\"Béatrice\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Haddad\"],\"firstnames\":[\"Serge\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Lime\"],\"firstnames\":[\"Didier\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Roux\"],\"firstnames\":[\"Olivier\",\"H.\"],\"suffixes\":[]}],\"journal\":\"Theoretical Computer Science\",\"publisher\":\"Elsevier\",\"volume\":\"403\",\"number\":\"2–3\",\"pages\":\"202–220\",\"title\":\"When are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?\",\"year\":\"2008\",\"urlpaper\":\"papers/tcs-2008.pdf\",\"abstract\":\"In this paper, we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly included in the class of TA. It is thus natural to try and identify the subclass of TA equivalent to some TPN for the weak timed bisimulation relation. We give a characterization of this subclass and we show that the membership problem and the reachability problem are PSPACE-complete. Furthermore we show that for a TA in this class with integer constants, an equivalent TPN can be built with integer bounds but with a size exponential w.r.t. the original model. Surprisingly, using rational bounds yields a TPN whose size is linear.\",\"bibtex\":\"@article{BCHLR08-tcs,\\n  AUTHOR = {B{\\\\'e}rard, B{\\\\'e}atrice and Franck Cassez and Haddad, Serge and Lime, Didier and Roux, Olivier H.},\\n  JOURNAL = {Theoretical Computer Science},\\n  PUBLISHER = {Elsevier},\\n  VOLUME = 403,\\n  NUMBER = {2--3},\\n  PAGES = {202--220},\\n    Type = {A - Journal},\\n\\n  TITLE = {When are Timed Automata Weakly Timed Bisimilar to Time {P}etri Nets?},\\n  YEAR = {2008},\\n  urlpaper = {papers/tcs-2008.pdf},\\n  abstract = {In this paper, we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly included in the class of TA. It is thus natural to try and identify the subclass of TA equivalent to some TPN for the weak timed bisimulation relation. We give a characterization of this subclass and we show that the membership problem and the reachability problem  are PSPACE-complete. Furthermore we show that for a TA in this class with integer constants, an equivalent TPN can be built with integer bounds but with a size exponential w.r.t. the original model. Surprisingly, using rational bounds yields a TPN whose size is linear.}\\n}\\n\\n\\n\\n\\n\",\"author_short\":[\"Bérard, B.\",\"Cassez, F.\",\"Haddad, S.\",\"Lime, D.\",\"Roux, O. H.\"],\"key\":\"BCHLR08-tcs\",\"id\":\"BCHLR08-tcs\",\"bibbaseid\":\"brard-cassez-haddad-lime-roux-whenaretimedautomataweaklytimedbisimilartotimepetrinets-2008\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/tcs-2008.pdf\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inbook\",\"type\":\"C - Book Chapters\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Cassez\"],\"firstnames\":[\"Franck\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Roux\"],\"firstnames\":[\"Olivier\",\"H.\"],\"suffixes\":[]}],\"editor\":[{\"propositions\":[],\"lastnames\":[\"Kordic\"],\"firstnames\":[\"Vedran\"],\"suffixes\":[]}],\"title\":\"Petri Nets – Theory and Applications\",\"chapter\":\"From Time Petri Nets to Timed Automata\",\"publisher\":\"ARS-VIENNA\",\"year\":\"2008\",\"series\":\"I-Tech Education Online\",\"url\":\"http://intechweb.org/books.php\",\"pages\":\"225–252\",\"pdf\":\"papers/tpn-book-08.pdf\",\"isbn\":\"ISBN 978-3-902613-12-7\",\"note\":\"Free download from ˘rlhttp://intechweb.org/books.php.\",\"abstract\":\"In this chapter we introduce a formalism, \\\\emphTime Petri Nets (TPNs), to model real-time systems. We compare it with another well-known formalism, \\\\emphTimed Automata (TA), used for specifying timed systems. We precisely define the semantics of TPNs and TA and compare them according to two criteria: the \\\\emphlanguages (or set of behaviours) then can generate, and the \\\\emphtrees (or branching behaviours) they can generate. We show that every TPN can be translated into an equivalent TA. Then, we introduce a real-time logic to specify properties of real-time systems. We show how to check that a given TPN satisfies a property written in this logic. For this we use our translation\\\\footnoteThis translation preserves the properties of this logic. from TPNs to TA and check the property on the equivalent TA. Finally we briefly report on experiments for checking real-time properties of TPNs using this framework. \",\"bibtex\":\"@INBOOK{ars-petri-nets,\\n  AUTHOR = {Cassez, Franck and Roux, Olivier H.},\\n  EDITOR = {Kordic, Vedran},\\n  TITLE = {Petri Nets -- Theory and Applications},\\n  CHAPTER = {From Time Petri Nets to Timed Automata},\\n  PUBLISHER = ARS-VIENNA,\\n  YEAR = {2008},\\n  SERIES = {{I}-Tech {E}ducation {O}nline},\\n URL= {http://intechweb.org/books.php},\\n  PAGES = {225--252},\\n  PDF = {papers/tpn-book-08.pdf},\\n  ISBN = {ISBN 978-3-902613-12-7},\\nNOTE={Free download from \\\\url{http://intechweb.org/books.php}.},\\n  ABSTRACT = {In this chapter we introduce a formalism, \\\\emph{Time\\n                  Petri Nets (TPNs)}, to model real-time systems. We\\n                  compare it with another well-known formalism,\\n                  \\\\emph{Timed Automata (TA)}, used for specifying\\n                  timed systems.  We precisely define the semantics of\\n                  TPNs and TA and compare them according to two\\n                  criteria: the \\\\emph{languages} (or set of\\n                  behaviours) then can generate, and the \\\\emph{trees}\\n                  (or branching behaviours) they can generate.  We\\n                  show that every TPN can be translated into an\\n                  equivalent TA.  Then, we introduce a real-time logic\\n                  to specify properties of real-time systems. We show\\n                  how to check that a given TPN satisfies a property\\n                  written in this logic. For this we use our\\n                  translation\\\\footnote{This translation preserves the\\n                  properties of this logic.} from TPNs to TA and check\\n                  the property on the equivalent TA. Finally we\\n                  briefly report on experiments for checking real-time\\n                  properties of TPNs using this framework. },\\n    Type = {C - Book Chapters},\\n}\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n%%% 2007\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Roux, O. H.\"],\"editor_short\":[\"Kordic, V.\"],\"key\":\"ars-petri-nets\",\"id\":\"ars-petri-nets\",\"bibbaseid\":\"cassez-roux-petrinetstheoryandapplications-2008\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://intechweb.org/books.php\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Gilles\"],\"propositions\":[],\"lastnames\":[\"Bernot\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Jean-Paul\"],\"propositions\":[],\"lastnames\":[\"Comet\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Delaplace\"],\"suffixes\":[]},{\"firstnames\":[\"Céline\"],\"propositions\":[],\"lastnames\":[\"Müller\"],\"suffixes\":[]},{\"firstnames\":[\"Olivier F.\"],\"propositions\":[],\"lastnames\":[\"Roux\"],\"suffixes\":[]},{\"firstnames\":[\"Olivier H.\"],\"propositions\":[],\"lastnames\":[\"Roux\"],\"suffixes\":[]}],\"title\":\"Semantics of Biological Regulatory Networks\",\"journal\":\"Electr. Notes Theor. Comput. Sci. (Proceedings of FORMATS 2003)\",\"volume\":\"180\",\"number\":\"3\",\"pages\":\"3–14\",\"year\":\"2007\",\"url\":\"http://dx.doi.org/10.1016/j.entcs.2004.01.038\",\"doi\":\"10.1016/j.entcs.2004.01.038\",\"keywords\":\"bioinformatics, regulatory networks, hybrid systems\",\"abstract\":\"The aim of the paper is to revisit the model of Biological Regulatory Networks (BRN) which was proposed by René Thomas to model the interactions between a set of genes. We give a formal semantics for BRN in terms of transition systems which formalizes the evolution rules given by René Thomas. Then we show how to use this model to find interesting properties of a BRN like the set of stable states, cycles etc using tools for analyzing transition systems.\",\"bibtex\":\"@article{DBLP:journals/entcs/BernotCCDMR07,\\n  author    = {Gilles Bernot and\\n               Franck Cassez and\\n               Jean{-}Paul Comet and\\n               Franck Delaplace and\\n               C{\\\\'{e}}line M{\\\\\\\"{u}}ller and\\n               {Olivier F.} Roux and {Olivier H.} Roux},\\n  title     = {Semantics of Biological Regulatory Networks},\\n  journal   = {Electr. Notes Theor. Comput. Sci. (Proceedings of FORMATS 2003)},\\n  volume    = {180},\\n  number    = {3},\\n  pages     = {3--14},\\n  year      = {2007},\\n  url       = {http://dx.doi.org/10.1016/j.entcs.2004.01.038},\\n  doi       = {10.1016/j.entcs.2004.01.038},\\n  keywords = {bioinformatics, regulatory networks, hybrid systems},\\n  abstract ={The aim of the paper is to revisit the model of Biological Regulatory Networks (BRN) which was proposed by René Thomas to model the interactions between a set of genes. We give a formal semantics for BRN in terms of transition systems which formalizes the evolution rules given by René Thomas. Then we show how to use this model to find interesting properties of a BRN like the set of stable states, cycles etc using tools for analyzing transition systems.},\\n          Type = {B - International Conferences},\\n\\n}\\n\\n\\n\\n\",\"author_short\":[\"Bernot, G.\",\"Cassez, F.\",\"Comet, J.\",\"Delaplace, F.\",\"Müller, C.\",\"Roux, O.\",\"Roux, O.\"],\"key\":\"DBLP:journals/entcs/BernotCCDMR07\",\"id\":\"DBLP:journals/entcs/BernotCCDMR07\",\"bibbaseid\":\"bernot-cassez-comet-delaplace-mller-roux-roux-semanticsofbiologicalregulatorynetworks-2007\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://dx.doi.org/10.1016/j.entcs.2004.01.038\"},\"keyword\":[\"bioinformatics\",\"regulatory networks\",\"hybrid systems\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Stavros\"],\"propositions\":[],\"lastnames\":[\"Tripakis\"],\"suffixes\":[]},{\"firstnames\":[\"Karine\"],\"propositions\":[],\"lastnames\":[\"Altisen\"],\"suffixes\":[]}],\"title\":\"Sensor Minimization Problems with Static or Dynamic Observers for Fault Diagnosis\",\"booktitle\":\"Seventh International Conference on Application of Concurrency to System Design (ACSD 2007), 10-13 July 2007, Bratislava, Slovak Republic\",\"pages\":\"90–99\",\"year\":\"2007\",\"editor\":[{\"firstnames\":[\"Twan\"],\"propositions\":[],\"lastnames\":[\"Basten\"],\"suffixes\":[]},{\"firstnames\":[\"Gabriel\"],\"propositions\":[],\"lastnames\":[\"Juhás\"],\"suffixes\":[]},{\"firstnames\":[\"Sandeep\",\"K.\"],\"propositions\":[],\"lastnames\":[\"Shukla\"],\"suffixes\":[]}],\"crossref\":\"DBLP:conf/acsd/2007\",\"url\":\"http://doi.ieeecomputersociety.org/10.1109/ACSD.2007.65\",\"doi\":\"10.1109/ACSD.2007.65\",\"publisher\":\"IEEE Computer Society\",\"keyworfs\":\"fault diagnosis, automata\",\"urlpaper\":\"papers/acsd07.pdf\",\"urlslides\":\"papers/slides-acsd-07.pdf\",\"abstract\":\"We study sensor minimization problems in the context of fault diagnosis. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in the plant as soon as possible after their occurrence. Existing literature on this problem has considered the case of static observers, where the set of observable events does not change during execution of the system. In this paper, we consider static as well as dynamic observers, where the observer can switch sensors on or off, thus dynamically changing the set of events it wishes to observe.\",\"bibtex\":\"@inproceedings{CassezTA07,\\n  author    = {Franck Cassez and\\n               Stavros Tripakis and\\n               Karine Altisen},\\n  title     = {Sensor Minimization Problems with Static or Dynamic Observers for\\n               Fault Diagnosis},\\n  booktitle = {Seventh International Conference on Application of Concurrency to\\n               System Design {(ACSD} 2007), 10-13 July 2007, Bratislava, Slovak Republic},\\n  pages     = {90--99},\\n  year      = {2007},\\n  editor    = {Twan Basten and\\n               Gabriel Juh{\\\\'{a}}s and\\n               Sandeep K. Shukla},\\n  crossref  = {DBLP:conf/acsd/2007},\\n  url       = {http://doi.ieeecomputersociety.org/10.1109/ACSD.2007.65},\\n  doi       = {10.1109/ACSD.2007.65},\\n  publisher = {{IEEE} Computer Society},\\n  year      = {2007},\\n  keyworfs = {fault diagnosis, automata},\\n  urlpaper = {papers/acsd07.pdf},\\n          Type = {B - International Conferences},\\n\\n  urlslides = {papers/slides-acsd-07.pdf},\\n  abstract = {We study sensor minimization problems in the context of fault diagnosis. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in the plant as soon as possible after their occurrence. Existing literature on this problem has considered the case of static observers, where the set of observable events does not change during execution of the system. In this paper, we consider static as well as dynamic observers, where the observer can switch sensors on or off, thus dynamically changing the set of events it wishes to observe.}\\n}\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Tripakis, S.\",\"Altisen, K.\"],\"editor_short\":[\"Basten, T.\",\"Juhás, G.\",\"Shukla, S. K.\"],\"key\":\"CassezTA07\",\"id\":\"CassezTA07\",\"bibbaseid\":\"cassez-tripakis-altisen-sensorminimizationproblemswithstaticordynamicobserversforfaultdiagnosis-2007\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/acsd07.pdf\",\"Slides\":\"https://franck44.github.io/publications/papers/slides-acsd-07.pdf\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Alexandre\"],\"propositions\":[],\"lastnames\":[\"David\"],\"suffixes\":[]},{\"firstnames\":[\"Kim\",\"Guldstrand\"],\"propositions\":[],\"lastnames\":[\"Larsen\"],\"suffixes\":[]},{\"firstnames\":[\"Didier\"],\"propositions\":[],\"lastnames\":[\"Lime\"],\"suffixes\":[]},{\"firstnames\":[\"Jean-François\"],\"propositions\":[],\"lastnames\":[\"Raskin\"],\"suffixes\":[]}],\"title\":\"Timed Control with Observation Based and Stuttering Invariant Strategies\",\"booktitle\":\"Automated Technology for Verification and Analysis, 5th International Symposium, ATVA 2007, Tokyo, Japan, October 22-25, 2007, Proceedings\",\"pages\":\"192–206\",\"year\":\"2007\",\"editor\":[{\"firstnames\":[\"Kedar\",\"S.\"],\"propositions\":[],\"lastnames\":[\"Namjoshi\"],\"suffixes\":[]},{\"firstnames\":[\"Tomohiro\"],\"propositions\":[],\"lastnames\":[\"Yoneda\"],\"suffixes\":[]},{\"firstnames\":[\"Teruo\"],\"propositions\":[],\"lastnames\":[\"Higashino\"],\"suffixes\":[]},{\"firstnames\":[\"Yoshio\"],\"propositions\":[],\"lastnames\":[\"Okamura\"],\"suffixes\":[]}],\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"4762\",\"publisher\":\"Springer\",\"urlpaper\":\"papers/atva-07.pdf\",\"url_link\":\"http://dx.doi.org/10.1007/978-3-540-75596-8_15\",\"doi\":\"10.1007/978-3-540-75596-8_15\",\"abstract\":\"In this paper we consider the problem of controller synthesis for timed games under imperfect information. Novel to our approach is the requirements to strategies: they should be based on a finite collection of observations and must be stuttering invariant in the sense that repeated identical observations will not change the strategy. We provide a constructive transformation to equivalent finite games with perfect infor- mation, giving decidability as well as allowing for an efficient on-the-fly forward algorithm. We report on application of an initial experimental implementation.\",\"keywords\":\"control, timed automata, partial observation\",\"bibtex\":\"@inproceedings{CassezDLLR07,\\n  author    = {Franck Cassez and\\n               Alexandre David and\\n               Kim Guldstrand Larsen and\\n               Didier Lime and\\n               Jean{-}Fran{\\\\c{c}}ois Raskin},\\n  title     = {Timed Control with Observation Based and Stuttering Invariant Strategies},\\n  booktitle = {Automated Technology for Verification and Analysis, 5th International\\n               Symposium, {ATVA} 2007, Tokyo, Japan, October 22-25, 2007, Proceedings},\\n  pages     = {192--206},\\n  year      = {2007},\\n          Type = {B - International Conferences},\\n\\n  editor    = {Kedar S. Namjoshi and\\n               Tomohiro Yoneda and\\n               Teruo Higashino and\\n               Yoshio Okamura},\\n   series    = {Lecture Notes in Computer Science},\\n  volume    = {4762},\\n  publisher = {Springer},\\n  urlpaper  = {papers/atva-07.pdf},\\n  url_link       = {http://dx.doi.org/10.1007/978-3-540-75596-8_15},\\n  doi       = {10.1007/978-3-540-75596-8_15},\\n  abstract = {In this paper we consider the problem of controller synthesis for timed games under imperfect information. Novel to our approach is the requirements to strategies: they should be based on a finite collection of observations and must be stuttering invariant in the sense that repeated identical observations will not change the strategy. We provide a constructive transformation to equivalent finite games with perfect infor- mation, giving decidability as well as allowing for an efficient on-the-fly forward algorithm. We report on application of an initial experimental implementation.},\\n  keywords = {control, timed automata, partial observation}\\n}\\n\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"David, A.\",\"Larsen, K. G.\",\"Lime, D.\",\"Raskin, J.\"],\"editor_short\":[\"Namjoshi, K. S.\",\"Yoneda, T.\",\"Higashino, T.\",\"Okamura, Y.\"],\"key\":\"CassezDLLR07\",\"id\":\"CassezDLLR07\",\"bibbaseid\":\"cassez-david-larsen-lime-raskin-timedcontrolwithobservationbasedandstutteringinvariantstrategies-2007\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/atva-07.pdf\",\" link\":\"http://dx.doi.org/10.1007/978-3-540-75596-8_15\"},\"keyword\":[\"control\",\"timed automata\",\"partial observation\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]}],\"title\":\"Efficient On-the-Fly Algorithms for Partially Observable Timed Games\",\"booktitle\":\"Formal Modeling and Analysis of Timed Systems, 5th International Conference, FORMATS 2007, Salzburg, Austria, October 3-5, 2007, Proceedings\",\"pages\":\"5–24\",\"year\":\"2007\",\"editor\":[{\"firstnames\":[\"Jean-François\"],\"propositions\":[],\"lastnames\":[\"Raskin\"],\"suffixes\":[]},{\"firstnames\":[\"P.\",\"S.\"],\"propositions\":[],\"lastnames\":[\"Thiagarajan\"],\"suffixes\":[]}],\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"4763\",\"publisher\":\"Springer\",\"urlpaper\":\"papers/formats-07.pdf\",\"urlslides\":\"papers/formats-07-slides.pdf\",\"url_link\":\"http://dx.doi.org/10.1007/978-3-540-75454-1_3\",\"doi\":\"10.1007/978-3-540-75454-1_3\",\"abstract\":\"In this paper, we review some recent results on the efficient synthesis of controllers for timed systems. We first recall the basics of controller synthesis for timed games and then present an efficient on-the-fly algorithm for reachability games and its extension to partially observable timed games.\",\"keywords\":\"control, timed automata\",\"bibtex\":\"@inproceedings{cassez-formats-07,\\n  author    = {Franck Cassez},\\n  title     = {Efficient On-the-Fly Algorithms for Partially Observable Timed Games},\\n  booktitle = {Formal Modeling and Analysis of Timed Systems, 5th International Conference,\\n               {FORMATS} 2007, Salzburg, Austria, October 3-5, 2007, Proceedings},\\n  pages     = {5--24},\\n  year      = {2007},\\n  editor    = {Jean{-}Fran{\\\\c{c}}ois Raskin and\\n               P. S. Thiagarajan},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {4763},\\n          Type = {B - International Conferences},\\n\\n  publisher = {Springer},\\n  urlpaper = {papers/formats-07.pdf},\\n  urlslides = {papers/formats-07-slides.pdf},\\n  url_link       = {http://dx.doi.org/10.1007/978-3-540-75454-1_3},\\n  doi       = {10.1007/978-3-540-75454-1_3},\\n  abstract = { In this paper, we review some recent results on the efficient synthesis of controllers for timed systems. We first recall the basics of controller synthesis for timed games and then present an efficient on-the-fly algorithm for reachability games and its extension to partially observable timed games.},\\n  keywords = {control, timed automata}\\n}\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\"],\"editor_short\":[\"Raskin, J.\",\"Thiagarajan, P. S.\"],\"key\":\"cassez-formats-07\",\"id\":\"cassez-formats-07\",\"bibbaseid\":\"cassez-efficientontheflyalgorithmsforpartiallyobservabletimedgames-2007\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/formats-07.pdf\",\"Slides\":\"https://franck44.github.io/publications/papers/formats-07-slides.pdf\",\" link\":\"http://dx.doi.org/10.1007/978-3-540-75454-1_3\"},\"keyword\":[\"control\",\"timed automata\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Stavros\"],\"propositions\":[],\"lastnames\":[\"Tripakis\"],\"suffixes\":[]},{\"firstnames\":[\"Karine\"],\"propositions\":[],\"lastnames\":[\"Altisen\"],\"suffixes\":[]}],\"title\":\"Synthesis Of Optimal-Cost Dynamic Observers for Fault Diagnosis of Discrete-Event Systems\",\"booktitle\":\"First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering, TASE 2007, June 5-8, 2007, Shanghai, China\",\"publisher\":\"IEEE Computer Society\",\"pages\":\"316–325\",\"year\":\"2007\",\"urlpaper\":\"papers/tase-07.pdf\",\"urlslides\":\"papers/slides-tase-07.pdf\",\"url_link\":\"http://dx.doi.org/10.1109/TASE.2007.51\",\"isbn\":\"0-7695-2856-2\",\"doi\":\"10.1109/TASE.2007.51\",\"abstract\":\"Fault diagnosis consists in synthesizing a diagnoser that observes a given plant through a set of observable events, and identifies faults which are not observable as soon as possible after their occurrence. Existing literature on this problem has considered the case of static observers, where the set of observable events does not change during execution of the system. In this paper, we consider dynamic observers, where the observer can switch sensors on or off, thus dynamically changing the set of events it wishes to observe. We define a notion of cost for such dynamic observers and show that (i) the cost of a given dynamic observer can be computed and (ii) an optimal dynamic observer can be synthesized.\",\"bibtex\":\"@inproceedings{DBLP:conf/tase/CassezTA07,\\n  author    = {Franck Cassez and\\n               Stavros Tripakis and\\n               Karine Altisen},\\n  title     = {Synthesis Of Optimal-Cost Dynamic Observers for Fault Diagnosis of\\n               Discrete-Event Systems},\\n  booktitle = {First Joint {IEEE/IFIP} Symposium on Theoretical Aspects of Software\\n               Engineering, {TASE} 2007, June 5-8, 2007, Shanghai, China},\\n  publisher = {{IEEE} Computer Society},\\n   pages     = {316--325},\\n  year      = {2007},\\n          Type = {B - International Conferences},\\n\\n  urlpaper = {papers/tase-07.pdf},\\n  urlslides = {papers/slides-tase-07.pdf},\\n  url_link       = {http://dx.doi.org/10.1109/TASE.2007.51},\\n  isbn      = {0-7695-2856-2},\\n  doi       = {10.1109/TASE.2007.51},\\n  abstract = {Fault diagnosis consists in synthesizing a diagnoser that observes a given plant through a set of observable events, and identifies faults which are not observable as soon as possible after their occurrence. Existing literature on this problem has considered the case of static observers, where the set of observable events does not change during execution of the system. In this paper, we consider dynamic observers, where the observer can switch sensors on or off, thus dynamically changing the set of events it wishes to observe. We define a notion of cost for such dynamic observers and show that (i) the cost of a given dynamic observer can be computed and (ii) an optimal dynamic observer can be synthesized.},\\n}\\n\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n%%% 2006\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Tripakis, S.\",\"Altisen, K.\"],\"key\":\"DBLP:conf/tase/CassezTA07\",\"id\":\"DBLP:conf/tase/CassezTA07\",\"bibbaseid\":\"cassez-tripakis-altisen-synthesisofoptimalcostdynamicobserversforfaultdiagnosisofdiscreteeventsystems-2007\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/tase-07.pdf\",\"Slides\":\"https://franck44.github.io/publications/papers/slides-tase-07.pdf\",\" link\":\"http://dx.doi.org/10.1109/TASE.2007.51\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"A - Journal\",\"abstract\":\"In this paper, we consider Time Petri Nets (TPN) where time is associated with transitions. We give a formal semantics for TPNs in terms of Timed Transition Systems. Then, we propose a translation from TPNs to Timed Automata (TA) that preserves the behavioral semantics (timed bisimilarity) of the TPNs. For the theory of TPNs this result is two-fold: i) reachability problems and more generally TCTL model-checking are decidable for bounded TPNs; ii) allowing strict time constraints on transitions for TPNs preserves the results described in i). The practical appli- cations of the translation are: i) one can specify a system using both TPNs and Timed Automata and a precise semantics is given to the composition; ii) one can use existing tools for analyzing timed automata (like Kronos, Uppaal or Cmc) to analyze TPNs. In this paper we describe the new feature of the tool Romeo that implements our translation of TPNs in the Uppaal input format. We also report on experiments carried out on various examples and compare the result of our method to state-of-the-art tool for analyzing TPNs. \",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Roux\"],\"firstnames\":[\"Olivier\",\"Henri\"],\"suffixes\":[]}],\"journal\":\"Journal of Software and Systems\",\"pages\":\"1456–1468\",\"urlpaper\":\"papers/jss-06.pdf\",\"title\":\"Structural Translation from Time Petri Nets to Timed Automata\",\"volume\":\"79\",\"number\":\"10\",\"month\":\"October\",\"publisher\":\"Elsevier\",\"year\":\"2006\",\"keywords\":\"Time Petri nets, timed automata, expressiveness\",\"bibtex\":\"@article{cassez-jss-06,\\n  ABSTRACT = {In this paper, we consider Time Petri Nets (TPN)\\n                  where time is associated with transitions. We give a\\n                  formal semantics for TPNs in terms of Timed\\n                  Transition Systems. Then, we propose a translation\\n                  from TPNs to Timed Automata (TA) that preserves the\\n                  behavioral semantics (timed bisimilarity) of the\\n                  TPNs. For the theory of TPNs this result is\\n                  two-fold: i) reachability problems and more\\n                  generally TCTL model-checking are decidable for\\n                  bounded TPNs; ii) allowing strict time constraints\\n                  on transitions for TPNs preserves the results\\n                  described in i). The practical appli- cations of the\\n                  translation are: i) one can specify a system using\\n                  both TPNs and Timed Automata and a precise semantics\\n                  is given to the composition; ii) one can use\\n                  existing tools for analyzing timed automata (like\\n                  Kronos, Uppaal or Cmc) to analyze TPNs. In this\\n                  paper we describe the new feature of the tool Romeo\\n                  that implements our translation of TPNs in the\\n                  Uppaal input format. We also report on experiments\\n                  carried out on various examples and compare the\\n                  result of our method to state-of-the-art tool for\\n                  analyzing TPNs.  },\\n  AUTHOR = {Franck Cassez and Roux, Olivier Henri},\\n  JOURNAL = {Journal of Software and Systems},\\n  Type = {A - Journal},\\n  PAGES = {1456--1468},\\n  urlpaper = {papers/jss-06.pdf},\\n  TITLE = {Structural Translation from Time Petri Nets to Timed Automata},\\n  VOLUME = {79},\\n  NUMBER = {10},\\n  MONTH = OCT,\\n  PUBLISHER = {Elsevier},\\n  YEAR = {2006},\\n  keywords = {Time Petri nets, timed automata, expressiveness}\\n}\\n\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Roux, O. H.\"],\"key\":\"cassez-jss-06\",\"id\":\"cassez-jss-06\",\"bibbaseid\":\"cassez-roux-structuraltranslationfromtimepetrinetstotimedautomata-2006\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/jss-06.pdf\"},\"keyword\":[\"Time Petri nets\",\"timed automata\",\"expressiveness\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Karine\"],\"propositions\":[],\"lastnames\":[\"Altisen\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Stavros\"],\"propositions\":[],\"lastnames\":[\"Tripakis\"],\"suffixes\":[]}],\"title\":\"Monitoring and fault-diagnosis with digital clocks\",\"booktitle\":\"Sixth International Conference on Application of Concurrency to System Design (ACSD 2006), 28-30 June 2006, Turku, Finland\",\"pages\":\"101–110\",\"year\":\"2006\",\"publisher\":\"IEEE Computer Society\",\"urlpaper\":\"papers/acsd06.pdf\",\"urlslides\":\"papers/slides-acsd-06.pdf\",\"url_link\":\"http://dx.doi.org/10.1109/ACSD.2006.10\",\"doi\":\"10.1109/ACSD.2006.10\",\"abstract\":\"We study the monitoring and fault-diagnosis problems for dense-time real-time systems, where observers (monitors and diagnosers) have access to digital rather than analog clocks. Analog clocks are infinitely-precise, thus, not implementable. We show how, given a specification mod- eled as a timed automaton and a timed automaton model of the digital clock, a sound and optimal (i.e., as precise as possible) digital-clock monitor can be synthesized. We also show how, given plant and digital clock modeled as timed automata, we can check existence of a digital-clock diagnoser and, if one exists, how to synthesize it. Finally, we consider the problem of existence of digital-clock diag- nosers where the digital clock is unknown. We show that there are cases where a digital clock, no matter how precise, does not exist, even though the system is diagnosable with analog clocks. Finally, we provide a sufficient condition for digital-clock diagnosability.\",\"keywords\":\"fault diagnosis, timed automata, monitoring\",\"bibtex\":\"@inproceedings{DBLP:conf/acsd/AltisenCT06,\\n  author    = {Karine Altisen and\\n               Franck Cassez and\\n               Stavros Tripakis},\\n  title     = {Monitoring and fault-diagnosis with digital clocks},\\n  booktitle = {Sixth International Conference on Application of Concurrency to System\\n               Design {(ACSD} 2006), 28-30 June 2006, Turku, Finland},\\n  pages     = {101--110},\\n  year      = {2006},\\n  publisher = {{IEEE} Computer Society},\\n  urlpaper = {papers/acsd06.pdf},\\n  urlslides = {papers/slides-acsd-06.pdf},\\n  url_link       = {http://dx.doi.org/10.1109/ACSD.2006.10},\\n  doi       = {10.1109/ACSD.2006.10},\\n          Type = {B - International Conferences},\\n\\n  abstract = {\\nWe study the monitoring and fault-diagnosis problems for dense-time real-time systems, where observers (monitors and diagnosers) have access to digital rather than analog clocks. Analog clocks are infinitely-precise, thus, not implementable. We show how, given a specification mod- eled as a timed automaton and a timed automaton model of the digital clock, a sound and optimal (i.e., as precise as possible) digital-clock monitor can be synthesized. We also show how, given plant and digital clock modeled as timed automata, we can check existence of a digital-clock diagnoser and, if one exists, how to synthesize it. Finally, we consider the problem of existence of digital-clock diag- nosers where the digital clock is unknown. We show that there are cases where a digital clock, no matter how precise, does not exist, even though the system is diagnosable with analog clocks. Finally, we provide a sufficient condition for digital-clock diagnosability.},\\n  keywords = {fault diagnosis, timed automata, monitoring}\\n}\\n\\n\\n\\n\",\"author_short\":[\"Altisen, K.\",\"Cassez, F.\",\"Tripakis, S.\"],\"key\":\"DBLP:conf/acsd/AltisenCT06\",\"id\":\"DBLP:conf/acsd/AltisenCT06\",\"bibbaseid\":\"altisen-cassez-tripakis-monitoringandfaultdiagnosiswithdigitalclocks-2006\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/acsd06.pdf\",\"Slides\":\"https://franck44.github.io/publications/papers/slides-acsd-06.pdf\",\" link\":\"http://dx.doi.org/10.1109/ACSD.2006.10\"},\"keyword\":[\"fault diagnosis\",\"timed automata\",\"monitoring\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Thomas\"],\"propositions\":[],\"lastnames\":[\"Chatain\"],\"suffixes\":[]},{\"firstnames\":[\"Claude\"],\"propositions\":[],\"lastnames\":[\"Jard\"],\"suffixes\":[]}],\"editor\":[{\"firstnames\":[\"Susanne\"],\"propositions\":[],\"lastnames\":[\"Graf\"],\"suffixes\":[]},{\"firstnames\":[\"Wenhui\"],\"propositions\":[],\"lastnames\":[\"Zhang\"],\"suffixes\":[]}],\"title\":\"Symbolic Unfoldings for Networks of Timed Automata\",\"booktitle\":\"Automated Technology for Verification and Analysis, 4th International Symposium, ATVA 2006, Beijing, China, October 23-26, 2006.\",\"pages\":\"307–321\",\"year\":\"2006\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"4218\",\"publisher\":\"Springer\",\"urlpaper\":\"papers/unfolding-rr-06.pdf\",\"urlslides\":\"papers/slides-atva-06.pdf\",\"url_link\":\"http://dx.doi.org/10.1007/11901914_24\",\"doi\":\"10.1007/11901914_24\",\"abstract\":\"In this paper we give a symbolic concurrent semantics for network of timed automata (NTA) in terms of extended symbolic nets. Symbolic nets are standard occurrence nets extended with read arcs and symbolic constraints on places and transitions. We prove that there is a complete finite prefix for any NTA that contains at least the information of the simulation graph of the NTA but keep explicit the notions of concurrency and causality of the network.\",\"keywords\":\"unfoldings, timed automata\",\"bibtex\":\"@inproceedings{DBLP:conf/atva/CassezCJ06,\\n  author    = {Franck Cassez and\\n               Thomas Chatain and\\n               Claude Jard},\\n  editor    = {Susanne Graf and\\n               Wenhui Zhang},\\n  title     = {Symbolic Unfoldings for Networks of Timed Automata},\\n  booktitle = {Automated Technology for Verification and Analysis, 4th International\\n               Symposium, {ATVA} 2006, Beijing, China, October 23-26, 2006.},\\n  pages     = {307--321},\\n  year      = {2006},\\n          Type = {B - International Conferences},\\n\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {4218},\\n  publisher = {Springer},\\n  urlpaper = {papers/unfolding-rr-06.pdf},\\n  urlslides = {papers/slides-atva-06.pdf},\\n  url_link       = {http://dx.doi.org/10.1007/11901914_24},\\n  doi       = {10.1007/11901914_24},\\n  abstract = {In this paper we give a symbolic concurrent semantics for network of timed automata (NTA) in terms of extended symbolic nets. Symbolic nets are standard occurrence nets extended with read arcs and symbolic constraints on places and transitions. We prove that there is a complete finite prefix for any NTA that contains at least the information of the simulation graph of the NTA but keep explicit the notions of concurrency and causality of the network.},\\n  keywords = {unfoldings, timed automata},\\n}\\n\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n%%% 2005\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Chatain, T.\",\"Jard, C.\"],\"editor_short\":[\"Graf, S.\",\"Zhang, W.\"],\"key\":\"DBLP:conf/atva/CassezCJ06\",\"id\":\"DBLP:conf/atva/CassezCJ06\",\"bibbaseid\":\"cassez-chatain-jard-symbolicunfoldingsfornetworksoftimedautomata-2006\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/unfolding-rr-06.pdf\",\"Slides\":\"https://franck44.github.io/publications/papers/slides-atva-06.pdf\",\" link\":\"http://dx.doi.org/10.1007/11901914_24\"},\"keyword\":[\"unfoldings\",\"timed automata\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Olivier\",\"H.\"],\"propositions\":[],\"lastnames\":[\"Roux\"],\"suffixes\":[]}],\"title\":\"Structural Translation from Time Petri Nets to Timed Automata\",\"journal\":\"Electr. Notes Theor. Comput. Sci. (Proceedings of AVOCS 2004)\",\"volume\":\"128\",\"number\":\"6\",\"pages\":\"145–160\",\"year\":\"2005\",\"url\":\"http://dx.doi.org/10.1016/j.entcs.2005.04.009\",\"doi\":\"10.1016/j.entcs.2005.04.009\",\"urlslides\":\"papers/slides-avocs-04.pdf\",\"abstract\":\"In this paper, we consider Time Petri Nets (TPN) where time is associated with transitions. We give a formal semantics for TPNs in terms of Timed Transition Systems. Then, we propose a translation from TPNs to Timed Automata (TA) that preserves the behavioural semantics (timed bisimilarity) of the TPNs. For the theory of TPNs this result is two-fold: i) reachability problems and more generally TCTL model-checking are decidable for bounded TPNs; ii) allowing strict time constraints on transitions for TPNs preserves the results described in i). The practical applications of the translation are: i) one can specify a system using both TPNs and Timed Automata and a precise semantics is given to the composition; ii) one can use existing tools for analysing timed automata (like Kronos, Uppaal or Cmc) to analyse TPNs.\",\"keywords\":\"Petri nets, timed, automata\",\"bibtex\":\"@article{DBLP:journals/entcs/CassezR05,\\n  author    = {Franck Cassez and\\n               Olivier H. Roux},\\n  title     = {Structural Translation from Time Petri Nets to Timed Automata},\\n  journal   = {Electr. Notes Theor. Comput. Sci. (Proceedings of AVOCS 2004)},\\n  volume    = {128},\\n          Type = {B - International Conferences},\\n  number    = {6},\\n  pages     = {145--160},\\n  year      = {2005},\\n  url       = {http://dx.doi.org/10.1016/j.entcs.2005.04.009},\\n  doi       = {10.1016/j.entcs.2005.04.009},\\n  urlslides = {papers/slides-avocs-04.pdf},\\n\\n  abstract = {In this paper, we consider Time Petri Nets (TPN) where time is associated with transitions. We give a formal semantics for TPNs in terms of Timed Transition Systems. Then, we propose a translation from TPNs to Timed Automata (TA) that preserves the behavioural semantics (timed bisimilarity) of the TPNs. For the theory of TPNs this result is two-fold: i) reachability problems and more generally TCTL model-checking are decidable for bounded TPNs; ii) allowing strict time constraints on transitions for TPNs preserves the results described in i). The practical applications of the translation are: i) one can specify a system using both TPNs and Timed Automata and a precise semantics is given to the composition; ii) one can use existing tools for analysing timed automata (like Kronos, Uppaal or Cmc) to analyse TPNs.},\\n  keywords = {Petri nets, timed, automata},\\n}\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Roux, O. H.\"],\"key\":\"DBLP:journals/entcs/CassezR05\",\"id\":\"DBLP:journals/entcs/CassezR05\",\"bibbaseid\":\"cassez-roux-structuraltranslationfromtimepetrinetstotimedautomata-2005\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://dx.doi.org/10.1016/j.entcs.2005.04.009\",\"Slides\":\"https://franck44.github.io/publications/papers/slides-avocs-04.pdf\"},\"keyword\":[\"Petri nets\",\"timed\",\"automata\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Béatrice\"],\"propositions\":[],\"lastnames\":[\"Bérard\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Serge\"],\"propositions\":[],\"lastnames\":[\"Haddad\"],\"suffixes\":[]},{\"firstnames\":[\"Didier\"],\"propositions\":[],\"lastnames\":[\"Lime\"],\"suffixes\":[]},{\"firstnames\":[\"Olivier\",\"H.\"],\"propositions\":[],\"lastnames\":[\"Roux\"],\"suffixes\":[]}],\"title\":\"Comparison of Different Semantics for Time Petri Nets\",\"booktitle\":\"Automated Technology for Verification and Analysis, Third International Symposium, ATVA 2005, Taipei, Taiwan, October 4-7, 2005, Proceedings\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"3707\",\"publisher\":\"Springer\",\"pages\":\"293–307\",\"year\":\"2005\",\"urlpaper\":\"papers/petri-nets-atva05.pdf\",\"url_link\":\"http://dx.doi.org/10.1007/11562948_23\",\"doi\":\"10.1007/11562948_23\",\"abstract\":\"In this paper we study the model of Time Petri Nets (TPNs) where a time interval is associated with the firing of a transition, but we extend it by considering general intervals rather than closed ones. A key feature of timed models is the memory policy, i.e. which timing informations are kept when a transition is fired. The original model selects an intermediate semantics where the transitions disabled after consuming the tokens, as well as the firing transition, are reinitialised. However this semantics is not appropriate for some applications. So we consider here two alternative semantics: the atomic and the persistent atomic ones. First we present relevant patterns of discrete event systems which show the interest of these semantics. Then we compare the expressiveness of the three semantics w.r.t. the weak time bisimilarity establishing inclusion results in the general case. Furthermore we show that some inclusions are strict with unrestricted intervals even when nets are bounded. Then we focus on bounded TPNs with upper-closed intervals and we prove that the semantics are equivalent. Finally taking into account both the practical and the theoretical issues, we conclude that persistent atomic semantics should be preferred.\",\"keywords\":\"Petri nets, semantics, expressiveness\",\"bibtex\":\"@inproceedings{DBLP:conf/atva/BerardCHLR05,\\n  author    = {B{\\\\'{e}}atrice B{\\\\'{e}}rard and\\n               Franck Cassez and\\n               Serge Haddad and\\n               Didier Lime and\\n               Olivier H. Roux},\\n  title     = {Comparison of Different Semantics for Time Petri Nets},\\n  booktitle = {Automated Technology for Verification and Analysis, Third International Symposium, {ATVA} 2005, Taipei, Taiwan, October 4-7, 2005, Proceedings},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {3707},\\n  publisher = {Springer},\\n  pages     = {293--307},\\n          Type = {B - International Conferences},\\n\\n  year      = {2005},\\n  urlpaper = {papers/petri-nets-atva05.pdf},\\n  url_link       = {http://dx.doi.org/10.1007/11562948_23},\\n  doi       = {10.1007/11562948_23},\\n  abstract = {In this paper we study the model of Time Petri Nets (TPNs) where a time interval is associated with the firing of a transition, but we extend it by considering general intervals rather than closed ones. A key feature of timed models is the memory policy, i.e. which timing informations are kept when a transition is fired. The original model selects an intermediate semantics where the transitions disabled after consuming the tokens, as well as the firing transition, are reinitialised. However this semantics is not appropriate for some applications. So we consider here two alternative semantics: the atomic and the persistent atomic ones. First we present relevant patterns of discrete event systems which show the interest of these semantics. Then we compare the expressiveness of the three semantics w.r.t. the weak time bisimilarity establishing inclusion results in the general case. Furthermore we show that some inclusions are strict with unrestricted intervals even when nets are bounded. Then we focus on bounded TPNs with upper-closed intervals and we prove that the semantics are equivalent. Finally taking into account both the practical and the theoretical issues, we conclude that persistent atomic semantics should be preferred.},\\n  keywords = {Petri nets, semantics, expressiveness}\\n}\\n\\n\\n\\n\",\"author_short\":[\"Bérard, B.\",\"Cassez, F.\",\"Haddad, S.\",\"Lime, D.\",\"Roux, O. H.\"],\"key\":\"DBLP:conf/atva/BerardCHLR05\",\"id\":\"DBLP:conf/atva/BerardCHLR05\",\"bibbaseid\":\"brard-cassez-haddad-lime-roux-comparisonofdifferentsemanticsfortimepetrinets-2005\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/petri-nets-atva05.pdf\",\" link\":\"http://dx.doi.org/10.1007/11562948_23\"},\"keyword\":[\"Petri nets\",\"semantics\",\"expressiveness\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Alexandre\"],\"propositions\":[],\"lastnames\":[\"David\"],\"suffixes\":[]},{\"firstnames\":[\"Emmanuel\"],\"propositions\":[],\"lastnames\":[\"Fleury\"],\"suffixes\":[]},{\"firstnames\":[\"Kim\",\"Guldstrand\"],\"propositions\":[],\"lastnames\":[\"Larsen\"],\"suffixes\":[]},{\"firstnames\":[\"Didier\"],\"propositions\":[],\"lastnames\":[\"Lime\"],\"suffixes\":[]}],\"title\":\"Efficient On-the-Fly Algorithms for the Analysis of Timed Games\",\"booktitle\":\"CONCUR 2005 - Concurrency Theory, 16th International Conference, CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005, Proceedings\",\"pages\":\"66–80\",\"year\":\"2005\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"3653\",\"publisher\":\"Springer\",\"urlpaper\":\"papers/efficient-control-concur05.pdf\",\"urlslides\":\"papers/efficient-control-concur05-slides.pdf\",\"url_link\":\"http://dx.doi.org/10.1007/11539452_9\",\"doi\":\"10.1007/11539452_9\",\"abstract\":\"In this paper, we propose a first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties. The algorithm we propose is a symbolic extension of the on-the-fly algorithm suggested by Liu &amp; Smolka [15] for linear-time model-checking of finite-state systems. Being on-the-fly, the symbolic algorithm may terminate long before having explored the entire state-space. Also the individual steps of the algorithm are carried out efficiently by the use of so-called zones as the underlying data structure. Various optimizations of the basic symbolic algorithm are proposed as well as methods for obtaining time-optimal winning strategies (for reachability games). Extensive evaluation of an experimental implementation of the algorithm yields very encouraging performance results.\",\"keywords\":\"control, synthesis, timed games\",\"bibtex\":\"@inproceedings{DBLP:conf/concur/CassezDFLL05,\\n  author    = {Franck Cassez and\\n               Alexandre David and\\n               Emmanuel Fleury and\\n               Kim Guldstrand Larsen and\\n               Didier Lime},\\n  title     = {Efficient On-the-Fly Algorithms for the Analysis of Timed Games},\\n  booktitle = {{CONCUR} 2005 - Concurrency Theory, 16th International Conference,\\n               {CONCUR} 2005, San Francisco, CA, USA, August 23-26, 2005, Proceedings},\\n  pages     = {66--80},\\n  year      = {2005},\\n          Type = {B - International Conferences},\\n\\n    series    = {Lecture Notes in Computer Science},\\n  volume    = {3653},\\n  publisher = {Springer},\\n  urlpaper = {papers/efficient-control-concur05.pdf},\\n  urlslides = {papers/efficient-control-concur05-slides.pdf},\\n  url_link       = {http://dx.doi.org/10.1007/11539452_9},\\n  doi       = {10.1007/11539452_9},\\n  abstract = {In this paper, we propose a first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties.\\nThe algorithm we propose is a symbolic extension of the on-the-fly algorithm suggested by Liu &amp; Smolka [15] for linear-time model-checking of finite-state systems. Being on-the-fly, the symbolic algorithm may terminate long before having explored the entire state-space. Also the individual steps of the algorithm are carried out efficiently by the use of so-called zones as the underlying data structure.\\nVarious optimizations of the basic symbolic algorithm are proposed as well as methods for obtaining time-optimal winning strategies (for reachability games). Extensive evaluation of an experimental implementation of the algorithm yields very encouraging performance results.},\\n  keywords = {control, synthesis, timed games},\\n}\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"David, A.\",\"Fleury, E.\",\"Larsen, K. G.\",\"Lime, D.\"],\"key\":\"DBLP:conf/concur/CassezDFLL05\",\"id\":\"DBLP:conf/concur/CassezDFLL05\",\"bibbaseid\":\"cassez-david-fleury-larsen-lime-efficientontheflyalgorithmsfortheanalysisoftimedgames-2005\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/efficient-control-concur05.pdf\",\"Slides\":\"https://franck44.github.io/publications/papers/efficient-control-concur05-slides.pdf\",\" link\":\"http://dx.doi.org/10.1007/11539452_9\"},\"keyword\":[\"control\",\"synthesis\",\"timed games\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Patricia\"],\"propositions\":[],\"lastnames\":[\"Bouyer\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"François\"],\"propositions\":[],\"lastnames\":[\"Laroussinie\"],\"suffixes\":[]}],\"title\":\"Modal Logics for Timed Control\",\"booktitle\":\"CONCUR 2005 - Concurrency Theory, 16th International Conference, CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005, Proceedings\",\"pages\":\"81–94\",\"year\":\"2005\",\"crossref\":\"DBLP:conf/concur/2005\",\"urlpaper\":\"papers/modal-control-concur05.pdf\",\"urlslides\":\"papers/slides-concur-05.pdf\",\"url_link\":\"http://dx.doi.org/10.1007/11539452_10\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"3653\",\"publisher\":\"Springer\",\"doi\":\"10.1007/11539452_10\",\"abstract\":\"Abstract. In this paper we use the timed modal logic Lnu to specify control objectives for timed plants. We show that the control problem for a large class of objectives can be reduced to a model-checking problem for an extension (Lcont) of the logic Lnu with a new modality. More precisely we define a fragment of Lnu, namely Ldet, such that any control objective of Lnudet can be translated into a Lcont formula that holds for the plant if and only if there is a controller that can enforce the control objective. We also show that the new modality of Lcont strictly increases the expressive power of Lnu while model-checking of Lcont remains EXPTIME-complete.\",\"keywords\":\"control, synthesis, logics\",\"bibtex\":\"@inproceedings{DBLP:conf/concur/BouyerCL05,\\n  author    = {Patricia Bouyer and\\n               Franck Cassez and\\n               Fran{\\\\c{c}}ois Laroussinie},\\n  title     = {Modal Logics for Timed Control},\\n  booktitle = {{CONCUR} 2005 - Concurrency Theory, 16th International Conference,\\n               {CONCUR} 2005, San Francisco, CA, USA, August 23-26, 2005, Proceedings},\\n  pages     = {81--94},\\n  year      = {2005},\\n  crossref  = {DBLP:conf/concur/2005},\\n          Type = {B - International Conferences},\\n\\n  urlpaper = {papers/modal-control-concur05.pdf},\\n  urlslides = {papers/slides-concur-05.pdf},\\n    url_link       = {http://dx.doi.org/10.1007/11539452_10},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {3653},\\n  publisher = {Springer},\\n  doi       = {10.1007/11539452_10},\\n  abstract = {\\nAbstract. In this paper we use the timed modal logic Lnu to specify control objectives for timed plants. We show that the control problem for a large class of objectives can be reduced to a model-checking problem for an extension (Lcont) of the logic Lnu with a new modality.\\nMore precisely we define a fragment of Lnu, namely Ldet, such that any\\ncontrol objective of Lnudet can be translated into a Lcont formula that\\nholds for the plant if and only if there is a controller that can enforce\\nthe control objective.\\nWe also show that the new modality of Lcont strictly increases the expressive power of Lnu\\nwhile model-checking of Lcont remains EXPTIME-complete.},\\n  keywords = {control, synthesis, logics},\\n}\\n\\n\\n\\n\",\"author_short\":[\"Bouyer, P.\",\"Cassez, F.\",\"Laroussinie, F.\"],\"key\":\"DBLP:conf/concur/BouyerCL05\",\"id\":\"DBLP:conf/concur/BouyerCL05\",\"bibbaseid\":\"bouyer-cassez-laroussinie-modallogicsfortimedcontrol-2005\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/modal-control-concur05.pdf\",\"Slides\":\"https://franck44.github.io/publications/papers/slides-concur-05.pdf\",\" link\":\"http://dx.doi.org/10.1007/11539452_10\"},\"keyword\":[\"control\",\"synthesis\",\"logics\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Béatrice\"],\"propositions\":[],\"lastnames\":[\"Bérard\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Serge\"],\"propositions\":[],\"lastnames\":[\"Haddad\"],\"suffixes\":[]},{\"firstnames\":[\"Didier\"],\"propositions\":[],\"lastnames\":[\"Lime\"],\"suffixes\":[]},{\"firstnames\":[\"Olivier\",\"H.\"],\"propositions\":[],\"lastnames\":[\"Roux\"],\"suffixes\":[]}],\"title\":\"Comparison of the Expressiveness of Timed Automata and Time Petri Nets\",\"booktitle\":\"Formal Modeling and Analysis of Timed Systems, Third International Conference, FORMATS 2005, Uppsala, Sweden, September 26-28, 2005, Proceedings\",\"pages\":\"211–225\",\"editor\":[{\"firstnames\":[\"Paul\"],\"propositions\":[],\"lastnames\":[\"Pettersson\"],\"suffixes\":[]},{\"firstnames\":[\"Wang\"],\"propositions\":[],\"lastnames\":[\"Yi\"],\"suffixes\":[]}],\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"3829\",\"publisher\":\"Springer\",\"year\":\"2005\",\"urlpaper\":\"papers/petri-nets-formats05.pdf\",\"urlslides\":\"papers/slides-formats-05.pdf\",\"url_link\":\"http://dx.doi.org/10.1007/11603009_17\",\"doi\":\"10.1007/11603009_17\",\"abstract\":\"In this paper we consider the model of Time Petri Nets (TPN) where time is associated with transitions. We also consider Timed Automata (TA) as defined by Alur &amp; Dill, and compare the expressiveness of the two models w.r.t. timed language acceptance and (weak) timed bisimilarity. We first prove that there exists a TA A s.t. there is no TPN (even unbounded) that is (weakly) timed bisimilar to A. We then propose a structural translation from TA to (1-safe) TPNs preserving timed language acceptance. Further on, we prove that the previous (slightly extended) translation also preserves weak timed bisimilarity for a syntactical subclass of TA. For the theory of TPNs, the consequences are: 1) TA, bounded TPNs and 1-safe TPNs are equally expressive w.r.t. timed language acceptance; 2) TA are strictly more expressive than bounded TPNs w.r.t. timed bisimilarity; 3) The subclass bounded and 1-safe TPNs “`a la Merlin” are equally expressive w.r.t. timed bisimilarity.\",\"keywords\":\"Petri nets, timed automata, expressiveness\",\"bibtex\":\"@inproceedings{DBLP:conf/formats/BerardCHLR05,\\n  author    = {B{\\\\'{e}}atrice B{\\\\'{e}}rard and\\n               Franck Cassez and\\n               Serge Haddad and\\n               Didier Lime and\\n               Olivier H. Roux},\\n  title     = {Comparison of the Expressiveness of Timed Automata and Time Petri\\n               Nets},\\n  booktitle = {Formal Modeling and Analysis of Timed Systems, Third International\\n               Conference, {FORMATS} 2005, Uppsala, Sweden, September 26-28, 2005,\\n               Proceedings},\\n  pages     = {211--225},\\n  editor    = {Paul Pettersson and\\n               Wang Yi},\\n          Type = {B - International Conferences},\\n\\n series    = {Lecture Notes in Computer Science},\\n  volume    = {3829},\\n  publisher = {Springer},\\n  year      = {2005},\\n  urlpaper = {papers/petri-nets-formats05.pdf},\\n  urlslides = {papers/slides-formats-05.pdf},\\n  url_link       = {http://dx.doi.org/10.1007/11603009_17},\\n  doi       = {10.1007/11603009_17},\\n  abstract = { In this paper we consider the model of Time Petri Nets (TPN) where time is associated with transitions. We also consider Timed Automata (TA) as defined by Alur \\\\&amp; Dill, and compare the expressiveness of the two models w.r.t. timed language acceptance and (weak) timed bisimilarity. We first prove that there exists a TA A s.t. there is no TPN (even unbounded) that is (weakly) timed bisimilar to A. We then propose a structural translation from TA to (1-safe) TPNs preserving timed language acceptance. Further on, we prove that the previous (slightly extended) translation also preserves weak timed bisimilarity for a syntactical subclass of TA. For the theory of TPNs, the consequences are: 1) TA, bounded TPNs and 1-safe TPNs are equally expressive w.r.t. timed language acceptance; 2) TA are strictly more expressive than bounded TPNs w.r.t. timed bisimilarity; 3) The subclass bounded and 1-safe TPNs “`a la Merlin” are equally expressive w.r.t. timed bisimilarity.},\\n  keywords = {Petri nets, timed automata, expressiveness},\\n}\\n\\n\\n\\n\",\"author_short\":[\"Bérard, B.\",\"Cassez, F.\",\"Haddad, S.\",\"Lime, D.\",\"Roux, O. H.\"],\"editor_short\":[\"Pettersson, P.\",\"Yi, W.\"],\"key\":\"DBLP:conf/formats/BerardCHLR05\",\"id\":\"DBLP:conf/formats/BerardCHLR05\",\"bibbaseid\":\"brard-cassez-haddad-lime-roux-comparisonoftheexpressivenessoftimedautomataandtimepetrinets-2005\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/petri-nets-formats05.pdf\",\"Slides\":\"https://franck44.github.io/publications/papers/slides-formats-05.pdf\",\" link\":\"http://dx.doi.org/10.1007/11603009_17\"},\"keyword\":[\"Petri nets\",\"timed automata\",\"expressiveness\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Béatrice\"],\"propositions\":[],\"lastnames\":[\"Bérard\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Serge\"],\"propositions\":[],\"lastnames\":[\"Haddad\"],\"suffixes\":[]},{\"firstnames\":[\"Didier\"],\"propositions\":[],\"lastnames\":[\"Lime\"],\"suffixes\":[]},{\"firstnames\":[\"Olivier\",\"H.\"],\"propositions\":[],\"lastnames\":[\"Roux\"],\"suffixes\":[]}],\"title\":\"When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?\",\"booktitle\":\"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"3821\",\"publisher\":\"Springer\",\"editor\":[{\"firstnames\":[\"Ramaswamy\"],\"propositions\":[],\"lastnames\":[\"Ramanujam\"],\"suffixes\":[]},{\"firstnames\":[\"Sandeep\"],\"propositions\":[],\"lastnames\":[\"Sen\"],\"suffixes\":[]}],\"pages\":\"273–284\",\"year\":\"2005\",\"urlpaper\":\"papers/petri-nets-fsttcs05.pdf\",\"url_link\":\"http://dx.doi.org/10.1007/11590156_22\",\"doi\":\"10.1007/11590156_22\",\"abstract\":\"In this paper, we compare Timed Automata (TA) with Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is included in the class of TA. It is thus natural to try and identify the (strict) subclass T of TA that is equivalent to TPN for the weak time bisimulation relation. We give a characterisation of this subclass and we show that the membership problem and the reachability problem for T are PSPACE-complete. Furthermore we show that for a TA in T with integer constants, an equivalent TPN can be built with integer bounds but with a size exponential w.r.t. the original model. Surprisingly, using rational bounds yields a TPN whose size is linear.\",\"keywords\":\"Petri nets, timed automata, bisimulation\",\"bibtex\":\"@inproceedings{DBLP:conf/fsttcs/BerardCHLR05,\\n  author    = {B{\\\\'{e}}atrice B{\\\\'{e}}rard and\\n               Franck Cassez and\\n               Serge Haddad and\\n               Didier Lime and\\n               Olivier H. Roux},\\n        Type = {B - International Conferences},\\n\\n  title     = {When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?},\\n  booktitle = {{FSTTCS} 2005: Foundations of Software Technology and Theoretical\\n               Computer Science, 25th International Conference, Hyderabad, India,\\n               December 15-18, 2005, Proceedings},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {3821},\\n  publisher = {Springer},\\n  editor    = {Ramaswamy Ramanujam and\\n               Sandeep Sen},\\n  pages     = {273--284},\\n  year      = {2005},\\n  urlpaper = {papers/petri-nets-fsttcs05.pdf},\\n  url_link       = {http://dx.doi.org/10.1007/11590156_22},\\n  doi       = {10.1007/11590156_22},\\n  abstract = {In this paper, we compare Timed Automata (TA) with Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is included in the class of TA. It is thus natural to try and identify the (strict) subclass T  of TA that is equivalent to TPN for the weak time bisimulation relation. We give a characterisation of this subclass and we show that the membership problem and the reachability problem for T  are PSPACE-complete. Furthermore we show that for a TA in T  with integer constants, an equivalent TPN can be built with integer bounds but with a size exponential w.r.t. the original model. Surprisingly, using rational bounds yields a TPN whose size is linear.},\\n  keywords = {Petri nets, timed automata, bisimulation},\\n}\\n\\n\\n\\n\\n\",\"author_short\":[\"Bérard, B.\",\"Cassez, F.\",\"Haddad, S.\",\"Lime, D.\",\"Roux, O. H.\"],\"editor_short\":[\"Ramanujam, R.\",\"Sen, S.\"],\"key\":\"DBLP:conf/fsttcs/BerardCHLR05\",\"id\":\"DBLP:conf/fsttcs/BerardCHLR05\",\"bibbaseid\":\"brard-cassez-haddad-lime-roux-whenaretimedautomataweaklytimedbisimilartotimepetrinets-2005\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/petri-nets-fsttcs05.pdf\",\" link\":\"http://dx.doi.org/10.1007/11590156_22\"},\"keyword\":[\"Petri nets\",\"timed automata\",\"bisimulation\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"A - Journal\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Altisen\"],\"firstnames\":[\"Karine\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Bouyer\"],\"firstnames\":[\"Patricia\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cachat\"],\"firstnames\":[\"Thierry\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cassez\"],\"firstnames\":[\"Franck\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Gardey\"],\"firstnames\":[\"Guillaume\"],\"suffixes\":[]}],\"journal\":\"European Journal of Automated Systems\",\"pages\":\"367-380\",\"volume\":\"39\",\"number\":\"1-2-3\",\"publisher\":\"Hermès\",\"title\":\"Introduction au contrôle des systèmes temps-réel\",\"urlpaper\":\"papers/intro-control-msr05.pdf\",\"urlslides\":\"papers/slides-msr05.pdf\",\"url_link\":\"http://www.lsv.ens-cachan.fr/aci-cortos\",\"year\":\"2005\",\"note\":\"From Actes du 5ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'05)\",\"abstract\":\"In this paper we give a quick overview of the area of control of real-time systems.\",\"keywords\":\"control, synthesis, timed games\",\"bibtex\":\"@ARTICLE{Cortos-MSR05-control-journal,\\n  AUTHOR = {Altisen, Karine and Bouyer, Patricia and Cachat, Thierry and Cassez, Franck and Gardey, Guillaume},\\n  JOURNAL = {European Journal of Automated Systems},\\n  PAGES = {367-380},\\n  VOLUME = {39},\\n  NUMBER = {1-2-3},\\n  Type = {A - Journal},\\n  PUBLISHER = {Herm{\\\\`e}s},\\n  TITLE = {Introduction au contrôle des syst{\\\\`e}mes temps-r{\\\\'e}el},\\n  urlpaper = {papers/intro-control-msr05.pdf},\\n  urlslides ={papers/slides-msr05.pdf},\\n  url_link = {http://www.lsv.ens-cachan.fr/aci-cortos},\\n  YEAR = {2005},\\n  note =  {From {A}ctes du 5{\\\\`e}me {C}olloque sur la {M}od{\\\\'e}lisation des {S}yst{\\\\`e}mes {R}{\\\\'e}actifs ({MSR}'05)},\\n  abstract = { In this paper we give a quick overview of the area of control of real-time systems.},\\n  keywords = {control, synthesis, timed games},\\n}\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n%%% 2004\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n\\n\\n\\n\\n\",\"author_short\":[\"Altisen, K.\",\"Bouyer, P.\",\"Cachat, T.\",\"Cassez, F.\",\"Gardey, G.\"],\"key\":\"Cortos-MSR05-control-journal\",\"id\":\"Cortos-MSR05-control-journal\",\"bibbaseid\":\"altisen-bouyer-cachat-cassez-gardey-introductionaucontrledessystmestempsrel-2005\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/intro-control-msr05.pdf\",\"Slides\":\"https://franck44.github.io/publications/papers/slides-msr05.pdf\",\" link\":\"http://www.lsv.ens-cachan.fr/aci-cortos\"},\"keyword\":[\"control\",\"synthesis\",\"timed games\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Patricia\"],\"propositions\":[],\"lastnames\":[\"Bouyer\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Emmanuel\"],\"propositions\":[],\"lastnames\":[\"Fleury\"],\"suffixes\":[]},{\"firstnames\":[\"Kim\",\"Guldstrand\"],\"propositions\":[],\"lastnames\":[\"Larsen\"],\"suffixes\":[]}],\"title\":\"Synthesis of Optimal Strategies Using HyTech\",\"journal\":\"Electr. Notes Theor. Comput. Sci. (Proceedings of GDV)\",\"volume\":\"119\",\"number\":\"1\",\"pages\":\"11–31\",\"year\":\"2004\",\"url\":\"http://dx.doi.org/10.1016/j.entcs.2004.07.006\",\"urlslides\":\"papers/slides-gdv-04.pdf\",\"doi\":\"10.1016/j.entcs.2004.07.006\",\"abstract\":\"Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. The problem of synthesizing an optimal winning strategy for a priced timed game under some hypotheses has been shown decidable in [P. Bouyer, F. Cassez, E. Fleury, and K.G. Larsen. Optimal strategies in priced timed game automata. Research Report BRICS RS-04-4, Denmark, Feb. 2004. Available at http://www.brics.dk/RS/04/4/]. In this paper, we present an algorithm for computing the optimal cost and for synthesizing an optimal strategy in case there exists one. We also describe the implementation of this algorithm with the tool HyTech and present an example.\",\"keywords\":\"control, synthesis, priced timed games, optimal\",\"bibtex\":\"@article{DBLP:journals/entcs/BouyerCFL05,\\n  author    = {Patricia Bouyer and\\n               Franck Cassez and\\n               Emmanuel Fleury and\\n               Kim Guldstrand Larsen},\\n  title     = {Synthesis of Optimal Strategies Using HyTech},\\n  journal   = {Electr. Notes Theor. Comput. Sci. (Proceedings of GDV)},\\n  volume    = {119},\\n  Type = {B - International Conferences},\\n\\n  number    = {1},\\n  pages     = {11--31},\\n  year      = {2004},\\n  url       = {http://dx.doi.org/10.1016/j.entcs.2004.07.006},\\n  urlslides = {papers/slides-gdv-04.pdf},\\n  doi       = {10.1016/j.entcs.2004.07.006},\\n  abstract = {Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. The problem of synthesizing an optimal winning strategy for a priced timed game under some hypotheses has been shown decidable in [P. Bouyer, F. Cassez, E. Fleury, and K.G. Larsen. Optimal strategies in priced timed game automata. Research Report BRICS RS-04-4, Denmark, Feb. 2004. Available at http://www.brics.dk/RS/04/4/]. In this paper, we present an algorithm for computing the optimal cost and for synthesizing an optimal strategy in case there exists one. We also describe the implementation of this algorithm with the tool HyTech and present an example.},\\n  keywords = {control, synthesis, priced timed games, optimal},\\n}\\n\\n\\n\\n\",\"author_short\":[\"Bouyer, P.\",\"Cassez, F.\",\"Fleury, E.\",\"Larsen, K. G.\"],\"key\":\"DBLP:journals/entcs/BouyerCFL05\",\"id\":\"DBLP:journals/entcs/BouyerCFL05\",\"bibbaseid\":\"bouyer-cassez-fleury-larsen-synthesisofoptimalstrategiesusinghytech-2004\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://dx.doi.org/10.1016/j.entcs.2004.07.006\",\"Slides\":\"https://franck44.github.io/publications/papers/slides-gdv-04.pdf\"},\"keyword\":[\"control\",\"synthesis\",\"priced timed games\",\"optimal\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"A - Journal\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Claire\"],\"propositions\":[],\"lastnames\":[\"Pagetti\"],\"suffixes\":[]},{\"firstnames\":[\"Olivier\",\"H.\"],\"propositions\":[],\"lastnames\":[\"Roux\"],\"suffixes\":[]}],\"title\":\"A Timed Extension for ALTARICA\",\"journal\":\"Fundam. Inform.\",\"volume\":\"62\",\"number\":\"3-4\",\"pages\":\"291–332\",\"year\":\"2004\",\"urlpapser\":\"papers/fi-2004.pdf\",\"url_link\":\"http://content.iospress.com/articles/fundamenta-informaticae/fi62-3-4-02\",\"abstract\":\"\",\"keywords\":\"timed automata, semantics\",\"bibtex\":\"@article{DBLP:journals/fuin/CassezPR04,\\n  author    = {Franck Cassez and\\n               Claire Pagetti and\\n               Olivier H. Roux},\\n  title     = {A Timed Extension for {ALTARICA}},\\n  journal   = {Fundam. Inform.},\\n  volume    = {62},\\n  number    = {3-4},\\n  pages     = {291--332},\\n  year      = {2004},\\n  urlpapser = {papers/fi-2004.pdf},\\n  url_link       = {http://content.iospress.com/articles/fundamenta-informaticae/fi62-3-4-02},\\n  ABSTRACT = {  In this paper we present a \\\\emph{timed} extension of the AltaRica\\n  formalism.  Following previous works, we first extend the semantics of\\n  AltaRica with time and define \\\\emph{timed components} and \\\\emph{timed nodes}.\\n  Moreover we lift the \\\\emph{priority features} of AltaRica to the timed\\n  case.  We obtain a timed version of AltaRica, called Timed AltaRica. Finally we give\\n  a translation of a Timed AltaRica specification into a usual timed automaton.\\n  These are the semantic foundations of a high-level hierarchical\\n  language for the specification of timed systems.\\n},\\n Type = {A - Journal},\\n keywords = {timed automata, semantics},\\n abstract = {},\\n}\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Pagetti, C.\",\"Roux, O. H.\"],\"key\":\"DBLP:journals/fuin/CassezPR04\",\"id\":\"DBLP:journals/fuin/CassezPR04\",\"bibbaseid\":\"cassez-pagetti-roux-atimedextensionforaltarica-2004\",\"role\":\"author\",\"urls\":{\"Papser\":\"https://franck44.github.io/publications/papers/fi-2004.pdf\",\" link\":\"http://content.iospress.com/articles/fundamenta-informaticae/fi62-3-4-02\"},\"keyword\":[\"timed automata\",\"semantics\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"firstnames\":[\"Patricia\"],\"propositions\":[],\"lastnames\":[\"Bouyer\"],\"suffixes\":[]},{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Emmanuel\"],\"propositions\":[],\"lastnames\":[\"Fleury\"],\"suffixes\":[]},{\"firstnames\":[\"Kim\",\"Guldstrand\"],\"propositions\":[],\"lastnames\":[\"Larsen\"],\"suffixes\":[]}],\"title\":\"Optimal Strategies in Priced Timed Game Automata\",\"booktitle\":\"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"3328\",\"publisher\":\"Springer\",\"pages\":\"148–160\",\"year\":\"2004\",\"urlpaper\":\"papers/fsttcs04.pdf\",\"url_link\":\"http://dx.doi.org/10.1007/978-3-540-30538-5_13\",\"doi\":\"10.1007/978-3-540-30538-5_13\",\"keywords\":\"control, synthesis, timed games\",\"abstract\":\"Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability games for priced timed game automata and prove that the optimal cost for winning such a game is computable under conditions concerning the non-zenoness of cost and we prove that it is decidable. Under stronger conditions (strictness of constraints) we prove that in case an optimal strategy exists, we can compute a state-based winning optimal strategy.\",\"bibtex\":\"@inproceedings{DBLP:conf/fsttcs/BouyerCFL04,\\n  author    = {Patricia Bouyer and\\n               Franck Cassez and\\n               Emmanuel Fleury and\\n               Kim Guldstrand Larsen},\\n  title     = {Optimal Strategies in Priced Timed Game Automata},\\n  booktitle = {{FSTTCS} 2004: Foundations of Software Technology and Theoretical\\n               Computer Science, 24th International Conference, Chennai, India, December   16-18, 2004, Proceedings},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {3328},\\n  publisher = {Springer},\\n\\n  pages     = {148--160},\\n  year      = {2004},\\n  urlpaper = {papers/fsttcs04.pdf},\\n  url_link       = {http://dx.doi.org/10.1007/978-3-540-30538-5_13},\\n  doi       = {10.1007/978-3-540-30538-5_13},\\n  Type = {B - International Conferences},\\n  keywords = {control, synthesis, timed games},\\n  abstract = {Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability games for priced timed game automata and prove that the optimal cost for winning such a game is computable under conditions concerning the non-zenoness of cost and we prove that it is decidable. Under stronger conditions (strictness of constraints) we prove that in case an optimal strategy exists, we can compute a state-based winning optimal strategy.}\\n}\\n\\n\\n\\n\\n\",\"author_short\":[\"Bouyer, P.\",\"Cassez, F.\",\"Fleury, E.\",\"Larsen, K. G.\"],\"key\":\"DBLP:conf/fsttcs/BouyerCFL04\",\"id\":\"DBLP:conf/fsttcs/BouyerCFL04\",\"bibbaseid\":\"bouyer-cassez-fleury-larsen-optimalstrategiesinpricedtimedgameautomata-2004\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/fsttcs04.pdf\",\" link\":\"http://dx.doi.org/10.1007/978-3-540-30538-5_13\"},\"keyword\":[\"control\",\"synthesis\",\"timed games\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"techreport\",\"type\":\"E - Reports\",\"abstract\":\"Priced timed (game) automata extends timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability games for priced timed game automata and prove that the optimal cost for winning such a game is computable under conditions concerning the non-zenoness of cost. Under stronger conditions (strictness of constraints) we prove in addition that it is decidable whether there is an optimal strategy in which case an optimal strategy can be computed. Our results extend previous decidability result which requires the underlying game automata to be acyclic. Finally, our results are encoded in a first prototype in \\\\em HyTech which is applied on a small case-study.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Bouyer\"],\"firstnames\":[\"Patricia\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cassez\"],\"firstnames\":[\"Franck\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fleury\"],\"firstnames\":[\"Emmanuel\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Larsen\"],\"firstnames\":[\"Kim\",\"Guldstrand\"],\"suffixes\":[]}],\"institution\":\"BRICS, Denmark\",\"lex\":\"Da\",\"xxmonth\":\"February\",\"note\":\"ISSN 0909-0878\",\"category\":\"control\",\"number\":\"RS-04-0\",\"title\":\"Optimal Strategies in Priced Timed Game Automata\",\"url\":\"http://www.brics.dk/RS/04/4/\",\"year\":\"2004\",\"bibtex\":\"@TECHREPORT{bouyer-brics-04,\\n  ABSTRACT = {  Priced timed (game) automata extends timed (game) automata with costs on both locations and transitions. In this paper we focus on\\n  reachability games for priced timed game automata and prove that the\\n  optimal cost for winning such a game is computable under conditions\\n  concerning the\\n  non-zenoness of cost. Under stronger conditions (strictness of\\n  constraints) we prove in addition that it is decidable whether there\\n  is an optimal strategy in which case an optimal strategy can be\\n  computed. Our results extend previous decidability result which\\n  requires the underlying game automata to be acyclic. Finally, our\\n  results are encoded in a first prototype in {\\\\em HyTech} which is applied\\n  on a small case-study.},\\n  AUTHOR = {Bouyer, Patricia and Cassez, Franck and Fleury, Emmanuel and Larsen, Kim Guldstrand},\\n  INSTITUTION = {BRICS, Denmark},\\n  LEX = {Da},\\n  XXMONTH = FEB,\\n  NOTE = {ISSN 0909-0878},\\n  CATEGORY = {control},\\n  NUMBER = {RS-04-0},\\n  TITLE = {{Optimal Strategies in Priced Timed Game Automata}},\\n  TYPE = {E - Reports},\\n  URL = {http://www.brics.dk/RS/04/4/},\\n  YEAR = {2004},\\n\\n}\\n\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n%%% 2003\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n\\n\\n\\n\\n\",\"author_short\":[\"Bouyer, P.\",\"Cassez, F.\",\"Fleury, E.\",\"Larsen, K. G.\"],\"key\":\"bouyer-brics-04\",\"id\":\"bouyer-brics-04\",\"bibbaseid\":\"bouyer-cassez-fleury-larsen-optimalstrategiesinpricedtimedgameautomata-2004\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://www.brics.dk/RS/04/4/\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"abstract\":\"In this paper we present a timed extension of the AltaRica language, Timed AltaRica, and describe the architecture of a compiler from Timed AltaRica to timed automata. We present the features of the language, namely modularity, hierarchical modeling and reuse of components during the specification phase, on an avionics example. Then, we use the compiler from Timed AltaRica to Timed Automata to check some safety properties on the system.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Pagetti\"],\"firstnames\":[\"Claire\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cassez\"],\"firstnames\":[\"Franck\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Roux\"],\"firstnames\":[\"Olivier F.\"],\"suffixes\":[]}],\"booktitle\":\"Formal Aspects of Component Software (FACS'03)\",\"month\":\"September\",\"note\":\"Pisa, Italy, September 8–9, 2003\",\"pages\":\"63–80\",\"pdf\":\"papers/facs-03.pdf\",\"publisher\":\"UNU/IIST, Macau\",\"title\":\"Hierarchical Modeling and Verification of Timed Systems in Timed AltaRica\",\"urlpaper\":\"papers/facs-03.pdf\",\"url_link\":\"http://www.iist.unu.edu/newrh/III/1/docs/techreports/report284.html\",\"year\":\"2003\",\"keywords\":\"timed automata, semantics, components\",\"bibtex\":\"@INPROCEEDINGS{pagetti-facs-2003,\\n  ABSTRACT = { In this paper we present a timed extension of the AltaRica language,\\n  Timed AltaRica, and describe the architecture of a compiler from Timed AltaRica to timed\\n  automata. We present the features of the language, namely\\n  modularity, hierarchical modeling and reuse of components during the\\n  specification phase, on an  avionics example. Then, we use the\\n  compiler from Timed AltaRica to Timed Automata to check some safety properties\\n  on the system.},\\n  AUTHOR = {Pagetti, Claire and Cassez, Franck and Roux, {Olivier F.}},\\n  BOOKTITLE = {Formal Aspects of Component Software (FACS'03)},\\n  MONTH = SEP,\\n  NOTE = {Pisa, Italy, September 8--9, 2003},\\n  PAGES = {63--80},\\n  PDF = {papers/facs-03.pdf},\\n  PUBLISHER = {UNU/IIST, Macau},\\n  TITLE = {{Hierarchical Modeling and Verification of Timed Systems in Timed {AltaRica}}},\\n  urlpaper = {papers/facs-03.pdf},\\n  url_link = {http://www.iist.unu.edu/newrh/III/1/docs/techreports/report284.html},\\n  YEAR = {2003},\\n  Type = {B - International Conferences},\\n  keywords = {timed automata, semantics, components},\\n}\\n\\n\\n\\n\\n\",\"author_short\":[\"Pagetti, C.\",\"Cassez, F.\",\"Roux, O.\"],\"key\":\"pagetti-facs-2003\",\"id\":\"pagetti-facs-2003\",\"bibbaseid\":\"pagetti-cassez-roux-hierarchicalmodelingandverificationoftimedsystemsintimedaltarica-2003\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/facs-03.pdf\",\" link\":\"http://www.iist.unu.edu/newrh/III/1/docs/techreports/report284.html\"},\"keyword\":[\"timed automata\",\"semantics\",\"components\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Cassez\"],\"firstnames\":[\"Franck\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Roux\"],\"firstnames\":[\"Olivier H.\"],\"suffixes\":[]}],\"booktitle\":\"4$<i>ème</i>}$ Colloque Francophone sur la Modélisation des Systèmes Réactifs, (MSR'03)\",\"urlpaper\":\"papers/ri-msr-03.pdf\",\"title\":\"From Time Petri Nets to Timed Automata\",\"year\":\"2003\",\"abstract\":\"In this paper, we consider Time Petri Nets (TPN) where time is associated with transitions. We give a formal semantics for TPNs in terms of Timed Transition Systems. Then, we propose a translation from TPNs to Timed Automata (TA) that preserves the behavioural semantics (timed bisimilarity) of the TPNs. For the theory of TPNs this result is two-fold: i) reachability problems and more generally TCTL model-checking are decidable for bounded TPNs; ii) allowing strict time constraints on transitions for TPNs preserves the results described in i). The practical applications of the translation are: i) one can specify a system using both TPNs and Timed Automata and a precise semantics is given to the composition; ii) one can use existing tools for analysing timed automata (like KRONOS or UPPAAL or CMC) to analyse TPNs. \",\"bibtex\":\"@INPROCEEDINGS{msr-03,\\n  AUTHOR = {Cassez, Franck and Roux, {Olivier H.}},\\n  BOOKTITLE = {4$\\\\textit{\\\\`eme}$ Colloque Francophone sur la Mod{\\\\'e}lisation des Syst{\\\\`e}mes R{\\\\'e}actifs, (MSR'03)},\\n  urlpaper = {papers/ri-msr-03.pdf},\\n  TITLE = {{From Time Petri Nets to Timed Automata}},\\n  YEAR = {2003},\\n  ABSTRACT = {\\n In this paper, we consider Time Petri Nets (TPN) where time is\\n  associated with transitions. We give a formal semantics for TPNs in\\n  terms of Timed Transition Systems.  Then, we propose a translation\\n  from TPNs to Timed Automata (TA) that preserves the behavioural\\n  semantics (timed bisimilarity) of the TPNs.  For the theory of TPNs\\n  this result is two-fold: i) reachability problems and more generally\\n  TCTL model-checking are decidable for bounded TPNs; ii) allowing\\n  strict time constraints on transitions for TPNs preserves the\\n  results described in i).  The practical applications of the\\n  translation are: i) one can specify a system using both TPNs and\\n  Timed Automata and a precise semantics is given to the composition;\\n  ii) one can use existing tools for analysing timed automata (like\\n  KRONOS or UPPAAL or CMC) to analyse TPNs.\\n},\\n  Type = {B - International Conferences}\\n}\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Roux, O.\"],\"key\":\"msr-03\",\"id\":\"msr-03\",\"bibbaseid\":\"cassez-roux-fromtimepetrinetstotimedautomata-2003\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/ri-msr-03.pdf\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Franck\"],\"propositions\":[],\"lastnames\":[\"Cassez\"],\"suffixes\":[]},{\"firstnames\":[\"Kim\",\"Guldstrand\"],\"propositions\":[],\"lastnames\":[\"Larsen\"],\"suffixes\":[]}],\"editor\":[{\"firstnames\":[\"Catuscia\"],\"propositions\":[],\"lastnames\":[\"Palamidessi\"],\"suffixes\":[]}],\"title\":\"The Impressive Power of Stopwatches\",\"booktitle\":\"CONCUR 2000 - Concurrency Theory, 11th International Conference, University Park, PA, USA, August 22-25, 2000, Proceedings\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"1877\",\"pages\":\"138–152\",\"publisher\":\"Springer\",\"year\":\"2000\",\"url\":\"https://doi.org/10.1007/3-540-44618-4\\\\_12\",\"doi\":\"10.1007/3-540-44618-4_12\",\"timestamp\":\"Tue, 14 May 2019 10:00:43 +0200\",\"urlpaper\":\"papers/concur-00.pdf\",\"biburl\":\"https://dblp.org/rec/conf/concur/CassezL00.bib\",\"bibsource\":\"dblp computer science bibliography, https://dblp.org\",\"note\":\"CONCUR Test-Of-Time Award 2022\",\"bibtex\":\"@inproceedings{DBLP:conf/concur/CassezL00,\\n  author    = {Franck Cassez and\\n               Kim Guldstrand Larsen},\\n  editor    = {Catuscia Palamidessi},\\n  title     = {The Impressive Power of Stopwatches},\\n  booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,\\n               University Park, PA, USA, August 22-25, 2000, Proceedings},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {1877},\\n  pages     = {138--152},\\n  publisher = {Springer},\\n  year      = {2000},\\n  url       = {https://doi.org/10.1007/3-540-44618-4\\\\_12},\\n  doi       = {10.1007/3-540-44618-4\\\\_12},\\n  timestamp = {Tue, 14 May 2019 10:00:43 +0200},\\n  urlpaper = {papers/concur-00.pdf},\\n  biburl    = {https://dblp.org/rec/conf/concur/CassezL00.bib},\\n  bibsource = {dblp computer science bibliography, https://dblp.org},\\n  note      = {CONCUR Test-Of-Time Award 2022}\\n}\\n\\n\",\"author_short\":[\"Cassez, F.\",\"Larsen, K. G.\"],\"editor_short\":[\"Palamidessi, C.\"],\"key\":\"DBLP:conf/concur/CassezL00\",\"id\":\"DBLP:conf/concur/CassezL00\",\"bibbaseid\":\"cassez-larsen-theimpressivepowerofstopwatches-2000\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/concur-00.pdf\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"misc\",\"type\":\"E - Reports\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Cassez\"],\"firstnames\":[\"Franck\"],\"suffixes\":[]}],\"howpublished\":\"Actes de l'école d'été ETR'03\",\"xxmonth\":\"September\",\"urlpaper\":\"papers/verif-qualit-etr-03.pdf\",\"urlslides\":\"papers/slides-etr-03.pdf\",\"keywords\":\"verification, logics\",\"title\":\"Vérification qualitative – Model-Checking et Logiques Temporelles\",\"year\":\"2003\",\"abstract\":\"In this paper we give a quick overview of the area of modelling and verification of concurrent systems. We take transition systems as the basic model of concurrent systems, and introduce the temporal logics LTL and CTL. Moreover we give some hints for the model-checking algorithms for LTL and CTL.\",\"bibtex\":\"@MISC{cassez-etr-03,\\n  AUTHOR = {Cassez, Franck},\\n  HOWPUBLISHED = {Actes de l'\\\\'ecole d'\\\\'et\\\\'e ETR'03},\\n  XXMONTH = SEP,\\n  urlpaper = {papers/verif-qualit-etr-03.pdf},\\n  urlslides = {papers/slides-etr-03.pdf},\\n  keywords = {verification, logics},\\n  TITLE = {{V\\\\'erification qualitative -- {Model-Checking} et Logiques Temporelles}},\\n  YEAR = {2003},\\nabstract = {In this paper we give a quick overview of the area of modelling and verification of concurrent systems. We take transition systems as the basic model of concurrent systems, and introduce the temporal logics LTL and CTL. Moreover we give some hints for the model-checking algorithms for LTL and CTL.},\\nType = {E - Reports},\\n}\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n%%% 2002\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n\\n\\n\\n\",\"author_short\":[\"Cassez, F.\"],\"key\":\"cassez-etr-03\",\"id\":\"cassez-etr-03\",\"bibbaseid\":\"cassez-vrificationqualitativemodelcheckingetlogiquestemporelles-2003\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://franck44.github.io/publications/papers/verif-qualit-etr-03.pdf\",\"Slides\":\"https://franck44.github.io/publications/papers/slides-etr-03.pdf\"},\"keyword\":[\"verification\",\"logics\"],\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"B - International Conferences\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Sutre\"],\"firstnames\":[\"Grégoire\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Finkel\"],\"firstnames\":[\"Alain\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Roux\"],\"firstnames\":[\"Olivier F.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Cassez\"],\"firstnames\":[\"Franck\"],\"suffixes\":[]}],\"title\":\"Effective Recognizability and Model Checking of Reactive FIFFO Automata\",\"booktitle\":\"Algebraic Methodology and Software Technology, 7th International Conference, AMAST '98\",\"year\":\"1998\",\"pages\":\"106-123\",\"ee\":\"http://dx.doi.org/10.1007/3-540-49253-4_10\",\"crossref\":\"DBLP:conf/amast/1998\",\"bibsource\":\"DBLP, http://dblp.uni-trier.de\",\"bibtex\":\"@inproceedings{amast-98,\\n  author    = {Sutre, Grégoire  and\\n                Finkel, Alain and\\n                Roux, {Olivier F.} and\\n                Cassez, Franck},\\n  title     = {Effective Recognizability and Model Checking of Reactive\\n               {FIFFO} Automata},\\n  booktitle = {Algebraic Methodology and Software Technology, 7th International\\n               Conference, AMAST '98},\\n  year      = {1998},\\n  pages     = {106-123},\\n  ee        = {http://dx.doi.org/10.1007/3-540-49253-4_10},\\n  crossref  = {DBLP:conf/amast/1998},\\n  bibsource = {DBLP, http://dblp.uni-trier.de},\\n  Type = {B - International Conferences},\\n\\n}\\n\\n\\n\",\"author_short\":[\"Sutre, G.\",\"Finkel, A.\",\"Roux, O.\",\"Cassez, F.\"],\"key\":\"amast-98\",\"id\":\"amast-98\",\"bibbaseid\":\"sutre-finkel-roux-cassez-effectiverecognizabilityandmodelcheckingofreactivefiffoautomata-1998\",\"role\":\"author\",\"urls\":{\"Link\":\"http://dx.doi.org/10.1007/3-540-49253-4_10\"},\"metadata\":{\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\"html\":\"\"}],\n      metadata: {\"owner\":\"cassez, f\",\"authorlinks\":{\"cassez, f\":\"http://science.mq.edu.au/~fcassez/software-verif.html\"}},\n      ownerID: \"aYsqprsgp7HA5GpQ3\"\n    };\n  </script>\n\n  <script type=\"text/javascript\">\n  var site$;\n  if (typeof $ != 'undefined') {\n    console.log('existing jquery: storing and then restoring');\n    site$ = $;\n    $ = null;\n  }\n  </script>\n\n  <script src=\"https://ajax.googleapis.com/ajax/libs/jquery/2.2.4/jquery.min.js\">\n  </script>\n  <script type=\"text/javascript\">\n  if (site$) {\n    console.log('existing jquery: avoiding conflict and restoring');\n    bb$ = $.noConflict(true);\n    $ = site$;\n  } else {\n    bb$ = $;\n  }\n  </script>\n\n  <script src=\"//bibbase.org/js/bibbase.min.js\"\n          type=\"text/javascript\">\n  </script>\n\n  <script type=\"text/javascript\"\n          src=\"https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML\">\n  </script>\n  <script type=\"text/x-mathjax-config\">\n    MathJax.Hub.Config({tex2jax: {inlineMath: [['$','$'], ['\\\\(','\\\\)']]},\n                        skipTags: [\"body\"],\n                        processClass: \"bibbase_paper\"});\n  </script>\n\n  <style>\n  @media print {\n    .dontprint {\n        display: none !important;\n    }\n\n  .bibbase_group {\n    background-color: #E0E0E0;\n    font-style: italic;\n    font-size: larger;\n    text-shadow: 0px 0px 3px #FFFFFF;\n    border-radius: 4px 4px 4px 4px;\n    -moz-border-radius: 4px 4px 4px 4px;\n    -webkit-border-radius: 4px;\n    padding: 5px 40px 5px;\n    margin-top: 10px;\n    margin-bottom: 5px;\n    cursor: pointer;\n  }\n\n  .bibbase_paper {\n    margin-bottom: 5px;\n  }\n\n  }\n  </style>\n\n  \n  <div style=\"float: right; margin-right: 10px; margin-top: 10px; text-align: right; font-size: 12px\">\n    generated by\n    <a href=\"//bibbase.org\"\n       onclick=\"trackOutboundLink('bibbase', 'logo clicked', window.location.href, '//bibbase.org'); return false;\">\n      <img src=\"//bibbase.org/img/logo.svg\"\n           style=\"vertical-align: middle; margin-left: 3px; height: 16px;\"/\n           alt=\"bibbase.org\"\n           title=\"BibBase – The easiest way to maintain your publications page.\"\n        ></a>\n    \n  </div>\n  \n\n  <div id=\"bibbase_header\" class=\"dontprint\" style=\"\">\n\n    <ul class=\"nav nav-pills\" style=\"margin: 0px;\">\n\n      <li class=\"dropdown\" id=\"groupby_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\">\n          Group by\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li class=\"groupby year\"><a onclick=\"groupby('year')\">\n            Year</a>\n        </li>\n        <li class=\"groupby author\"><a onclick=\"groupby('author_short')\">\n            Author</a>\n        </li>\n        <li class=\"groupby type\"><a onclick=\"groupby('type')\">\n            Type</a>\n        </li>\n        <li class=\"groupby keyword\"><a onclick=\"groupby('keyword')\">\n            Keyword</a>\n        </li>\n        <li class=\"groupby downloads\"><a onclick=\"groupby('downloads')\">\n            Downloads</a>\n        </li>\n      </ul>\n      </li>\n\n\n      <li class=\"dropdown\" id=\"menu_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\" alt=\"controls\">\n          <i class=\"fa fa-reorder\" alt=\"controls\"></i>\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li>\n          <a onclick=\"toggleAll()\">\n            <i class=\"fa fa-chevron-down fa-fw\"></i> Expand/Collapse All\n          </a>\n        </li>\n        <li>\n          <a download=\"franck-pubs.bib\" href=\"data:text/bibtex;base64,@inproceedings{dafnyevm-fm-23,
  author    = {Franck Cassez and
               Joanne Fuller and Milad Ketabi and David Pearce and 
               Horacio Mijail Anton Quiles},
  title     = {Formal and Executable Semantics of the EVM in Dafny},
  booktitle = {International Symposium on Formal Methods (FM'23)},
  xxpages     = {445-462},
  year      = {2023},
  series    = {Lecture Notes in Computer Science},
  xxxvolume    = {13047},
  publisher = {Springer},  
  note        = {Forthcoming.},
  urlxx       = {},
  xxxdoi       = {http://doi.org/10.1007/978-3-030-90870-6 24},

  urlpaper = {papers/dafnyevm-fm-23.pdf},
  abstract = {The Ethereum protocol implements a replicated state machine. The network participants keep track of the system state by: 1) agreeing on the sequence of transactions to be processed and 2) computing the state transitions that correspond to the sequence of transactions. Ethereum transactions are programs, called smart contracts, and computing a state transition requires executing some code. The Ethereum Virtual Machine (EVM) provides this capability and can execute programs written in EVM bytecode. We present a formal and executable semantics of the EVM written in the veriﬁcation-friendly language Dafny: it provides (i) a readable, formal and verified specification of the semantics of the EVM; (ii) a framework to formally reason about bytecode.}
}



@inproceedings{DBLP:conf/fmics/CassezFQ22,
  author    = {Franck Cassez and
               Joanne Fuller and
               Horacio Mijail Anton Quiles},
  editor    = {Jan Friso Groote and
               Marieke Huisman},
  title     = {Deductive Verification of Smart Contracts with Dafny},
  booktitle = {Formal Methods for Industrial Critical Systems - 27th International
               Conference, {FMICS} 2022, Warsaw, Poland, September 14-15, 2022, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {13487},
  pages     = {50--66},
  publisher = {Springer},
  year      = {2022},
  url       = {https://doi.org/10.1007/978-3-031-15008-1\_5},
  doi       = {10.1007/978-3-031-15008-1\_5},
  timestamp = {Sat, 10 Sep 2022 20:58:36 +0200},
  biburl    = {https://dblp.org/rec/conf/fmics/CassezFQ22.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org},
  note            = {FMICS Best Paper Award},
  abstract = {
    We present a methodology to develop verified smart contracts. We write smart contracts, their specifications and implementations in the verification-friendly language DAFNY. In our methodology the ability to write specifications, implementations and to reason about correctness is a primary concern. We propose a simple, concise yet powerful solution to reasoning about contracts that have external calls. This includes arbitrary re-entrancy which is a major source of bugs and attacks in smart contracts. Although we do not yet have a compiler from DAFNY to EVM bytecode, the results we obtain on the DAFNY code can reasonably be assumed to hold on Solidity code: the translation of the DAFNY code to Solidity is straightforward. As a result our approach can readily be used to develop and deploy safer contracts.
  }
}



@article{DBLP:journals/corr/abs-2208-02920,
  author    = {Franck Cassez and
               Joanne Fuller and
               Horacio Mijail Anton Quiles},
  title     = {Deductive Verification of Smart Contracts with Dafny},
  journal   = {CoRR},
  volume    = {abs/2208.02920},
  year      = {2022},
  url       = {https://doi.org/10.48550/arXiv.2208.02920},
  doi       = {10.48550/arXiv.2208.02920},
  eprinttype = {arXiv},
  eprint    = {2208.02920},
  timestamp = {Wed, 10 Aug 2022 14:49:54 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2208-02920.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org},
  abstract = {We present a methodology to develop verified smart contracts. We write smart contracts, their specifications and implementations in the verification-friendly language DAFNY. In our methodology the ability to write specifications, implementations and to reason about correctness is a primary concern. We propose a simple, concise yet powerful solution to reasoning about contracts that have external calls. This includes arbitrary re-entrancy which is a major source of bugs and attacks in smart contracts. Although we do not yet have a compiler from DAFNY to EVM bytecode, the results we obtain on the DAFNY code can reasonably be assumed to hold on Solidity code: the translation of the DAFNY code to Solidity is straightforward. As a result our approach can readily be used to develop and deploy safer contracts.}
}




@inproceedings{merkle-fm-21,
  author    = {Franck Cassez},
  title     = {Verification of the Incremental Merkle Tree Algorithm with Dafny},
  booktitle = {International Symposium on Formal Methods (FM'21)},
  pages     = {445-462},
  year      = {2021},
  series    = {Lecture Notes in Computer Science},
  volume    = {13047},
  publisher = {Springer},  
  xxxnote        = {Forthcoming.},
  urlxx       = {},
  doi       = {http://doi.org/10.1007/978-3-030-90870-6 24},

  urlpaper = {papers/merkle-fm-21.pdf},
  abstract = {The Deposit Smart Contract (DSC) is an instrumental component of the Ethereum 2.0 Phase 0 infrastructure. We have developed the first machine-checkable version of the incremental Merkle tree algorithm used in the DSC. We present our new and original correctness proof of the algorithm along with the Dafny machine-checkable version. The main results are: 1) a new proof of total correctness; 2) a software artefact with the proof in the form of the complete Dafny code base and 3) new provably correct optimisations of the algorithm.}
}



@inproceedings{DBLP:conf/tacas/CassezFA22,
  author    = {Franck Cassez and
               Joanne Fuller and
               Aditya Asgaonkar},
  editor    = {Dana Fisman and
               Grigore Rosu},
  title     = {Formal Verification of the Ethereum 2.0 Beacon Chain},
  booktitle = {Tools and Algorithms for the Construction and Analysis of Systems
               - 28th International Conference, {TACAS} 2022, Held as Part of the
               European Joint Conferences on Theory and Practice of Software, {ETAPS}
               2022, Munich, Germany, April 2-7, 2022, Proceedings, Part {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {13243},
  pages     = {167--182},
  publisher = {Springer},
  year      = {2022},
  url       = {https://doi.org/10.1007/978-3-030-99524-9\_9},
  doi       = {10.1007/978-3-030-99524-9\_9},
  timestamp = {Fri, 29 Apr 2022 14:50:36 +0200},
  biburl    = {https://dblp.org/rec/conf/tacas/CassezFA22.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org},
  urlpaper = {papers/eth2-tacas-22.pdf},
  abstract = {We report our experience in the formal verification of the reference implementation of the Beacon Chain.
  The Beacon Chain is the backbone component of the new Proof-of-Stake Ethereum 2.0 network: it is in charge of tracking 
  information about the validators,
  their stakes, their attestations (votes) and if some validators are found to be dishonest, to slash them (they lose some of their stakes).   
  The Beacon Chain is mission-critical and any bug in it could compromise the whole  network.
  The Beacon Chain reference implementation developed by the Ethereum Foundation is written in Python, and provides a detailed operational description of the state machine each Beacon Chain's network participant (node) must implement. 
  We have formally specified and verified the absence of runtime errors in (a large and critical part of) the Beacon Chain reference implementation using the verification-friendly language Dafny.
  During the course of this work, we have uncovered several issues, proposed verified fixes.
  We have also synthesised functional correctness specifications that enable us to provide guarantees beyond
  runtime errors. Our software artefact with the code and proofs in Dafny is available at \url{https://github.com/ConsenSys/eth2.0-dafny}.}
}



@article{DBLP:journals/corr/abs-2110-12909,
  author    = {Franck Cassez and
               Joanne Fuller and
               Aditya Asgaonkar},
  title     = {Formal Verification of the Ethereum 2.0 Beacon Chain},
  journal   = {CoRR},
  volume    = {abs/2110.12909},
  year      = {2021},
  url       = {https://arxiv.org/abs/2110.12909},
  eprinttype = {arXiv},
  eprint    = {2110.12909},
  timestamp = {Thu, 28 Oct 2021 15:25:31 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2110-12909.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}



@article{DBLP:journals/corr/abs-2021,
    title={Verification of the Incremental Merkle Tree Algorithm with Dafny}, 
    author={Franck Cassez},
    year={2021},
    eprint={2105.06009},
    archivePrefix={arXiv},
    primaryClass={cs.LO},
    abstract={
    The Deposit Smart Contract (DSC) is an instrumental component of the Ethereum 2.0 Phase 0 infrastructure. We have developed the first machine-checkable version of the incremental Merkle tree algorithm used in the DSC. We present our new and original correctness proof of the algorithm along with the Dafny machine-checkable version. The main results are: 1) a new proof of total correctness; 2) a software artefact with the proof in the form of the complete Dafny code base and 3) new provably correct optimisations of the algorithm.
    },
  journal   = {CoRR},
  volume    = {abs/2105.06009},
  url       = {https://arxiv.org/abs/2105.06009}
}
  


@article{DBLP:journals/fuin/CassezJL21,
  author    = {Franck Cassez and
               Peter Gj{\o}l Jensen and
               Kim Guldstrand Larsen},
  title     = {Verification and Parameter Synthesis for Real-Time Programs using
               Refinement of Trace Abstraction},
  journal   = {Fundam. Informaticae},
  abstract = {We address the safety verification and synthesis problems for real-time systems. We introduce real-time programs that are made of instructions that can perform assignments to discrete and real-valued variables. They are general enough to capture interesting classes of timed systems such as timed automata, stopwatch automata, time(d) Petri nets and hybrid automata. 
We propose a semi-algorithm using refinement of trace abstractions to solve both the reachability verification problem and the parameter synthesis problem for real-time programs. 
All of the algorithms proposed have been implemented and we have conducted a series of experiments, comparing the performance of our new approach to state-of-the-art tools in classical reachability, robustness analysis and parameter synthesis for timed systems. We show that our new method provides solutions to problems which are unsolvable by the current state-of-the-art tools.},

  volume    = {178},
  number    = {1-2},
  pages     = {31--57},
  year      = {2021},
  url       = {https://doi.org/10.3233/FI-2021-1997},
  doi       = {10.3233/FI-2021-1997},
  timestamp = {Fri, 22 Jan 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/fuin/CassezJL21.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org},
   urlpaper = {papers/fi-2021.pdf},
}



@article{DBLP:journals/corr/abs-2007-10539,
  author    = {Franck Cassez and
               Peter Gj{\o}l Jensen and
               Kim Guldstrand Larsen},
  title     = {Verification and Parameter Synthesis for Real-Time Programs using
               Refinement of Trace Abstraction},
  journal   = {CoRR},
  abstract = {We address the safety verification and synthesis problems for real-time systems. We introduce real-time programs that are made of instructions that can perform assignments to discrete and real-valued variables. They are general enough to capture interesting classes of timed systems such as timed automata, stopwatch automata, time(d) Petri nets and hybrid automata. 
We propose a semi-algorithm using refinement of trace abstractions to solve both the reachability verification problem and the parameter synthesis problem for real-time programs. 
All of the algorithms proposed have been implemented and we have conducted a series of experiments, comparing the performance of our new approach to state-of-the-art tools in classical reachability, robustness analysis and parameter synthesis for timed systems. We show that our new method provides solutions to problems which are unsolvable by the current state-of-the-art tools.},
  volume    = {abs/2007.10539},
  year      = {2020},
  url       = {https://arxiv.org/abs/2007.10539},
  archivePrefix = {arXiv},
  eprint    = {2007.10539},
  timestamp = {Tue, 28 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2007-10539.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}



@article{DBLP:journals/sj/Zheng0PCR18,
  author    = {Xi Zheng and
               Christine Julien and
               Rodion M. Podorozhny and
               Franck Cassez and
               Thierry Rakotoarivelo},
  title     = {Efficient and Scalable Runtime Monitoring for Cyber-Physical System},
  journal   = {{IEEE} Syst. J.},
  abstract={
  Our reliance on cyber-physical systems (CPSs) is increasingly widespread, but scalable methods for the analysis of such systems remain a significant challenge. Runtime verification of CPSs provides a reasonable middle ground between formal verification and simulation approaches, but it comes with its own challenges. A runtime verification system must run directly on the deployed application. In the CPS domain, it is therefore critical that a runtime verification system exhibits low overhead and good scalability so that the verification does not interfere with the analyzed CPS application. In this paper, we introduce Brace, a runtime verification system whose focus is on ensuring these performance qualities for applications in the CPS domain. Brace strives to bound the computation overhead for CPS runtime verification while preserving a high level of monitoring accuracy in terms of the number of false positive and false negative reports. Brace is particularly suitable to systems in which scheduling is distributed across networked CPS components. We evaluate Brace to determine how effectively and efficiently it can detect injected errors in two existing real-life CPS applications with distributed scheduling. Our results demonstrate that Brace efficiently detects those errors and a few true bugs and is able to bound both the memory and computation overhead even in systems with large numbers of observed events.},
  volume    = {12},
  number    = {2},
  pages     = {1667--1678},
  year      = {2018},
  url       = {https://doi.org/10.1109/JSYST.2016.2614599},
  doi       = {10.1109/JSYST.2016.2614599},
  timestamp = {Fri, 11 Sep 2020 15:02:08 +0200},
  biburl    = {https://dblp.org/rec/journals/sj/Zheng0PCR18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}



@inproceedings{mod-17,
  author    = {Franck Cassez and
               Pablo Gonz{\'{a}}lez de Aledo and
               Peter Gj{\o}l Jensen},
  title     = {{WUPPAAL:} Computation of Worst-Case Execution-Time for Binary Programs
               with {UPPAAL}},
  booktitle = {Models, Algorithms, Logics and Tools - Essays Dedicated to Kim Guldstrand
               Larsen on the Occasion of His 60th Birthday},
  pages     = {560--577},
  year      = {2017},
  series    = {Lecture Notes in Computer Science},
  volume    = {10460},
  publisher = {Springer},  
  url       = {https://doi.org/10.1007/978-3-319-63121-9_28},
  doi       = {10.1007/978-3-319-63121-9_28},
  timestamp = {Tue, 22 Aug 2017 08:17:15 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/birthday/CassezAJ17},
  bibsource = {dblp computer science bibliography, http://dblp.org},

  urlpaper = {papers/kim-fest-17.pdf},
  abstract = {We address the problem of computing the worst-case execu- tion-time (WCET) of binary programs using a real-time model-checker. 
  In our previous work, we introduced a fully automated and modular methodology to build a model (network of timed automata) that combined a binary 
  program and the hardware to run the program on. 
  Computing the WCET amounts to finding the longest path time-wise in this model, which can be done using a real-time model checker like Uppaal. 
  In this work, we generalise the previous approach and we define a generic framework to support arbitrary binary language and hardware.
We have implemented our new approach in an extended version of Uppaal, called Wuppaal. 
Experimental results using some standard benchmarks suite for WCET computation (from Malardalen University) 
show that our technique is practical and promising.}
}




@inproceedings{rp-17,
  author    = {Franck Cassez and
               Peter Gj{\o}l Jensen and
               Kim Guldstrand Larsen},
  title     = {Refinement of Trace Abstraction for Real-Time Programs},
  booktitle = {Reachability Problems - 11th International Workshop, {RP} 2017, London,
               UK, September 7-9, 2017, Proceedings},
  volume    = {10506},
  pages     = {42--58},
  year      = {2017},
  publisher = {Springer},
  url       = {https://doi.org/10.1007/978-3-319-67089-8_4},
  doi       = {10.1007/978-3-319-67089-8_4},
  timestamp = {Wed, 30 Aug 2017 15:59:47 +0200},
  isbn      = {978-3-319-67088-1},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/rp/CassezJL17},
  bibsource = {dblp computer science bibliography, http://dblp.org},
  urlpaper = {papers/rp-17.pdf},
  abstract = {Real-time programs are made of instructions that can perform assignments to discrete and real-valued variables. 
  They are general enough to capture interesting classes of timed systems such as timed automata, stopwatch automata, time(d) Petri nets and hybrid automata. 
  We propose a semi-algorithm using refinement of trace abstractions to solve the reachability verification problem for real-time programs. 
  We report on the implementation of our algorithm and we show that our new method provides solutions to problems which are unsolvable by the current state-of-the-art tools.}
}




@inproceedings{scala-17,
author    = {Franck Cassez
and {Anthony M.} Sloane},
  title     = {ScalaSMT: Satisfiability Modulo Theory in Scala (Tool Paper)},
  booktitle = {SCALA'17, October 23--27, 2017, Vancouver, BC, Canada. Proceedings.},
  pages     = {},
  year      = {2017},
  xxxurl       = {http://dx.doi.org/10.1007/978-3-662-46681-0_39},
  xxxdoi       = {10.1007/978-3-662-46681-0_39},
  publisher = "acm",
  xvolume = 9035,
  xxxseries    = lncs,
  mywebpage = {soft-verif},
  keywords = {scala, SMT solvers},
  category = {soft-verif},
  show = {},
  note={forthcoming},
  urlpaper = {papers/scala-17.pdf},
  abstract = {A Satisfiability Modulo Theory (SMT) solver is a program that implements algorithms to automatically determine whether 
  a logical formula is satisfiable. 
  The performance of SMT solvers has dramatically increased in the last decade and for instance, 
  many of the state-of-the-art software analysis tools heavily rely on SMT solving to analyse source code. 
  We present ScalaSMT, a Scala library that leverages the power of SMT solvers and makes SMT solving directly usable in Scala. 
  ScalaSMT provides seamless access to numerous popular SMT solvers like Z3, CVC4, Yices, MathSat or SMTInterpol. 
  Our library comes with a domain-specific language to write terms and logical formulas for a wide range of logical theories, 
  thereby isolating users from the details of particular solvers.},
    Type = {B - International Conferences},
    show = {},
}




@article{DBLP:journals/tecs/ZhengJCPC17,
  author    = {Xi Zheng and
               Christine Julien and
               Hongxu Chen and
               Rodion M. Podorozhny and
               Franck Cassez},
  title     = {Real-Time Simulation Support for Runtime Verification of Cyber-Physical
               Systems},
  journal   = {{ACM} Trans. Embed. Comput. Syst.},
  volume    = {16},
  number    = {4},
  abstract={
    In Cyber-Physical Systems (CPS), cyber and physical components must work seamlessly in tandem. Runtime verification of CPS is essential yet very difficult, due to deployment environments that are expensive, dangerous, or simply impossible to use for verification tasks. A key enabling factor of runtime verification of CPS is the ability to integrate real-time simulations of portions of the CPS into live running systems. We propose a verification approach that allows CPS application developers to opportunistically leverage real-time simulation to support runtime verification. Our approach, termed BraceBind, allows selecting, at runtime, between actual physical processes or simulations of them to support a running CPS application. To build BraceBind, we create a real-time simulation architecture to generate and manage multiple real-time simulation environments based on existing simulation models in a manner that ensures sufficient accuracy for verifying a CPS application. Specifically, BraceBind aims to both improve simulation speed and minimize latency, thereby making it feasible to integrate simulations of physical processes into the running CPS application. BraceBind then integrates this real-time simulation architecture with an existing runtime verification approach that has low computational overhead and high accuracy. This integration uses an aspect-oriented adapter architecture that connects the variables in the cyber portion of the CPS application with either sensors and actuators in the physical world or the automatically generated real-time simulation. Our experimental results show that, with a negligible performance penalty, our approach is both efficient and effective in detecting program errors that are otherwise only detectable in a physical deployment.
  },
  pages     = {106:1--106:24},
  year      = {2017},
  url       = {https://doi.org/10.1145/3063382},
  doi       = {10.1145/3063382},
  timestamp = {Fri, 09 Apr 2021 18:25:32 +0200},
  biburl    = {https://dblp.org/rec/journals/tecs/ZhengJCPC17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}




@misc{cassez2017analysis,
  title={Analysis of program code},
  author={Cassez, F. and M{\"u}ller, C.},
  url={https://www.google.com/patents/US9760469},
  year={2017},
  mywebpage = {soft-verif},
  abstract={
  This disclosure relates to the analysis of a program based on source code where the source code comprises a call to a function associated with a function implementation. A processor determines, based on a summary that over-approximates the function, an assignment of an input variable and an output variable of the function call to reach a predefined state. The processor then determines, based on the implementation of the function whether the assignment of the input variable results in the assignment of the output variable. If it does not, the processor determines a narrowed summary for the function such that the narrowed summary over-approximates the function and excludes the assignment of the input variable and the output variable. Finally, the processor stores the narrowed summary on a datastore. Inlining of function code and unfolding of loops is avoided and parallel processing of multiple functions is possible.
  },
  keywords = {software verification},
  category = {soft-verif},
  month=sep # "~12",
  note={US Patent 9,760,469}
}





@inproceedings{tacas-17,
author    = {Franck Cassez
and {Anthony M.} Sloane
and Matthew Roberts
and Matthew Pigram
and Pongsak Suvanpong
and Pablo Gonz{\'{a}}lez de Aledo Marug{\'{a}}n},
  title     = {Skink: Static Analysis of Programs in LLVM Intermediate Representation (Competition contribution)},
  booktitle = {Tools and Algorithms for the Construction and Analysis of Systems
               - 23rd International Conference, {TACAS} 2017, Held as Part of the
               European Joint Conferences on Theory and Practice of Software, {ETAPS}
               2017, Uppsala, Sweden, April 22-29, 2017. Proceedings},
  
 pages     = {380--384},
  year      = {2017},
  url       = {https://doi.org/10.1007/978-3-662-54580-5_27},
  doi       = {10.1007/978-3-662-54580-5_27},
  publisher = springv,
  xvolume = 10206,
  series    = lncs,
  mywebpage = {soft-verif},
  keywords = {refinement, software verification},
  category = {soft-verif},
  show = {},
  xxnote={forthcoming},
  urlpaper = {papers/sv-comp-2017.pdf},
  abstract = {Skink is a static analysis tool that analyses the LLVM intermediate representation (LLVM-IR)
of a program source code.
The analysis consists of checking whether there is a feasible execution that can reach a
 designated error block in the LLVM-IR.
The result of a program analysis is ``correct'' if the error block is not reachable,
``incorrect'' if the error block is reachable, or ``inconclusive'' if the status of the program could not be determined.
In this paper, we introduce Skink V2.0 to analyse single and multi-threaded C programs.},
    Type = {A - International Conferences},
}



%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% 2016
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%




@inproceedings{scala-16,
 author = {Sloane, {Anthony M.} and Cassez, Franck and Buckley, Scott},
 title = {The {Sbt-rats} Parser Generator Plugin for Scala (Tool Paper)},
 booktitle = {Proceedings of the 2016 7th ACM SIGPLAN Symposium on Scala},
 series = {SCALA 2016},
 year = {2016},
 isbn = {978-1-4503-4648-1},
 location = {Amsterdam, Netherlands},
 pages = {110--113},
 numpages = {4},
 url = {http://doi.acm.org/10.1145/2998392.3001580},
 doi = {10.1145/2998392.3001580},
 urlpaper={papers/scala-2016.pdf},
 xxacmid = {3001580},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {Parsing expression grammars, Scala build tool},
 abstract={Tools for creating parsers are a key part of a mature language eco-system. Scala has traditionally relied on combinator libraries for defining parsers but being libraries they come with fundamental implementation limitations. An alternative is to use a Java-based parser generator such as ANTLR or Rats! but these tools are quite verbose and not ideal to use with Scala code. We describe our experiences with Scala-focused parser generation that is embodied in our sbtrats plugin for the Scala Build Tool. At its simplest, sbtrats provides a bridge to the Rats! parser generator for Java. On top of this bridge, we have a simple grammar definition notation that incorporates annotations for tree construction and pretty-printing. As well as generating a Rats! grammar, sbtrats can optionally generate case class definitions for the tree structure and a pretty-printer defined using our Kiama language processing library. We explain the sbtrats grammar notation and describe our positive experiences using it to define grammars for LLVM assembly notation and the SMTLIB input/output language for SMT solvers.},
 show = {},
 Type = {B - International Conferences},

}





@article{ieee-16,
  title={Efficient and Scalable Runtime Monitoring for Cyber--Physical System},
  author={Zheng, Xi and Christine Julien and {Rodion M.} Podorozhny  and Franck Cassez and Thierry Rakotoarivelo},
  journal={IEEE Systems Journal},
  year={2016},
  volume=99,
  pages={1--12},
  publisher={IEEE},
  doi={10.1109/JSYST.2016.2614599},
  ISSN={1932-8184},
  urlpaper={papers/ieee-systems-2016.pdf},
  url_link={http://ieeexplore.ieee.org/document/7605519/},
  month=oct,
  show = {},
  keywords = {wcet, timed automata},

  abstract={Our reliance on cyber–physical systems (CPSs) is increasingly widespread, but scalable methods for the analysis of such systems remain a significant challenge. Runtime verification of CPSs provides a reasonable middle ground between formal verification and simulation approaches, but it comes with its own challenges. A runtime verification system must run directly on the deployed application. In the CPS domain, it is therefore critical that a runtime verification system exhibits low overhead and good scalability so that the verification does not interfere with the analyzed CPS application. In this paper, we introduce Brace, a runtime verification system whose focus is on ensuring these performance qualities for applications in the CPS domain. Brace strives to bound the computation overhead for CPS runtime verification while preserving a high level of monitoring accuracy in terms of the number of false positive and false negative reports. Brace is particularly suitable to systems in which scheduling is distributed across networked CPS components. We evaluate Brace to determine how effectively and efficiently it can detect injected errors in two existing real-life CPS applications with distributed scheduling. Our results demonstrate that Brace efficiently detects those errors and a few true bugs and is able to bound both the memory and computation overhead even in systems with large numbers of observed events.},
  Type = {A - Journal},

}





@article{cassez-tcs-2016,
  author    = {Franck Cassez and
               Ron van der Meyden and
               Chenyi Zhang},
  title     = {The complexity of synchronous notions of information flow security},
  journal   = {Theor. Comput. Sci.},
  volume    = {631},
  pages     = {16--42},
  year      = {2016},
  urlpaper = {papers/tcs-2016.pdf},
  url_link       = {http://dx.doi.org/10.1016/j.tcs.2016.03.011},
  doi       = {10.1016/j.tcs.2016.03.011},
  timestamp = {Tue, 17 May 2016 17:26:44 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/tcs/CassezMZ16},
  bibsource = {dblp computer science bibliography, http://dblp.org},
  show = {},
  abstract={The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one in which agents operate synchronously with awareness of the global clock. This enables timing based attacks to be captured, whereas previous work on this topic has dealt primarily with asynchronous systems. Versions of the notions of nondeducibility on inputs, nondeducibility on strategies, and an unwinding based notion are formulated for this model. All three notions are shown to be decidable, and their computational complexity is characterised.},
  Type = {A - Journal},
  keywords = {security, non-interference},


}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% 2015
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%





@inproceedings{mass-Zheng-15,
  author    = {Xi Zheng and
               Christine Julien and
               {Rodion M.} Podorozhny and
               Franck Cassez},
  title     = {BraceAssertion: Runtime Verification of Cyber-Physical Systems},
  booktitle = {12th {IEEE} International Conference on Mobile Ad Hoc and Sensor Systems,
               {MASS} 2015, Dallas, TX, USA, October 19-22, 2015},
  pages     = {298--306},
  year      = {2015},
  urlpaper = {papers/mass-2015.pdf},
  url_link       = {http://dx.doi.org/10.1109/MASS.2015.15},
  doi       = {10.1109/MASS.2015.15},
  timestamp = {Fri, 06 May 2016 13:36:43 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/mass/ZhengJPC15},
  bibsource = {dblp computer science bibliography, http://dblp.org},
  show = {},
  keywords = {wcet, timed automata},

  abstract={Cyber-Physical Systems (CPS) have gained wide popularity, however, developing and debugging CPS remain significant challenges. Many bugs are detectable only at runtime under deployment conditions that may be unpredictable or at least unexpected at development time. The current state of the practice of debugging CPS is generally ad hoc, involving trial and error in a real deployment. For increased rigor, it is appealing to bring formal methods to CPS verification. However developers often eschew formal approaches due to complexity and lack of efficiency. This paper presents Brace Assertion, a specification framework based on natural language queries that are automatically converted to a determinitic class of timed automata used for runtime monitoring. To reduce runtime overhead and support properties that reference predicate logic, we use a second monitor automaton to create filtered traces on which to run the analysis using the specification monitor. We evaluate the Brace Assertion framework using a real CPS case study and show that the framework is able to minimize runtime overhead with an increasing number of monitors.},
  Type = {B - International Conferences},

}





@inproceedings{cassez-mars-2015,
  author    = {Franck Cassez and
               Pablo Gonz{\'{a}}lez de Aledo Marug{\'{a}}n},
  title     = {Timed Automata for Modelling Caches and Pipelines},
  booktitle = {Proceedings Workshop on Models for Formal Analysis of Real Systems,
               {MARS} 2015, Suva, Fiji, November 23, 2015.},
  pages     = {37--45},
  year      = {2015},
   editor    = {Rob J. van Glabbeek and
               Jan Friso Groote and
               Peter H{\"{o}}fner},
                series    = {{EPTCS}},
  volume    = {196},
  year      = {2015},
  url_link       = {http://dx.doi.org/10.4204/EPTCS.196.4},
    urlslides = {papers/slides-mars-2015.pdf},
  doi       = {10.4204/EPTCS.196.4},
  category= {wcet},
  mywebpage = {wcet},
  show = {},
  keywords = {wcet, timed automata},
  abstract = {
  In this paper, we focus on modelling the timing aspects of binary programs running on architectures featuring caches and pipelines. The objective is to obtain a timed automaton model to compute tight bounds for the worst-case execution time (WCET) of the programs using model-checking techniques.
  },
  Type = {B - International Conferences},
}





@inproceedings{cassez-lpar-2015,
  author    = {Franck Cassez and
               Frowin Ziegler},
                editor    = {Martin Davis and
               Ansgar Fehnker and
               Annabelle McIver and
               Andrei Voronkov},
  title     = {Verification of Concurrent Programs Using Trace Abstraction Refinement},
  booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning - 20th
               International Conference, {LPAR-20} 2015, Suva, Fiji, November 24-28,
               2015, Proceedings},
  pages     = {233--248},
  year      = {2015},
  series    = {Lecture Notes in Computer Science},
  volume    = {9450},
  publisher = {Springer},
  year      = {2015},
  url       = {http://dx.doi.org/10.1007/978-3-662-48899-7_17},
  mywebpage = {soft-verif},
  category = {soft-verif},
  isbn      = {978-3-662-48898-0},
  doi       = {10.1007/978-3-662-48899-7_17},
  show = {},
  note = {LPAR FMICS  paper award},
  urlpaper = {papers/lpar-2015.pdf},
    urlslides = {papers/slides-lpar-2015.pdf},
  abstract = {Verifying concurrent programs is notoriously hard due to the state explosion problem: (1) the data state space can be very large as the variables can range over very large sets, and (2) the control state space is the Cartesian product of the control state space of the concurrent com- ponents and thus grows exponentially in the number of components. On the one hand, the most successful approaches to address the control state explosion problem are based on assume-guarantee reasoning or model-checking coupled with partial order reduction. On the other hand, the most successful techniques to address the data space explosion problem for sequential programs verification are based on the abstraction/refine- ment paradigm which consists in refining an abstract over-approximation of a program via predicate refinement. In this paper, we show that we can combine partial order reduction techniques with trace abstraction refinement. We apply our approach to standard benchmarks and show that it matches current state-of-the-art analysis techniques.},
  Type = {B - International Conferences},
}





@inproceedings{tacas-15,
author    = {Franck Cassez and
               Takashi Matsuoka and
               Edward Pierzchalski and
               Nathan Smyth},
  title     = {Perentie: Modular Trace Refinement and Selective Value Tracking -
               (Competition Contribution)},
  booktitle = {Tools and Algorithms for the Construction and Analysis of Systems
               - 21st International Conference, {TACAS} 2015, Held as Part of the
               European Joint Conferences on Theory and Practice of Software, {ETAPS}
               2015, London, UK, April 11-18, 2015. Proceedings},
  pages     = {439--442},
  year      = {2015},
  url       = {http://dx.doi.org/10.1007/978-3-662-46681-0_39},
  doi       = {10.1007/978-3-662-46681-0_39},
  publisher = springv,
  volume = 9035,
  series    = lncs,
  mywebpage = {soft-verif},
  keywords = {refinement, software verification},
  category = {soft-verif},
  show = {},
  urlpaper = {papers/sv-comp-2015.pdf},
  abstract = {Perentie is a software analysis tool based on iterative refinement of trace abstraction:
  if the refinement process terminates, the program is either declared correct or a counterexample is
  provided and the program is incorrect.},
    Type = {B - International Conferences},

}


%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% 2014
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%





@article{ijc-14,
author = {Benattar, Gilles and Franck Cassez and Lime, Didier
and Roux, Olivier H.},
title = {Control and Synthesis of Non-Interferent Timed
Systems},
Type = {A - Journal},
journal = {International Journal of Control}, 
volume = {88}, 
number =
{2},
pages = {217--236},
year = {2015},
doi = {10.1080/00207179.2014.944356},
mywebpage = {timed},
urlpaper = {papers/ijc-2014.pdf},
ee = {http://www.tandfonline.com/eprint/h7nIKxnegMGR5M7EaeSF/full},
keywords = {security, non-interference},
category = {Non-interference},
abstract = {We focus on the control and the
synthesis of secure timed systems which are modelled as timed automata. The
security property that the system must satisfy is a non-interference property.
Intuitively, non-interference ensures the absence of any causal dependency from
a high-level domain to a lower level domain. Various notions of non-interference
have been defined in the literature, and in this paper, we focus on strong non-
deterministic non-interference (SNNI) and two (bi)simulation-based variants
thereof (cosimulation-based SNNI and bisimulation-based SNNI). These properties
and their extensions have been mostly studied in the context of discrete event
systems, while it is now well-known that time is an important attack vector
against secure systems. At the same time, there is an obvious interest in going
beyond simple verification to control problems: to be able to automatically make
systems secure. We consider non-interference properties in the challenging
setting of control of dense-time systems specified by timed automata and we
study the two following problems: (1) check whether it is possible to find a
sub-system so that it is non- interferent; if yes, (2) compute a (largest) sub-
system which is non- interferent. We exhibit decidable sub-classes for these
problems, assess their theoretical complexities and provide effective algorithms
based on the classical framework of timed games.}
}






@proceedings{atva-14,
  editor    = {Franck Cassez and
               Jean-François Raskin},
  title     = {Automated Technology for Verification and Analysis - 12th International
               Symposium, {ATVA} 2014, Sydney, NSW, Australia, November 3-7, 2014,
               Proceedings},
  series    = lncs,
  volume    = {8837},
  publisher = springv,
  year      = {2014},
  url       = {http://dx.doi.org/10.1007/978-3-319-11936-6},
  doi       = {10.1007/978-3-319-11936-6},
  show = {},
  category = {Proceedings (Editor)},
  isbn      = {978-3-319-11935-9},
  Type = {D - Conference Proceedings},
}






@inproceedings{fsttcs-14,
  author    = {Franck Cassez and
               Christian Müller and
               Karla Burnett},
  title     = {Summary-Based Inter-Procedural Analysis via Modular Trace Refinement},
  booktitle = {34th International Conference on Foundation of Software Technology
               and Theoretical Computer Science, {FSTTCS} 2014, December 15-17, 2014,
               New Delhi, India},
  pages     = {545--556},
  year      = {2014},
  mywebpage = {soft-verif},
  category = {Software verification},
  keywords = {trace refinement, software verification, Hoare logic},
  url_link       = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2014.545},
  doi       = {10.4230/LIPIcs.FSTTCS.2014.545},
  abstract = {We propose a generalisation of trace refinement for the verification of inter-procedural programs.
  Our method is a top-down modular, summary-based approach, and analyses inter-procedural programs by building function summaries on-demand
  and improving the summaries each time a function is analysed. Our method is sound, and complete relative to the existence of a
  modular Hoare proof for a non-recursive program. We have implemented a prototype analyser that demonstrates the
  main features of our approach and yields promising results.
  },
  Type = {B - International Conferences},
}






@inproceedings{hscc-14,
  author    = {Romain Brenguier and
               Franck Cassez and
               Jean-François Raskin},
  title     = {Energy and mean-payoff timed games},
  booktitle = {17th International Conference on Hybrid Systems: Computation
               and Control, HSCC'14},
  year      = {2014},
  pages     = {283-292},
  urlpaper = {papers/hscc-2014.pdf},
  url_link     = {http://doi.acm.org/10.1145/2562059.2562116},
  mywebpage = {timed},
  show = {},
  keywords = {hybrid, timed automata, games},
  abstract = {In this paper, we study energy and mean-payoff timed games.
  The decision problems that consist in determining the existence of winning strategies in those games are undecidable,
  and we thus provide semi-algorithms for solving these strategy synthesis problems.
  We then identify a large class of timed games for which our semi-algorithms terminate and are thus complete.
  We also study in detail the relation between mean-payoff and energy timed games. Finally,
  we provide a symbolic algorithm to solve energy timed games and demonstrate its use on small examples using HyTech.},
  Type = {B - International Conferences},

}





@article{DBLP:journals/corr/CassezMZ14,
  author    = {Franck Cassez and
               Ron van der Meyden and
               Chenyi Zhang},
  title     = {The Complexity of Synchronous Notions of Information Flow Security},
  journal   = {CoRR},
  Type = {E - Reports},
  volume    = {abs/1402.0601},
  year      = {2014},
  url       = {http://arxiv.org/abs/1402.0601},
  timestamp = {Wed, 05 Mar 2014 14:43:44 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/CassezMZ14},
  bibsource = {dblp computer science bibliography, http://dblp.org},
  keywords = {security, non-interference, complexity},
  show = {},
  category = {Non-interference},
  abstract = {The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one in which agents operate synchronously with awareness of the global clock. This enables timing based attacks to be captured, whereas previous work on this topic has dealt primarily with asynchronous systems. Versions of the notions of nondeducibility on inputs, nondeducibility on strategies, and an unwinding based notion are formulated for this model. All three notions are shown to be decidable, and their computational complexity is characterised.
  }
}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% 2013
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%





@inbook{cassez-control-iste-2013,
   author = {Franck Cassez and Markey, Nicolas},
   title = {Communicating Embedded Systems},
   editor = {Jard, Claude and Roux, Olivier H.},
   month = feb,
   pages = {67--105},
   publisher = {ISTE Ltd. -- John Wiley \&amp; Sons, Ltd},
   chapter = {Control of Timed Systems},
  url = {http://onlinelibrary.wiley.com/book/10.1002/9781118558188},
   year = {2013},
   note = {New edition, 2013},
   doi = {10.1002/9781118558188},
   isbn = {9781848211438},
   keywords = {control, timed automata},
  mywbepage = {timed},
abstract={In this book Chapter we address the problem of controller synthesis for timed systems. By
timed systems we refer to systems which are subject to quantitative (hard) real-time
constraints. We assume the reader is familiar with the basics of Timed Automata
theory, or has read Chapter 1 and Chapter 2 in this book. },
  Type = {C - Book Chapters},

}





@inbook{cassez-diag-iste-2013,
   author = {Franck Cassez and Tripakis, Stavros},
   title = {Communicating Embedded Systems},
   editor = {Jard, Claude and Roux, Olivier H.},
   month = feb,
   pages = {107--138},
   publisher = {ISTE Ltd. -- John Wiley \&amp; Sons, Ltd},
   chapter = {Fault Diagnosis of Timed Systems},
   keywords = {diagnosis, timed automata},
  mywbepage = {timed},
  url = {http://onlinelibrary.wiley.com/book/10.1002/9781118558188},
   year = {2013},
      note = {New edition, 2013},
    doi = {10.1002/9781118558188},
   isbn = {9781848211438},
abstract={In this book Chapter, we review the main results pertaining
                  to the problem of fault diagnosis of timed
                  automata. Timed automata are introduced in Chapter 1
                  and Chapter 2 in this book, and the reader not
                  familiar with this model is invited to read them
                  first.},
                    Type = {C - Book Chapters},

}





@inproceedings{cassez-formats-2013,
  author    = {Franck Cassez and
               Alban Grastien},
  title     = {Predictability of Event Occurrences in Timed Systems},
  booktitle = {Formal Modeling and Analysis of Timed Systems - 11th International
               Conference, {FORMATS} 2013, Buenos Aires, Argentina, August 29-31,
               2013. Proceedings},
  pages     = {62--76},
  year      = {2013},
  urlpaper = {papers/formats-2013.pdf},
  urlslides = {papers/slides-formats-2013.pdf},
   url_link       = {http://dx.doi.org/10.1007/978-3-642-40229-6_5},
  series    = {Lecture Notes in Computer Science},
  volume    = {8053},
  publisher = {Springer},
  doi       = {10.1007/978-3-642-40229-6_5},
  show = {},
  keywords = {predictability, diagnosis, timed automata},
  mywbepage = {timed},
  category = {Fault diagnosis},
  abstract = {
    We address the problem of predicting events' occurrences in partially observable timed systems modelled by timed automata. Our contribution is many-fold: 1) we give a definition of bounded predictability, namely k-predictability, that takes into account the minimum delay between the prediction and the actual event's occurrence; 2) we show that 0-predictability is equivalent to the original notion of predictability of S. Genc and S. Lafortune; 3) we provide a necessary and sufficient condition for k-predictability (which is very similar to k-diagnosability) and give a simple algorithm to check k-predictability; 4) we address the problem of predictability of events' occurrences in timed automata and show that the problem is PSPACE-complete.
  },
   Type = {B - International Conferences},

}





@inproceedings{scam-2013,
  author    = {Sebastian Biallas and
               Mads Chr. Olesen and
               Franck Cassez and
               Ralf Huuck},
  title     = {PtrTracker: Pragmatic pointer analysis},
  booktitle = {13th {IEEE} International Working Conference on Source Code Analysis
               and Manipulation, {SCAM} 2013, Eindhoven, Netherlands, September 22-23,
               2013},
  pages     = {69--73},
  year      = {2013},
  publisher = {{IEEE} Computer Society},
  urlpaper = {papers/scam-2013.pdf},
  url_link       = {http://dx.doi.org/10.1109/SCAM.2013.6648186},
  doi       = {10.1109/SCAM.2013.6648186},
  keywords = {Software verification, pointers, static analysis},
  mywebpage = {soft-verif},
  category = {Software verification},
  abstract = {
  Static program analysis for bug detection in industrial C/C++ code has many challenges. One of them is to analyze pointer and pointer structures efficiently. While there has been much research into various aspects of pointer analysis either for compiler optimization or for verification tasks, both classical categories are not optimized for bug detection, where speed and precision are important, but soundness (no missed bugs) and completeness (no false positives) do not necessarily need to be guaranteed.
  },
    Type = {B - International Conferences},
}





@article{DBLP:journals/corr/CassezG13,
  author    = {Franck Cassez and
               Alban Grastien},
  title     = {Predictability of Event Occurrences in Timed Systems},
  journal   = {CoRR},
  Type = {E - Reports},
  volume    = {abs/1306.0662},
  year      = {2013},
  url       = {http://arxiv.org/abs/1306.0662},
  timestamp = {Mon, 01 Jul 2013 20:31:24 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/CassezG13},
  bibsource = {dblp computer science bibliography, http://dblp.org},
  category = {Fault diagnosis},
  abstract = {
  We address the problem of predicting events' occurrences in partially observable timed systems modelled by timed automata. Our contribution is many-fold: 1) we give a definition of bounded predictability, namely k-predictability, that takes into account the minimum delay between the prediction and the actual event's occurrence; 2) we show that 0-predictability is equivalent to the original notion of predictability of S. Genc and S. Lafortune; 3) we provide a necessary and sufficient condition for k-predictability (which is very similar to k-diagnosability) and give a simple algorithm to check k-predictability; 4) we address the problem of predictability of events' occurrences in timed automata and show that the problem is PSPACE-complete.
  },
  mywebpage = {}
}





@article{tpn-13,
  author    = {Béatrice Bérard and
               Franck Cassez and
               Serge Haddad and
               Didier Lime and
               Olivier H. Roux},
  title     = {The expressive power of time {Petri} nets},
  journal   =  {Theoretical Computer Science},
  Type = {A - Journal},
  volume    = {474},
  year      = {2013},
  pages     = {1-20},
  doi        = {http://dx.doi.org/10.1016/j.tcs.2012.12.005},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  category= {Timed Petri nets},
  mywebpage = {timed},
  keywords = {time petri nets, timed automata},
  urlpaper = {papers/tcs-2013.pdf},
  abstract = {We investigate expressiveness questions for time Petri nets (TPNs)
  and some of their most useful extensions. We first introduce generalised time Petri nets (GTPNs)
  as an abstract model that encompasses variants of TPNs such as self modifications and read, reset and inhibitor arcs.
We give a syntactical translation from bounded GTPNs to timed automata (TA)
that generates isomorphic transition systems. We prove that the class of bounded GTPNs is strictly l
ess expressive than TA w.r.t. weak timed bisimilarity.
We prove that bounded GTPNs, bounded TPNs and TA are equally expressive w.r.t. timed language acceptance.
Finally, we characterise a syntactical subclass of TA that is equally expressive to bounded GTPNs "á la Merlin" w.r.t.
weak timed bisimilarity. These results provide a unified comparison of the expressiveness of
many variants of timed models often used in practice. It leads to new important results for TPNs.
Among them are: 1-safe TPNs and bounded-TPNs are equally expressive; $\epsilon$-transitions strictly
increase the expressive power of TPNs; self modifying nets as well as read,
inhibitor and reset arcs do not add expressiveness to bounded TPNs.
}
}






@inproceedings{cassez-acsd-13,
  author    = {Franck Cassez and
               {Jean-Luc} Béchennec},
  title     = {Timing Analysis of Binary Programs with {UPPAAL}},
  booktitle = {13th International Conference on Application of Concurrency
               to System Design, ACSD 2013},
  year      = {2013},
  month = jul,
  pages     = {41-50},
    PUBLISHER = {IEEE Computer Society},
  urlpaper = {papers/acsd-2013.pdf},
  urlslides = {papers/slides-acsd-wcet-2013.pdf},
  doi       = {http://dx.doi.org/10.1109/ACSD.2013.7},
  mywebpage = {wcet},
  show = {},
  keywords = {wcet, timed automata},
  abstract = {
  We address the problem of computing accurate Worst-Case Execution Time (WCET). We propose a fully automatic and modular methodology based on program slicing and real-time model-checking. We have implemented our methodology and applied it to standard benchmarks. To further validate the approach, we also compare our results to the real execution times of the programs measured on a real board.
  },
      Type = {B - International Conferences},

}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% 2012
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%





@proceedings{ssv-12,
  editor    = {Franck Cassez and
               Ralf Huuck and
               Gerwin Klein and
               Bastian Schlich},
  title     = {Proceedings Seventh Conference on Systems Software Verification, {SSV}
               2012, Sydney, Australia, 28-30 November 2012},
  series    = {{EPTCS}},
  volume    = {102},
  year      = {2012},
  url       = {http://dx.doi.org/10.4204/EPTCS.102},
  doi       = {10.4204/EPTCS.102},
  category= {Proceedings (Editor)},
  mywebpage = {},
  show = {},
  keywords = {Proceedings},
      Type = {D - Conference Proceedings},
}





@inproceedings{wcet-12,
  author    = {Franck Cassez and
               René Rydhof Hansen and
               Mads Chr. Olesen},
  title     = {What is a Timing Anomaly?},
  booktitle = {12th International Workshop on Worst-Case Execution Time
               Analysis, WCET 2012, July 10, 2012, Pisa, Italy},
  year      = {2012},
  pages     = {1-12},
  urlpaper = {papers/wcet-2012.pdf},
  url_link        = {http://dx.doi.org/10.4230/OASIcs.WCET.2012.1},
  abstract = {Timing anomalies make worst-case execution time analysis much harder, because the analysis will have to consider all local choices. It has been widely recognised that certain hardware features are timing anomalous, while others are not. However, defining formally what a timing anomaly is, has been difficult. We examine previous definitions of timing anomalies, and identify examples where they do not align with common observations. We then provide a definition for consistently slower hardware traces that can be used to define timing anomalies and aligns with common observations.},
  category= {wcet},
  mywebpage = {soft-verif,wcet},
  keywords = {wcet},
   publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  series    = {OASICS},
  volume    = {23},
        Type = {B - International Conferences},

}






@inproceedings{atva-12,
  author    = {Peter E. Bulychev and
               Franck Cassez and
               Alexandre David and
               Kim Guldstrand Larsen and
               Jean-François Raskin and
               Pierre-Alain Reynier},
  title     = {Controllers with Minimal Observation Power (Application
               to Timed Systems)},
  booktitle = {Automated Technology for Verification and Analysis - 10th
               International Symposium, ATVA 2012},
  year      = {2012},
  pages     = {223-237},
  urlpaper = {papers/atva-2012.pdf},
  url_link  = {http://dx.doi.org/10.1007/978-3-642-33386-6_19},
  mywebpage = {timed},
  keywords = {timed automata, timed games, control},
  abstract = {
  We consider the problem of controller synthesis under imperfect information in a setting where there is a set of available observable predicates equipped with a cost function. The problem that we address is the computation of a subset of predicates sufficient for control and whose cost is minimal. Our solution avoids a full exploration of all possible subsets of predicates and reuses some information between different iterations. We apply our approach to timed systems. We have developed a tool prototype and analyze the performance of our optimization algorithm on two case studies.
  },
        Type = {B - International Conferences},

}





@article{bulychev-2012,
  author    = {Peter E. Bulychev and
               Franck Cassez and
               Alexandre David and
               Kim G. Larsen and
               Jean{-}Fran{\c{c}}ois Raskin and
               Pierre{-}Alain Reynier},
  title     = {Controllers with Minimal Observation Power (Application to Timed Systems)},
  journal   = {CoRR},
  Type = {E - Reports},
  volume    = {abs/1207.1276},
  year      = {2012},
  urlpaper       = {http://arxiv.org/abs/1207.1276},
  timestamp = {Wed, 10 Oct 2012 21:28:54 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1207-1276},
  bibsource = {dblp computer science bibliography, http://dblp.org},
  abstract = {
  We consider the problem of controller synthesis under imperfect information in a setting where there is a set of available observable predicates equipped with a cost function. The problem that we address is the computation of a subset of predicates sufficient for control and whose cost is minimal. Our solution avoids a full exploration of all possible subsets of predicates and reuses some information between different iterations. We apply our approach to timed systems. We have developed a tool prototype and analyze the performance of our optimization algorithm on two case studies.
  },
   mywebpage = {timed},
  keywords = {timed automata, timed games, control},

}





@article{tac-12,
  author    = {Franck Cassez},
  title     = {The Complexity of Codiagnosability for Discrete Event and
               Timed Systems},
  journal   = {IEEE Trans. Automat. Contr.},
  volume    = {57},
  number    = {7},
  year      = {2012},
  type = {A - Journal},
  pages     = {1752-1764},
  urlpaper = {papers/tac-2012.pdf},
  url_link       = {http://dx.doi.org/10.1109/TAC.2012.2183169},
  doi = {http://dx.doi.org/10.1109/TAC.2012.2183169},
  mywebpage = {timed},
  keywords = {timed automata, Fault diagnosis, Complexity},
  abstract = {
  In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform characterisation of codiagnosability for FA and TA which extends the necessary and sufficient condition that characterises diagosability. We also settle the complexity of the codiagnosability problems both for FA and TA and show that codiagnosability is PSPACE-complete in both cases. For FA this improves on the previously known bound (EXPTIME) and for TA it is a new result. We then generalise the previous results to the case of dynamic observers. Finally we show that the codiagnosis problem for TA under bounded resources is 2EXPTIME-complete.
  }
}





@article{fmsd-12,
  author    = {Franck Cassez and
               Jérémy Dubreil and
               Hervé Marchand},
  title     = {Synthesis of opaque systems with static and dynamic masks},
  journal   = {Formal Methods in System Design},
  volume    = {40},
  number    = {1},
  year      = {2012},
  pages     = {88-115},
    type = {A - Journal},

  urlpaper = {papers/fmsd-2012.pdf},
  ee        = {http://dx.doi.org/10.1007/s10703-012-0141-9},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  mywebpage = {},
  keywords = {security, opacity, diagnosis},
  abstract = {
Opacity is a security property formalizing the absence of secret information leakage and we address in this paper the problem of synthesizing opaque systems. A secret predicate S over the runs of a system G is opaque to an external user having partial observ- ability over G, if s/he can never infer from the observation of a run of G that the run belongs to S. We choose to control the observability of events by adding a device, called a mask, between the system G and the users. We first investigate the case of static partial observability where the set of events the user can observe is fixed a priori by a static mask. In this context, we show that checking whether a system is opaque is PSPACE-complete, which implies that computing an optimal static mask ensuring opacity is also a PSPACE-complete problem. Next, we introduce dynamic partial observability where the set of events the user can observe changes over time and is chosen by a dynamic mask. We show how to check that a system is opaque w.r.t. to a dynamic mask and also address the corresponding synthesis problem: given a system G and secret states S, compute the set of dynamic masks under which S is opaque. Our main result is that the set of such masks can be finitely represented and can be computed in EXPTIME and this is a lower bound. Finally we also address the problem of computing an optimal mask.

  },
}





@article{tapas-12,
  author    = {Mark Bradley and
               Franck Cassez and
               Ansgar Fehnker and
               Thomas Given-Wilson and
               Ralf Huuck},
  title     = {High Performance Static Analysis for Industry},
  journal   = {Electr. Notes Theor. Comput. Sci.},
  volume    = {289},
  year      = {2012},
  pages     = {3-14},
  urlpaper = {papers/tapas-2012.pdf},
  ee        = {http://dx.doi.org/10.1016/j.entcs.2012.11.002},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  mywebpage = {soft-verif},
  keywords = {software verification},
  abstract = {
  Static source code analysis for software bug detection has come a long way since its early beginnings as a compiler technology. However, with the introduction of more sophisticated algorithmic techniques, such as model checking and constraint solving, questions about performance are a major concern. In this work we present an empirical study of our industrial strength source code analysis tool Goanna that uses a model checking core for static analysis of C/C++ code. We present the core technology and abstraction mechanism with a focus on performance, as guided by experience from having analyzed millions of lines of code. In particular, we present results from our recent study within the NIST/DHS SAMATE program. The results show that, maybe surprisingly, formal verification techniques can be used successfully in practical industry applications scaling roughly linearly, even for millions of lines of code.
  },
        Type = {B - International Conferences},

}





@article{benattar-2012,
  author    = {Gilles Benattar and
               Franck Cassez and
               Didier Lime and
               Olivier H. Roux},
  title     = {Control and Synthesis of Non-Interferent Timed Systems},
  journal   = {CoRR},
  Type = {E - Reports},
  volume    = {abs/1207.4984},
  year      = {2012},
  url       = {http://arxiv.org/abs/1207.4984},
  timestamp = {Wed, 10 Oct 2012 21:28:54 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1207-4984},
  bibsource = {dblp computer science bibliography, http://dblp.org},
  keywords = {sceurity, non-interference},
  abstract = {
In this paper, we focus on the synthesis of secure timed systems which are modelled as timed automata. The security property that the system must satisfy is a non-interference property. Intuitively, non-interference ensures the absence of any causal dependency from a high-level domain to a lower-level domain. Various notions of non-interference have been defined in the literature, and in this paper we focus on Strong Non-deterministic Non-Interference (SNNI) and two (bi)simulation based variants thereof (CSNNI and BSNNI). We consider timed non-interference properties for timed systems specified by timed automata and we study the two following problems: (1) check whether it is possible to find a sub-system so that it is non-interferent; if yes (2) compute a (largest) sub-system which is non-interferent.
  }
}


%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% 2011
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%





@inproceedings{cassez-acsd-2011,
  author    = {Franck Cassez},
  title     = {Timed Games for Computing {WCET} for Pipelined Processors with Caches},
  booktitle = {11th International Conference on Application of Concurrency to System
               Design, {ACSD} 2011, Newcastle Upon Tyne, UK, 20-24 June, 2011},
  pages     = {195--204},
  year      = {2011},
  publisher = {{IEEE}},
  url       = {http://doi.ieeecomputersociety.org/10.1109/ACSD.2011.15},
  doi       = {10.1109/ACSD.2011.15},
  timestamp = {Wed, 15 Feb 2012 09:59:43 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/acsd/Cassez11},
  bibsource = {dblp computer science bibliography, http://dblp.org},
   urlpaper = {papers/acsd-2011.pdf},
  urlslides = {papers/slides-acsd-2011.pdf},
  ABSTRACT = {In this paper we introduce a framework for computing upper bounds yet
accurate WCET for hardware platforms with caches and pipelines. The methodology
we propose consists of 3 steps: 1) given a program to analyse, compute an
equivalent (WCET-wise) abstract program; 2) build a timed game by composing
this abstract program with a network of timed automata modeling the
architecture; and 3) compute the WCET as the optimal time to reach a winning
state in this game. We demonstrate the applicability of our framework on
standard benchmarks for an ARM9 processor with instruction and data caches, and
compute the WCET with UPPAAL-TiGA. We also show that this framework can easily
be extended to take into account dynamic changes in the speed of the processor
during program execution.
},
ee       = {http://dx.doi.org/10.1109/ACSD.2011.15},
  keywords = {wcet, timed automata},
  category = {wcet},
  show = {},
  category= {wcet},
  mywebpage = {wcet},
        Type = {B - International Conferences},

}






@article{bech-wcet-2011,
  author    = {Jean{-}Luc B{\'{e}}chennec and
               Franck Cassez},
  title     = {Computation of {WCET} using Program Slicing and Real-Time Model-Checking},
  journal   = {CoRR},
  Type = {E - Reports},
  volume    = {abs/1105.1633},
  year      = {2011},
  urlpaper       = {http://arxiv.org/abs/1105.1633},
  timestamp = {Mon, 05 Dec 2011 18:05:32 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1105-1633},
  bibsource = {dblp computer science bibliography, http://dblp.org},
  ABSTRACT = { Computing accurate WCET on modern complex architectures is a challenging task. This problem has been devoted a lot of attention in the last decade but there are still some open issues. First, the control flow graph (CFG) of a binary program is needed to compute the WCET and this CFG is built using some internal knowledge of the compiler that generated the binary code; moreover once constructed the CFG has to be manually annotated with loop bounds. Second, the algorithms to compute the WCET (combining Abstract Interpretation and Integer Linear Programming) are tailored for specific architectures: changing the architecture (e.g. replacing an ARM7 by an ARM9) requires the design of a new ad hoc algorithm. Third, the tightness of the computed results (obtained using the available tools) are not compared to actual execution times measured on the real hardware. In this paper we address the above mentioned problems. We first describe a fully automatic method to compute a CFG based solely on the binary program to analyse. Second, we describe the model of the hardware as a product of timed automata, and this model is independent from the program description. The model of a program running on a hardware is obtained by synchronizing (the automaton of) the program with the (timed automata) model of the hardware. Computing the WCET is reduced to a reachability problem on the synchronised model and solved using the model-checker UPPAAL. Finally, we present a rigorous methodology that enables us to compare our computed results to actual execution times measured on a real platform, the ARM920T.},
    category= {wcet},
  keywords = {wcet, timed automata},
  show = {},
  mywebpage = {wcet}
}





@article{bouyer-jlli-2011,
  author    = {Patricia Bouyer and
               Franck Cassez and
               Fran{\c{c}}ois Laroussinie},
  title     = {Timed Modal Logics for Real-Time Systems - Specification, Verification
               and Control},
  journal   = {Journal of Logic, Language and Information},
  volume    = {20},
  number    = {2},
  pages     = {169--203},
  year      = {2011},
  Type = {A - Journal},
  url       = {http://dx.doi.org/10.1007/s10849-010-9127-4},
  doi       = {10.1007/s10849-010-9127-4},
  timestamp = {Tue, 12 Apr 2011 09:14:59 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/jolli/BouyerCL11},
  bibsource = {dblp computer science bibliography, http://dblp.org},
  urlpaper = {papers/jlli-2011.pdf},
  category= {games},
  mywebpage = {timed},
  show = {},
  keywords = {logics, real-time, timed automata, timed games},
  abstract = {
  In this paper, a timed modal logic Lc is presented for the specification
and verification of real-time systems. Several important results for Lc are discussed.
First we address the model checking problem and we show that it is an EXPTIME-complete problem.
Secondly we consider expressiveness and we explain how to
express strong timed bisimilarity and how to build characteristic formulas for timed
automata. We also propose a compositional algorithm for Lc model checking. Finally
we consider several control problems for which Lc can be used to check controllability.
  }
}


%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% 2010
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%





@inproceedings{DBLP:conf/atva/Cassez10,
  author    = {Franck Cassez},
  title     = {The Complexity of Codiagnosability for Discrete Event and Timed Systems (Extended abstract)},
  booktitle = {Automated Technology for Verification and Analysis - 8th International
               Symposium, {ATVA} 2010, Singapore, September 21-24, 2010. Proceedings},
  pages     = {82--96},
  year      = {2010},
  editor    = {Ahmed Bouajjani and
               Wei{-}Ngan Chin},
  urlpaper = {papers/atva-10.pdf},
  xxee = {http://arxiv.org/abs/1004.2550},
  xxurl       = {http://dx.doi.org/10.1007/978-3-642-15643-4_8},
  doi       = {10.1007/978-3-642-15643-4_8},
 series    = {Lecture Notes in Computer Science},
  volume    = {6252},
   mywebpage = {diagnosis},
  show = {},
  publisher = {Springer},
  keywords = {diagnosis, complexity, timed automata},
  abstract = {In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform characterization of codiagnosability for FA and TA which extends the necessary and sufficient condition that characterizes diagnosability. We also settle the complexity of the codiagnosability problems both for FA and TA and show that codiagnosability is PSPACE-complete in both cases. For FA this improves on the previously known bound (EXPTIME) and for TA it is a new result. Finally we address the codiagnosis problem for TA under bounded resources and show it is 2EXPTIME-complete.},
        Type = {B - International Conferences},

  }





@INPROCEEDINGS{cassez-cdc-2010,
  AUTHOR = {Franck Cassez},
  TITLE = {{Dynamic Observers for Fault Diagnosis of Timed Systems}},
  BOOKTITLE = {49th IEEE Conference on Decision and Control and 28th Chinese Control Conference},
  YEAR = {2010},
  ADDRESS = {Atlanta},
  MONTH = DEC,
  PUBLISHER = {IEEE Computer Society},
  urlpaper = {papers/cdc-2010.pdf},
  url_link = {http://arxiv.org/abs/1004.2764},
  ABSTRACT = { In this paper we extend the work on dynamic observers for
fault diagnosis  to timed automata. We
study sensor minimization problems with static observers and
then address the problem of computing the most permissive
dynamic observer for a system given by a timed automaton. },
  mywebpage = {diagnosis},
  show = {},
  keywords = {diagnosis, timed automata},
        Type = {B - International Conferences},

}





@inproceedings{cassez-fossacs-2010,
  author    = {Franck Cassez and
               Ron van der Meyden and
               Chenyi Zhang},
               editor    = {C.{-}H. Luke Ong},
  title     = {The Complexity of Synchronous Notions of Information Flow Security},
  booktitle = {Foundations of Software Science and Computational Structures, 13th
               International Conference, {FOSSACS} 2010, Held as Part of the Joint
               European Conferences on Theory and Practice of Software, {ETAPS} 2010,
               Paphos, Cyprus, March 20-28, 2010. Proceedings},
  pages     = {282--296},
  year      = {2010},
  volume    = {6014},
  urlpaper = {papers/fossacs-2010.pdf},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  doi       = {10.1007/978-3-642-12032-9_20},
      keywords = {security, interference},
      Type = {B - International Conferences},

  abstract = {The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one in which agents operate synchronously with awareness of the global clock. This enables timing based attacks to be captured, whereas previous work on this topic has dealt primarily with asynchronous systems. Versions of the notions of nondeducibility on inputs, nondeducibility on strategies, and an unwinding based notion are formulated for this model. All three notions are shown to be decidable, and their computational complexity is characterised.}
}





@article{DBLP:journals/corr/abs-1004-2550,
  author    = {Franck Cassez},
  title     = {The Complexity of Codiagnosability for Discrete Event and Timed Systems},
  journal   = {CoRR},
  Type = {E - Reports},
  volume    = {abs/1004.2550},
  year      = {2010},
  url       = {http://arxiv.org/abs/1004.2550},
  timestamp = {Mon, 05 Dec 2011 18:05:32 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1004-2550},
  bibsource = {dblp computer science bibliography, http://dblp.org},
      keywords = {fault diagnosis, timed automata},

  abstract = {In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform characterization of codiagnosability for FA and TA which extends the necessary and sufficient condition that characterizes diagnosability. We also settle the complexity of the codiagnosability problems both for FA and TA and show that codiagnosability is PSPACE-complete in both cases. For FA this improves on the previously known bound (EXPTIME) and for TA it is a new result. Finally we address the codiagnosis problem for TA under bounded resources and show it is 2EXPTIME-complete.}
}





@article{DBLP:journals/corr/abs-1004-2764,
  author    = {Franck Cassez},
  title     = {A Note on Fault Diagnosis Algorithms},
  journal   = {CoRR},
  Type = {E - Reports},
  volume    = {abs/1004.2764},
  year      = {2010},
  url       = {http://arxiv.org/abs/1004.2764},
  timestamp = {Mon, 05 Dec 2011 18:04:58 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1004-2764},
  bibsource = {dblp computer science bibliography, http://dblp.org},
      keywords = {fault diagnosis, timed automata},

  abstract = {In this paper we review algorithms for checking diagnosability of discrete-event systems and timed automata. We point out that the diagnosability problems in both cases reduce to the emptiness problem for (timed) B\"uchi automata. Moreover, it is known that, checking whether a discrete-event system is diagnosable, can also be reduced to checking bounded diagnosability. We establish a similar result for timed automata. We also provide a synthesis of the complexity results for the different fault diagnosis problems.}
}





@article{DBLP:journals/corr/abs-1004-2810,
  author    = {Franck Cassez and
               Stavros Tripakis},
  title     = {Fault Diagnosis with Dynamic Observers},
  journal   = {CoRR},
  Type = {E - Reports},
  volume    = {abs/1004.2810},
  year      = {2010},
  url       = {http://arxiv.org/abs/1004.2810},
  timestamp = {Mon, 05 Dec 2011 18:05:22 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1004-2810},
  bibsource = {dblp computer science bibliography, http://dblp.org},
    keywords = {fault diagnosis, timed automata},

  abstract = {In this paper, we review some recent results about the use of dynamic observers for fault diagnosis of discrete event systems. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in the plant as soon as possible after their occurrence. Existing literature on this problem has considered the case of fixed static observers, where the set of observable events is fixed and does not change during execution of the system. In this paper, we consider dynamic observers: an observer can "switch" sensors on or off, thus dynamically changing the set of events it wishes to observe. It is known that checking diagnosability (i.e., whether a given observer is capable of identifying faults) can be solved in polynomial time for static observers, and we show that the same is true for dynamic ones. We also solve the problem of dynamic observers' synthesis and prove that a most permissive observer can be computed in doubly exponential time, using a game-theoretic approach. We further investigate optimization problems for dynamic observers and define a notion of cost of an observer.}
}





@article{DBLP:journals/corr/abs-1006-1951,
  author    = {Franck Cassez},
  title     = {Timed Games for Computing Worst-Case Execution-Times},
  journal   = {CoRR},
  Type = {E - Reports},
  volume    = {abs/1006.1951},
  year      = {2010},
  url       = {http://arxiv.org/abs/1006.1951},
  timestamp = {Mon, 05 Dec 2011 18:04:54 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1006-1951},
  bibsource = {dblp computer science bibliography, http://dblp.org},
    keywords = {wcet, timed automata},

  abstract= {In this paper we introduce a framework for computing upper bounds yet accurate WCET for hardware platforms with caches and pipelines. The methodology we propose consists of 3 steps: 1) given a program to analyse, compute an equivalent (WCET-wise) abstract program; 2) build a timed game by composing this abstract program with a network of timed automata modeling the architecture; and 3) compute the WCET as the optimal time to reach a winning state in this game. We demonstrate the applicability of our framework on standard benchmarks for an ARM9 processor with instruction and data caches, and compute the WCET with UPPAAL-TiGA. We also show that this framework can easily be extended to take into account dynamic changes in the speed of the processor during program execution.}
}


%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% 2009
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%





@inproceedings{DBLP:conf/atva/CassezDM09,
  author    = {Franck Cassez and
               J{\'{e}}r{\'{e}}my Dubreil and
               Herv{\'{e}} Marchand},
                 editor    = {Zhiming Liu and
               Anders P. Ravn},
  title     = {Dynamic Observers for the Synthesis of Opaque Systems},
  booktitle = {Automated Technology for Verification and Analysis, 7th International
               Symposium, {ATVA} 2009, Macao, China, October 14-16, 2009. Proceedings},
  pages     = {352--367},
  year      = {2009},
    series    = {Lecture Notes in Computer Science},
  volume    = {5799},
  publisher = {Springer},
  url       = {http://dx.doi.org/10.1007/978-3-642-04761-9_26},
  doi       = {10.1007/978-3-642-04761-9_26},
    urlpaper = {papers/atva-09.pdf},
  urlslides = {papers/slides-atva-09.pdf},
        Type = {B - International Conferences},

  ABSTRACT = {   In this paper, we address the problem of synthesizing \emph{opaque}
  systems by selecting the set of observable
  events.
  We first investigate the case of \emph{static}  observability
  where the set of observable events
  is fixed a priori.  In this context, we show that checking whether a
  system is opaque and computing an optimal static observer ensuring
  opacity are both PSPACE-complete problems.
  Next, we introduce \emph{dynamic} partial observability where the
  set of observable events
  can
  change over time.
  We show how to check that a system is opaque \wrt a dynamic observer
  and also address the corresponding synthesis problem: given a system
  $G$ and secret states $S$, compute the set of dynamic observers
  under which $S$ is opaque. Our main result is that the synthesis
  problem can be solved in EXPTIME.},
}






@inproceedings{DBLP:conf/cdc/Cassez09,
  author    = {Franck Cassez},
  title     = {A note on fault diagnosis algorithms},
  booktitle = {Proceedings of the 48th {IEEE} Conference on Decision and Control,
               {CDC} 2009, combined withe the 28th Chinese Control Conference, December
               16-18, 2009, Shanghai, China},
  editor    = {Jo{\"{e}}l Ouaknine and
               Frits W. Vaandrager},
  pages     = {6941--6946},
  year      = {2009},
   publisher = {{IEEE}},
  year      = {2009},
  url       = {http://dx.doi.org/10.1109/CDC.2009.5399968},
  doi       = {10.1109/CDC.2009.5399968},
  ABSTRACT = {   In this paper we review algorithms for checking diagnosability of
  discrete-event systems and timed automata. We point out that the
  diagnosability problems in both cases reduce to the emptiness
  problem for (timed) B\"uchi automata. Moreover, it is known that,
  checking whether a discrete-event system is diagnosable, can also be
  reduced to checking bounded diagnosability. We establish a similar
  result for timed automata.  We also provide a synthesis of the
  complexity results for the different fault diagnosis problems.},
  urlpaper = {papers/cdc-09.pdf},
  urlslides = {papers/slides-cdc-09.pdf},
        Type = {B - International Conferences},

  keywords = {diagnosis, timed automata},
}





@inproceedings{DBLP:conf/formats/BenattarCLR09,
  author    = {Gilles Benattar and
               Franck Cassez and
               Didier Lime and
               Olivier H. Roux},
  title     = {Synthesis of Non-Interferent Timed Systems},
  booktitle = {Formal Modeling and Analysis of Timed Systems, 7th International Conference,
               {FORMATS} 2009, Budapest, Hungary, September 14-16, 2009. Proceedings},
  pages     = {28--42},
  year      = {2009},
  series    = {Lecture Notes in Computer Science},
  volume    = {5813},
  publisher = {Springer},
  url       = {http://dx.doi.org/10.1007/978-3-642-04368-0_5},
  doi       = {10.1007/978-3-642-04368-0_5},
  urlpaper = {papers/formats-09.pdf},
  urlslides = {papers/slides-formats-09.pdf},
   ABSTRACT = {  In this paper, we focus on the synthesis of secure timed systems
  which are given by timed automata.
  The security property that the system must satisfy is a
  \emph{non-interference} property.
  Various notions of non-interference have been defined in the
  literature, and in this paper we focus on \emph{Strong
    Non-deterministic Non-Interference} (SNNI)
  and we study the two following problems: ($1$) check whether it is
  possible to enforce a system to be SNNI; if yes ($2$) compute a
  sub-system which is SNNI.},
        Type = {B - International Conferences},

  keywords = {security, timed automata}
}





@inproceedings{DBLP:conf/hybrid/CassezJLRR09,
  author    = {Franck Cassez and
               Jan Jakob Jessen and
               Kim Guldstrand Larsen and
               Jean{-}Fran{\c{c}}ois Raskin and
               Pierre{-}Alain Reynier},
  editor    = {Rupak Majumdar and
               Paulo Tabuada},
  title     = {Automatic Synthesis of Robust and Optimal Controllers - An Industrial
               Case Study},
  booktitle = {Hybrid Systems: Computation and Control, 12th International Conference,
               {HSCC} 2009, San Francisco, CA, USA, April 13-15, 2009. Proceedings},
  pages     = {90--104},
  year      = {2009},
  crossref  = {DBLP:conf/hybrid/2009},
  url       = {http://dx.doi.org/10.1007/978-3-642-00602-9_7},
  series    = {Lecture Notes in Computer Science},
  volume    = {5469},
  publisher = {Springer},
  doi       = {10.1007/978-3-642-00602-9_7},
  urlpaper = {papers/hscc-09.pdf},
  keywords = {control, synthesis, hybrid automata},
        Type = {B - International Conferences},

  abstract = { Int his paper,we show how to apply recent tools for the automatic synthesis of robust and near-optimal controllers for a real industrial case study. We show how to use three different classes of models and their supporting existing tools, UPPAAL-TIGA for synthesis, PHAVER for verification, and SIMULINK for simulation, in a complementary way. We believe that this case study shows that our tools have reached a level of maturity that allows us to tackle interesting and relevant industrial control problems.}
 }






@inproceedings{DBLP:conf/sersc-isa/Cassez09,
  author    = {Franck Cassez},
  title     = {The Dark Side of Timed Opacity},
  editor    = {Jong Hyuk Park and
               Hsiao{-}Hwa Chen and
               Mohammed Atiquzzaman and
               Changhoon Lee and
               Tai{-}Hoon Kim and
               Sang{-}Soo Yeo},
  booktitle = {Advances in Information Security and Assurance, Third International
               Conference and Workshops, {ISA} 2009, Seoul, Korea, June 25-27, 2009.
               Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {5576},
  publisher = {Springer},
  pages     = {21--30},
  year      = {2009},
  crossref  = {DBLP:conf/sersc-isa/2009},
  urlpaper       = {papers/isa-09.pdf},
  urlslides = {papers/slides-isa-09.pdf},
        Type = {B - International Conferences},

  doi       = {10.1007/978-3-642-02617-1_3},
}





@inbook{cassez-control-iste-2009,
   author = {Franck Cassez and Markey, Nicolas},
   title = {Communicating Embedded Systems},
   editor = {Jard, Claude and Roux, Olivier H.},
   month = oct,
   pages = {83--120},
   publisher = {ISTE Ltd. -- John Wiley \&amp; Sons, Ltd},
   chapter = {Control of Timed Systems},
  xxurl = {http://www.iste.co.uk/index.php?ACTION=Browse&amp;CatParent=FUB2},
   year = {2009},
  urlpaper = {papers/iste-wiley-book-control.pdf},
abstract={In this book Chapter we address the problem of controller synthesis for timed systems. By
timed systems we refer to systems which are subject to quantitative (hard) real-time
constraints. We assume the reader is familiar with the basics of Timed Automata
theory, or has read Chapter 1 and Chapter 2 in this book. },
XXnote={Draft version may differ from published one.},
      Type = {C - Book Chapters},

}





@inbook{cassez-diag-iste-2009,
   author = {Franck Cassez and Tripakis, Stavros},
   title = {Communicating Embedded Systems},
   editor = {Jard, Claude and Roux, Olivier H.},
   month = oct,
   pages = {120--151},
   publisher = {ISTE Ltd. -- John Wiley \&amp; Sons, Ltd},
   chapter = {Fault Diagnosis of Timed Systems},
  xxurl = {http://www.iste.co.uk/index.php?ACTION=Browse&amp;CatParent=FUB2},
   year = {2009},
      Type = {C - Book Chapters},

  urlpaper = {papers/iste-wiley-book-diag.pdf},
abstract={In this book Chapter, we review the main results pertaining
                  to the problem of fault diagnosis of timed
                  automata. Timed automata are introduced in Chapter 1
                  and Chapter 2 in this book, and the reader not
                  familiar with this model is invited to read them
                  first.},
XXnote={Draft version  may differ from published one.}
}





@MISC{cassez-compile-phaver-09,
  AUTHOR = {Franck Cassez},
 HOWPUBLISHED = {Short Note, NICTA, Sydney, Australia},
  KEYWORDS = {PHAVer, OS X},
  TITLE = {{How to Install PHAVer on Mac OS X}},
  urlpaper = {papers/install-phaver-09.pdf},
  YEAR = {2009},
URL_link={http://www-verimag.imag.fr/~frehse/phaver_web/index.html},
abstract={This short note explains how to install PHAVer (and the
                  needed libraries) for a single user on Mac OS X
                  running Leopard (10.5.6). It might also work for
                  earlier versions (you can report to me in case of a
                  successful install on earlier version).},
 Type = {E - Reports},
}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% 2008
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%





@proceedings{cassez-formats-2008,
  editor    = {Franck Cassez and
               Claude Jard},
  title     = {Formal Modeling and Analysis of Timed Systems, 6th International Conference,
               {FORMATS} 2008, Saint Malo, France, September 15-17, 2008. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {5215},
  publisher = springv,
  year      = {2008},
  isbn      = {978-3-540-85777-8},
          Type = {D - Conference Proceedings},

  timestamp = {Fri, 05 Sep 2008 08:05:45 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/formats/2008},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}






@article{cassez-fi-08,
  AUTHOR = {Franck Cassez and Tripakis, Stavros},
  TITLE = {Fault Diagnosis with Static and Dynamic Diagnosers},
  JOURNAL = {Fundamenta Informaticae},
  YEAR = {2008},
    Type = {A - Journal},

  VOLUME = {88},
  NUMBER = {4},
  PAGES = {497--540},
  keywords = {fault diagnosis, automata},
  MONTH = NOV,
  ABSTRACT = {We study sensor minimization problems in the context of
                  fault diagnosis. Fault diagnosis consists in
                  synthesizing a diagnoser that observes a given plant
                  and identifies faults in the plant as soon as
                  possible after their occurrence. Existing literature
                  on this problem has considered the case of fixed
                  static observers, where the set of observable events
                  is fixed and does not change during execution of the
                  system. In this paper, we consider static observers
                  where the set of observable events is not fixed, but
                  needs to be optimized (e.g., minimized in size). We
                  also consider dynamic observers, where the observer
                  can ``switc'' sensors on or off, thus dynamically
                  changing the set of events it wishes to observe. It
                  is known that checking diagnosability (i.e., whether
                  a given observer is capable of identifying faults)
                  can be solved in polynomial time for static
                  observers, and we show that the same is true for
                  dynamic ones. On the other hand, minimizing the
                  number of (static) observable events required to
                  achieve diagnosability is NP-complete. We show that
                  this is true also in the case of mask-based
                  observation, where some events are observable but
                  not distinguishable. For dynamic observers'
                  synthesis, we prove that a most permissive
                  finite-state observer can be computed in doubly
                  exponential time, using a game-theoretic
                  approach. We further investigate optimization
                  problems for dynamic observers and define a notion of
                  cost of an observer. We show how to compute an
                  optimal observer using results on mean-payoff games
                  by Zwick and Paterson.  },
  urlpaper = {papers/diag-fi-08.pdf},
}





@article{BCHLR08-tcs,
  AUTHOR = {B{\'e}rard, B{\'e}atrice and Franck Cassez and Haddad, Serge and Lime, Didier and Roux, Olivier H.},
  JOURNAL = {Theoretical Computer Science},
  PUBLISHER = {Elsevier},
  VOLUME = 403,
  NUMBER = {2--3},
  PAGES = {202--220},
    Type = {A - Journal},

  TITLE = {When are Timed Automata Weakly Timed Bisimilar to Time {P}etri Nets?},
  YEAR = {2008},
  urlpaper = {papers/tcs-2008.pdf},
  abstract = {In this paper, we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly included in the class of TA. It is thus natural to try and identify the subclass of TA equivalent to some TPN for the weak timed bisimulation relation. We give a characterization of this subclass and we show that the membership problem and the reachability problem  are PSPACE-complete. Furthermore we show that for a TA in this class with integer constants, an equivalent TPN can be built with integer bounds but with a size exponential w.r.t. the original model. Surprisingly, using rational bounds yields a TPN whose size is linear.}
}






@INBOOK{ars-petri-nets,
  AUTHOR = {Cassez, Franck and Roux, Olivier H.},
  EDITOR = {Kordic, Vedran},
  TITLE = {Petri Nets -- Theory and Applications},
  CHAPTER = {From Time Petri Nets to Timed Automata},
  PUBLISHER = ARS-VIENNA,
  YEAR = {2008},
  SERIES = {{I}-Tech {E}ducation {O}nline},
 URL= {http://intechweb.org/books.php},
  PAGES = {225--252},
  PDF = {papers/tpn-book-08.pdf},
  ISBN = {ISBN 978-3-902613-12-7},
NOTE={Free download from \url{http://intechweb.org/books.php}.},
  ABSTRACT = {In this chapter we introduce a formalism, \emph{Time
                  Petri Nets (TPNs)}, to model real-time systems. We
                  compare it with another well-known formalism,
                  \emph{Timed Automata (TA)}, used for specifying
                  timed systems.  We precisely define the semantics of
                  TPNs and TA and compare them according to two
                  criteria: the \emph{languages} (or set of
                  behaviours) then can generate, and the \emph{trees}
                  (or branching behaviours) they can generate.  We
                  show that every TPN can be translated into an
                  equivalent TA.  Then, we introduce a real-time logic
                  to specify properties of real-time systems. We show
                  how to check that a given TPN satisfies a property
                  written in this logic. For this we use our
                  translation\footnote{This translation preserves the
                  properties of this logic.} from TPNs to TA and check
                  the property on the equivalent TA. Finally we
                  briefly report on experiments for checking real-time
                  properties of TPNs using this framework. },
    Type = {C - Book Chapters},
}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% 2007
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%






@article{DBLP:journals/entcs/BernotCCDMR07,
  author    = {Gilles Bernot and
               Franck Cassez and
               Jean{-}Paul Comet and
               Franck Delaplace and
               C{\'{e}}line M{\"{u}}ller and
               {Olivier F.} Roux and {Olivier H.} Roux},
  title     = {Semantics of Biological Regulatory Networks},
  journal   = {Electr. Notes Theor. Comput. Sci. (Proceedings of FORMATS 2003)},
  volume    = {180},
  number    = {3},
  pages     = {3--14},
  year      = {2007},
  url       = {http://dx.doi.org/10.1016/j.entcs.2004.01.038},
  doi       = {10.1016/j.entcs.2004.01.038},
  keywords = {bioinformatics, regulatory networks, hybrid systems},
  abstract ={The aim of the paper is to revisit the model of Biological Regulatory Networks (BRN) which was proposed by René Thomas to model the interactions between a set of genes. We give a formal semantics for BRN in terms of transition systems which formalizes the evolution rules given by René Thomas. Then we show how to use this model to find interesting properties of a BRN like the set of stable states, cycles etc using tools for analyzing transition systems.},
          Type = {B - International Conferences},

}





@inproceedings{CassezTA07,
  author    = {Franck Cassez and
               Stavros Tripakis and
               Karine Altisen},
  title     = {Sensor Minimization Problems with Static or Dynamic Observers for
               Fault Diagnosis},
  booktitle = {Seventh International Conference on Application of Concurrency to
               System Design {(ACSD} 2007), 10-13 July 2007, Bratislava, Slovak Republic},
  pages     = {90--99},
  year      = {2007},
  editor    = {Twan Basten and
               Gabriel Juh{\'{a}}s and
               Sandeep K. Shukla},
  crossref  = {DBLP:conf/acsd/2007},
  url       = {http://doi.ieeecomputersociety.org/10.1109/ACSD.2007.65},
  doi       = {10.1109/ACSD.2007.65},
  publisher = {{IEEE} Computer Society},
  year      = {2007},
  keyworfs = {fault diagnosis, automata},
  urlpaper = {papers/acsd07.pdf},
          Type = {B - International Conferences},

  urlslides = {papers/slides-acsd-07.pdf},
  abstract = {We study sensor minimization problems in the context of fault diagnosis. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in the plant as soon as possible after their occurrence. Existing literature on this problem has considered the case of static observers, where the set of observable events does not change during execution of the system. In this paper, we consider static as well as dynamic observers, where the observer can switch sensors on or off, thus dynamically changing the set of events it wishes to observe.}
}





@inproceedings{CassezDLLR07,
  author    = {Franck Cassez and
               Alexandre David and
               Kim Guldstrand Larsen and
               Didier Lime and
               Jean{-}Fran{\c{c}}ois Raskin},
  title     = {Timed Control with Observation Based and Stuttering Invariant Strategies},
  booktitle = {Automated Technology for Verification and Analysis, 5th International
               Symposium, {ATVA} 2007, Tokyo, Japan, October 22-25, 2007, Proceedings},
  pages     = {192--206},
  year      = {2007},
          Type = {B - International Conferences},

  editor    = {Kedar S. Namjoshi and
               Tomohiro Yoneda and
               Teruo Higashino and
               Yoshio Okamura},
   series    = {Lecture Notes in Computer Science},
  volume    = {4762},
  publisher = {Springer},
  urlpaper  = {papers/atva-07.pdf},
  url_link       = {http://dx.doi.org/10.1007/978-3-540-75596-8_15},
  doi       = {10.1007/978-3-540-75596-8_15},
  abstract = {In this paper we consider the problem of controller synthesis for timed games under imperfect information. Novel to our approach is the requirements to strategies: they should be based on a finite collection of observations and must be stuttering invariant in the sense that repeated identical observations will not change the strategy. We provide a constructive transformation to equivalent finite games with perfect infor- mation, giving decidability as well as allowing for an efficient on-the-fly forward algorithm. We report on application of an initial experimental implementation.},
  keywords = {control, timed automata, partial observation}
}






@inproceedings{cassez-formats-07,
  author    = {Franck Cassez},
  title     = {Efficient On-the-Fly Algorithms for Partially Observable Timed Games},
  booktitle = {Formal Modeling and Analysis of Timed Systems, 5th International Conference,
               {FORMATS} 2007, Salzburg, Austria, October 3-5, 2007, Proceedings},
  pages     = {5--24},
  year      = {2007},
  editor    = {Jean{-}Fran{\c{c}}ois Raskin and
               P. S. Thiagarajan},
  series    = {Lecture Notes in Computer Science},
  volume    = {4763},
          Type = {B - International Conferences},

  publisher = {Springer},
  urlpaper = {papers/formats-07.pdf},
  urlslides = {papers/formats-07-slides.pdf},
  url_link       = {http://dx.doi.org/10.1007/978-3-540-75454-1_3},
  doi       = {10.1007/978-3-540-75454-1_3},
  abstract = { In this paper, we review some recent results on the efficient synthesis of controllers for timed systems. We first recall the basics of controller synthesis for timed games and then present an efficient on-the-fly algorithm for reachability games and its extension to partially observable timed games.},
  keywords = {control, timed automata}
}





@inproceedings{DBLP:conf/tase/CassezTA07,
  author    = {Franck Cassez and
               Stavros Tripakis and
               Karine Altisen},
  title     = {Synthesis Of Optimal-Cost Dynamic Observers for Fault Diagnosis of
               Discrete-Event Systems},
  booktitle = {First Joint {IEEE/IFIP} Symposium on Theoretical Aspects of Software
               Engineering, {TASE} 2007, June 5-8, 2007, Shanghai, China},
  publisher = {{IEEE} Computer Society},
   pages     = {316--325},
  year      = {2007},
          Type = {B - International Conferences},

  urlpaper = {papers/tase-07.pdf},
  urlslides = {papers/slides-tase-07.pdf},
  url_link       = {http://dx.doi.org/10.1109/TASE.2007.51},
  isbn      = {0-7695-2856-2},
  doi       = {10.1109/TASE.2007.51},
  abstract = {Fault diagnosis consists in synthesizing a diagnoser that observes a given plant through a set of observable events, and identifies faults which are not observable as soon as possible after their occurrence. Existing literature on this problem has considered the case of static observers, where the set of observable events does not change during execution of the system. In this paper, we consider dynamic observers, where the observer can switch sensors on or off, thus dynamically changing the set of events it wishes to observe. We define a notion of cost for such dynamic observers and show that (i) the cost of a given dynamic observer can be computed and (ii) an optimal dynamic observer can be synthesized.},
}


%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% 2006
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%






@article{cassez-jss-06,
  ABSTRACT = {In this paper, we consider Time Petri Nets (TPN)
                  where time is associated with transitions. We give a
                  formal semantics for TPNs in terms of Timed
                  Transition Systems. Then, we propose a translation
                  from TPNs to Timed Automata (TA) that preserves the
                  behavioral semantics (timed bisimilarity) of the
                  TPNs. For the theory of TPNs this result is
                  two-fold: i) reachability problems and more
                  generally TCTL model-checking are decidable for
                  bounded TPNs; ii) allowing strict time constraints
                  on transitions for TPNs preserves the results
                  described in i). The practical appli- cations of the
                  translation are: i) one can specify a system using
                  both TPNs and Timed Automata and a precise semantics
                  is given to the composition; ii) one can use
                  existing tools for analyzing timed automata (like
                  Kronos, Uppaal or Cmc) to analyze TPNs. In this
                  paper we describe the new feature of the tool Romeo
                  that implements our translation of TPNs in the
                  Uppaal input format. We also report on experiments
                  carried out on various examples and compare the
                  result of our method to state-of-the-art tool for
                  analyzing TPNs.  },
  AUTHOR = {Franck Cassez and Roux, Olivier Henri},
  JOURNAL = {Journal of Software and Systems},
  Type = {A - Journal},
  PAGES = {1456--1468},
  urlpaper = {papers/jss-06.pdf},
  TITLE = {Structural Translation from Time Petri Nets to Timed Automata},
  VOLUME = {79},
  NUMBER = {10},
  MONTH = OCT,
  PUBLISHER = {Elsevier},
  YEAR = {2006},
  keywords = {Time Petri nets, timed automata, expressiveness}
}






@inproceedings{DBLP:conf/acsd/AltisenCT06,
  author    = {Karine Altisen and
               Franck Cassez and
               Stavros Tripakis},
  title     = {Monitoring and fault-diagnosis with digital clocks},
  booktitle = {Sixth International Conference on Application of Concurrency to System
               Design {(ACSD} 2006), 28-30 June 2006, Turku, Finland},
  pages     = {101--110},
  year      = {2006},
  publisher = {{IEEE} Computer Society},
  urlpaper = {papers/acsd06.pdf},
  urlslides = {papers/slides-acsd-06.pdf},
  url_link       = {http://dx.doi.org/10.1109/ACSD.2006.10},
  doi       = {10.1109/ACSD.2006.10},
          Type = {B - International Conferences},

  abstract = {
We study the monitoring and fault-diagnosis problems for dense-time real-time systems, where observers (monitors and diagnosers) have access to digital rather than analog clocks. Analog clocks are infinitely-precise, thus, not implementable. We show how, given a specification mod- eled as a timed automaton and a timed automaton model of the digital clock, a sound and optimal (i.e., as precise as possible) digital-clock monitor can be synthesized. We also show how, given plant and digital clock modeled as timed automata, we can check existence of a digital-clock diagnoser and, if one exists, how to synthesize it. Finally, we consider the problem of existence of digital-clock diag- nosers where the digital clock is unknown. We show that there are cases where a digital clock, no matter how precise, does not exist, even though the system is diagnosable with analog clocks. Finally, we provide a sufficient condition for digital-clock diagnosability.},
  keywords = {fault diagnosis, timed automata, monitoring}
}





@inproceedings{DBLP:conf/atva/CassezCJ06,
  author    = {Franck Cassez and
               Thomas Chatain and
               Claude Jard},
  editor    = {Susanne Graf and
               Wenhui Zhang},
  title     = {Symbolic Unfoldings for Networks of Timed Automata},
  booktitle = {Automated Technology for Verification and Analysis, 4th International
               Symposium, {ATVA} 2006, Beijing, China, October 23-26, 2006.},
  pages     = {307--321},
  year      = {2006},
          Type = {B - International Conferences},

  series    = {Lecture Notes in Computer Science},
  volume    = {4218},
  publisher = {Springer},
  urlpaper = {papers/unfolding-rr-06.pdf},
  urlslides = {papers/slides-atva-06.pdf},
  url_link       = {http://dx.doi.org/10.1007/11901914_24},
  doi       = {10.1007/11901914_24},
  abstract = {In this paper we give a symbolic concurrent semantics for network of timed automata (NTA) in terms of extended symbolic nets. Symbolic nets are standard occurrence nets extended with read arcs and symbolic constraints on places and transitions. We prove that there is a complete finite prefix for any NTA that contains at least the information of the simulation graph of the NTA but keep explicit the notions of concurrency and causality of the network.},
  keywords = {unfoldings, timed automata},
}


%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% 2005
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%






@article{DBLP:journals/entcs/CassezR05,
  author    = {Franck Cassez and
               Olivier H. Roux},
  title     = {Structural Translation from Time Petri Nets to Timed Automata},
  journal   = {Electr. Notes Theor. Comput. Sci. (Proceedings of AVOCS 2004)},
  volume    = {128},
          Type = {B - International Conferences},
  number    = {6},
  pages     = {145--160},
  year      = {2005},
  url       = {http://dx.doi.org/10.1016/j.entcs.2005.04.009},
  doi       = {10.1016/j.entcs.2005.04.009},
  urlslides = {papers/slides-avocs-04.pdf},

  abstract = {In this paper, we consider Time Petri Nets (TPN) where time is associated with transitions. We give a formal semantics for TPNs in terms of Timed Transition Systems. Then, we propose a translation from TPNs to Timed Automata (TA) that preserves the behavioural semantics (timed bisimilarity) of the TPNs. For the theory of TPNs this result is two-fold: i) reachability problems and more generally TCTL model-checking are decidable for bounded TPNs; ii) allowing strict time constraints on transitions for TPNs preserves the results described in i). The practical applications of the translation are: i) one can specify a system using both TPNs and Timed Automata and a precise semantics is given to the composition; ii) one can use existing tools for analysing timed automata (like Kronos, Uppaal or Cmc) to analyse TPNs.},
  keywords = {Petri nets, timed, automata},
}





@inproceedings{DBLP:conf/atva/BerardCHLR05,
  author    = {B{\'{e}}atrice B{\'{e}}rard and
               Franck Cassez and
               Serge Haddad and
               Didier Lime and
               Olivier H. Roux},
  title     = {Comparison of Different Semantics for Time Petri Nets},
  booktitle = {Automated Technology for Verification and Analysis, Third International Symposium, {ATVA} 2005, Taipei, Taiwan, October 4-7, 2005, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3707},
  publisher = {Springer},
  pages     = {293--307},
          Type = {B - International Conferences},

  year      = {2005},
  urlpaper = {papers/petri-nets-atva05.pdf},
  url_link       = {http://dx.doi.org/10.1007/11562948_23},
  doi       = {10.1007/11562948_23},
  abstract = {In this paper we study the model of Time Petri Nets (TPNs) where a time interval is associated with the firing of a transition, but we extend it by considering general intervals rather than closed ones. A key feature of timed models is the memory policy, i.e. which timing informations are kept when a transition is fired. The original model selects an intermediate semantics where the transitions disabled after consuming the tokens, as well as the firing transition, are reinitialised. However this semantics is not appropriate for some applications. So we consider here two alternative semantics: the atomic and the persistent atomic ones. First we present relevant patterns of discrete event systems which show the interest of these semantics. Then we compare the expressiveness of the three semantics w.r.t. the weak time bisimilarity establishing inclusion results in the general case. Furthermore we show that some inclusions are strict with unrestricted intervals even when nets are bounded. Then we focus on bounded TPNs with upper-closed intervals and we prove that the semantics are equivalent. Finally taking into account both the practical and the theoretical issues, we conclude that persistent atomic semantics should be preferred.},
  keywords = {Petri nets, semantics, expressiveness}
}





@inproceedings{DBLP:conf/concur/CassezDFLL05,
  author    = {Franck Cassez and
               Alexandre David and
               Emmanuel Fleury and
               Kim Guldstrand Larsen and
               Didier Lime},
  title     = {Efficient On-the-Fly Algorithms for the Analysis of Timed Games},
  booktitle = {{CONCUR} 2005 - Concurrency Theory, 16th International Conference,
               {CONCUR} 2005, San Francisco, CA, USA, August 23-26, 2005, Proceedings},
  pages     = {66--80},
  year      = {2005},
          Type = {B - International Conferences},

    series    = {Lecture Notes in Computer Science},
  volume    = {3653},
  publisher = {Springer},
  urlpaper = {papers/efficient-control-concur05.pdf},
  urlslides = {papers/efficient-control-concur05-slides.pdf},
  url_link       = {http://dx.doi.org/10.1007/11539452_9},
  doi       = {10.1007/11539452_9},
  abstract = {In this paper, we propose a first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties.
The algorithm we propose is a symbolic extension of the on-the-fly algorithm suggested by Liu &amp; Smolka [15] for linear-time model-checking of finite-state systems. Being on-the-fly, the symbolic algorithm may terminate long before having explored the entire state-space. Also the individual steps of the algorithm are carried out efficiently by the use of so-called zones as the underlying data structure.
Various optimizations of the basic symbolic algorithm are proposed as well as methods for obtaining time-optimal winning strategies (for reachability games). Extensive evaluation of an experimental implementation of the algorithm yields very encouraging performance results.},
  keywords = {control, synthesis, timed games},
}





@inproceedings{DBLP:conf/concur/BouyerCL05,
  author    = {Patricia Bouyer and
               Franck Cassez and
               Fran{\c{c}}ois Laroussinie},
  title     = {Modal Logics for Timed Control},
  booktitle = {{CONCUR} 2005 - Concurrency Theory, 16th International Conference,
               {CONCUR} 2005, San Francisco, CA, USA, August 23-26, 2005, Proceedings},
  pages     = {81--94},
  year      = {2005},
  crossref  = {DBLP:conf/concur/2005},
          Type = {B - International Conferences},

  urlpaper = {papers/modal-control-concur05.pdf},
  urlslides = {papers/slides-concur-05.pdf},
    url_link       = {http://dx.doi.org/10.1007/11539452_10},
  series    = {Lecture Notes in Computer Science},
  volume    = {3653},
  publisher = {Springer},
  doi       = {10.1007/11539452_10},
  abstract = {
Abstract. In this paper we use the timed modal logic Lnu to specify control objectives for timed plants. We show that the control problem for a large class of objectives can be reduced to a model-checking problem for an extension (Lcont) of the logic Lnu with a new modality.
More precisely we define a fragment of Lnu, namely Ldet, such that any
control objective of Lnudet can be translated into a Lcont formula that
holds for the plant if and only if there is a controller that can enforce
the control objective.
We also show that the new modality of Lcont strictly increases the expressive power of Lnu
while model-checking of Lcont remains EXPTIME-complete.},
  keywords = {control, synthesis, logics},
}





@inproceedings{DBLP:conf/formats/BerardCHLR05,
  author    = {B{\'{e}}atrice B{\'{e}}rard and
               Franck Cassez and
               Serge Haddad and
               Didier Lime and
               Olivier H. Roux},
  title     = {Comparison of the Expressiveness of Timed Automata and Time Petri
               Nets},
  booktitle = {Formal Modeling and Analysis of Timed Systems, Third International
               Conference, {FORMATS} 2005, Uppsala, Sweden, September 26-28, 2005,
               Proceedings},
  pages     = {211--225},
  editor    = {Paul Pettersson and
               Wang Yi},
          Type = {B - International Conferences},

 series    = {Lecture Notes in Computer Science},
  volume    = {3829},
  publisher = {Springer},
  year      = {2005},
  urlpaper = {papers/petri-nets-formats05.pdf},
  urlslides = {papers/slides-formats-05.pdf},
  url_link       = {http://dx.doi.org/10.1007/11603009_17},
  doi       = {10.1007/11603009_17},
  abstract = { In this paper we consider the model of Time Petri Nets (TPN) where time is associated with transitions. We also consider Timed Automata (TA) as defined by Alur \&amp; Dill, and compare the expressiveness of the two models w.r.t. timed language acceptance and (weak) timed bisimilarity. We first prove that there exists a TA A s.t. there is no TPN (even unbounded) that is (weakly) timed bisimilar to A. We then propose a structural translation from TA to (1-safe) TPNs preserving timed language acceptance. Further on, we prove that the previous (slightly extended) translation also preserves weak timed bisimilarity for a syntactical subclass of TA. For the theory of TPNs, the consequences are: 1) TA, bounded TPNs and 1-safe TPNs are equally expressive w.r.t. timed language acceptance; 2) TA are strictly more expressive than bounded TPNs w.r.t. timed bisimilarity; 3) The subclass bounded and 1-safe TPNs “`a la Merlin” are equally expressive w.r.t. timed bisimilarity.},
  keywords = {Petri nets, timed automata, expressiveness},
}





@inproceedings{DBLP:conf/fsttcs/BerardCHLR05,
  author    = {B{\'{e}}atrice B{\'{e}}rard and
               Franck Cassez and
               Serge Haddad and
               Didier Lime and
               Olivier H. Roux},
        Type = {B - International Conferences},

  title     = {When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?},
  booktitle = {{FSTTCS} 2005: Foundations of Software Technology and Theoretical
               Computer Science, 25th International Conference, Hyderabad, India,
               December 15-18, 2005, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3821},
  publisher = {Springer},
  editor    = {Ramaswamy Ramanujam and
               Sandeep Sen},
  pages     = {273--284},
  year      = {2005},
  urlpaper = {papers/petri-nets-fsttcs05.pdf},
  url_link       = {http://dx.doi.org/10.1007/11590156_22},
  doi       = {10.1007/11590156_22},
  abstract = {In this paper, we compare Timed Automata (TA) with Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is included in the class of TA. It is thus natural to try and identify the (strict) subclass T  of TA that is equivalent to TPN for the weak time bisimulation relation. We give a characterisation of this subclass and we show that the membership problem and the reachability problem for T  are PSPACE-complete. Furthermore we show that for a TA in T  with integer constants, an equivalent TPN can be built with integer bounds but with a size exponential w.r.t. the original model. Surprisingly, using rational bounds yields a TPN whose size is linear.},
  keywords = {Petri nets, timed automata, bisimulation},
}






@ARTICLE{Cortos-MSR05-control-journal,
  AUTHOR = {Altisen, Karine and Bouyer, Patricia and Cachat, Thierry and Cassez, Franck and Gardey, Guillaume},
  JOURNAL = {European Journal of Automated Systems},
  PAGES = {367-380},
  VOLUME = {39},
  NUMBER = {1-2-3},
  Type = {A - Journal},
  PUBLISHER = {Herm{\`e}s},
  TITLE = {Introduction au contrôle des syst{\`e}mes temps-r{\'e}el},
  urlpaper = {papers/intro-control-msr05.pdf},
  urlslides ={papers/slides-msr05.pdf},
  url_link = {http://www.lsv.ens-cachan.fr/aci-cortos},
  YEAR = {2005},
  note =  {From {A}ctes du 5{\`e}me {C}olloque sur la {M}od{\'e}lisation des {S}yst{\`e}mes {R}{\'e}actifs ({MSR}'05)},
  abstract = { In this paper we give a quick overview of the area of control of real-time systems.},
  keywords = {control, synthesis, timed games},
}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% 2004
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%






@article{DBLP:journals/entcs/BouyerCFL05,
  author    = {Patricia Bouyer and
               Franck Cassez and
               Emmanuel Fleury and
               Kim Guldstrand Larsen},
  title     = {Synthesis of Optimal Strategies Using HyTech},
  journal   = {Electr. Notes Theor. Comput. Sci. (Proceedings of GDV)},
  volume    = {119},
  Type = {B - International Conferences},

  number    = {1},
  pages     = {11--31},
  year      = {2004},
  url       = {http://dx.doi.org/10.1016/j.entcs.2004.07.006},
  urlslides = {papers/slides-gdv-04.pdf},
  doi       = {10.1016/j.entcs.2004.07.006},
  abstract = {Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. The problem of synthesizing an optimal winning strategy for a priced timed game under some hypotheses has been shown decidable in [P. Bouyer, F. Cassez, E. Fleury, and K.G. Larsen. Optimal strategies in priced timed game automata. Research Report BRICS RS-04-4, Denmark, Feb. 2004. Available at http://www.brics.dk/RS/04/4/]. In this paper, we present an algorithm for computing the optimal cost and for synthesizing an optimal strategy in case there exists one. We also describe the implementation of this algorithm with the tool HyTech and present an example.},
  keywords = {control, synthesis, priced timed games, optimal},
}





@article{DBLP:journals/fuin/CassezPR04,
  author    = {Franck Cassez and
               Claire Pagetti and
               Olivier H. Roux},
  title     = {A Timed Extension for {ALTARICA}},
  journal   = {Fundam. Inform.},
  volume    = {62},
  number    = {3-4},
  pages     = {291--332},
  year      = {2004},
  urlpapser = {papers/fi-2004.pdf},
  url_link       = {http://content.iospress.com/articles/fundamenta-informaticae/fi62-3-4-02},
  ABSTRACT = {  In this paper we present a \emph{timed} extension of the AltaRica
  formalism.  Following previous works, we first extend the semantics of
  AltaRica with time and define \emph{timed components} and \emph{timed nodes}.
  Moreover we lift the \emph{priority features} of AltaRica to the timed
  case.  We obtain a timed version of AltaRica, called Timed AltaRica. Finally we give
  a translation of a Timed AltaRica specification into a usual timed automaton.
  These are the semantic foundations of a high-level hierarchical
  language for the specification of timed systems.
},
 Type = {A - Journal},
 keywords = {timed automata, semantics},
 abstract = {},
}





@inproceedings{DBLP:conf/fsttcs/BouyerCFL04,
  author    = {Patricia Bouyer and
               Franck Cassez and
               Emmanuel Fleury and
               Kim Guldstrand Larsen},
  title     = {Optimal Strategies in Priced Timed Game Automata},
  booktitle = {{FSTTCS} 2004: Foundations of Software Technology and Theoretical
               Computer Science, 24th International Conference, Chennai, India, December   16-18, 2004, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3328},
  publisher = {Springer},

  pages     = {148--160},
  year      = {2004},
  urlpaper = {papers/fsttcs04.pdf},
  url_link       = {http://dx.doi.org/10.1007/978-3-540-30538-5_13},
  doi       = {10.1007/978-3-540-30538-5_13},
  Type = {B - International Conferences},
  keywords = {control, synthesis, timed games},
  abstract = {Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability games for priced timed game automata and prove that the optimal cost for winning such a game is computable under conditions concerning the non-zenoness of cost and we prove that it is decidable. Under stronger conditions (strictness of constraints) we prove that in case an optimal strategy exists, we can compute a state-based winning optimal strategy.}
}






@TECHREPORT{bouyer-brics-04,
  ABSTRACT = {  Priced timed (game) automata extends timed (game) automata with costs on both locations and transitions. In this paper we focus on
  reachability games for priced timed game automata and prove that the
  optimal cost for winning such a game is computable under conditions
  concerning the
  non-zenoness of cost. Under stronger conditions (strictness of
  constraints) we prove in addition that it is decidable whether there
  is an optimal strategy in which case an optimal strategy can be
  computed. Our results extend previous decidability result which
  requires the underlying game automata to be acyclic. Finally, our
  results are encoded in a first prototype in {\em HyTech} which is applied
  on a small case-study.},
  AUTHOR = {Bouyer, Patricia and Cassez, Franck and Fleury, Emmanuel and Larsen, Kim Guldstrand},
  INSTITUTION = {BRICS, Denmark},
  LEX = {Da},
  XXMONTH = FEB,
  NOTE = {ISSN 0909-0878},
  CATEGORY = {control},
  NUMBER = {RS-04-0},
  TITLE = {{Optimal Strategies in Priced Timed Game Automata}},
  TYPE = {E - Reports},
  URL = {http://www.brics.dk/RS/04/4/},
  YEAR = {2004},

}


%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% 2003
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%






@INPROCEEDINGS{pagetti-facs-2003,
  ABSTRACT = { In this paper we present a timed extension of the AltaRica language,
  Timed AltaRica, and describe the architecture of a compiler from Timed AltaRica to timed
  automata. We present the features of the language, namely
  modularity, hierarchical modeling and reuse of components during the
  specification phase, on an  avionics example. Then, we use the
  compiler from Timed AltaRica to Timed Automata to check some safety properties
  on the system.},
  AUTHOR = {Pagetti, Claire and Cassez, Franck and Roux, {Olivier F.}},
  BOOKTITLE = {Formal Aspects of Component Software (FACS'03)},
  MONTH = SEP,
  NOTE = {Pisa, Italy, September 8--9, 2003},
  PAGES = {63--80},
  PDF = {papers/facs-03.pdf},
  PUBLISHER = {UNU/IIST, Macau},
  TITLE = {{Hierarchical Modeling and Verification of Timed Systems in Timed {AltaRica}}},
  urlpaper = {papers/facs-03.pdf},
  url_link = {http://www.iist.unu.edu/newrh/III/1/docs/techreports/report284.html},
  YEAR = {2003},
  Type = {B - International Conferences},
  keywords = {timed automata, semantics, components},
}






@INPROCEEDINGS{msr-03,
  AUTHOR = {Cassez, Franck and Roux, {Olivier H.}},
  BOOKTITLE = {4$\textit{\`eme}$ Colloque Francophone sur la Mod{\'e}lisation des Syst{\`e}mes R{\'e}actifs, (MSR'03)},
  urlpaper = {papers/ri-msr-03.pdf},
  TITLE = {{From Time Petri Nets to Timed Automata}},
  YEAR = {2003},
  ABSTRACT = {
 In this paper, we consider Time Petri Nets (TPN) where time is
  associated with transitions. We give a formal semantics for TPNs in
  terms of Timed Transition Systems.  Then, we propose a translation
  from TPNs to Timed Automata (TA) that preserves the behavioural
  semantics (timed bisimilarity) of the TPNs.  For the theory of TPNs
  this result is two-fold: i) reachability problems and more generally
  TCTL model-checking are decidable for bounded TPNs; ii) allowing
  strict time constraints on transitions for TPNs preserves the
  results described in i).  The practical applications of the
  translation are: i) one can specify a system using both TPNs and
  Timed Automata and a precise semantics is given to the composition;
  ii) one can use existing tools for analysing timed automata (like
  KRONOS or UPPAAL or CMC) to analyse TPNs.
},
  Type = {B - International Conferences}
}



@inproceedings{DBLP:conf/concur/CassezL00,
  author    = {Franck Cassez and
               Kim Guldstrand Larsen},
  editor    = {Catuscia Palamidessi},
  title     = {The Impressive Power of Stopwatches},
  booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
               University Park, PA, USA, August 22-25, 2000, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1877},
  pages     = {138--152},
  publisher = {Springer},
  year      = {2000},
  url       = {https://doi.org/10.1007/3-540-44618-4\_12},
  doi       = {10.1007/3-540-44618-4\_12},
  timestamp = {Tue, 14 May 2019 10:00:43 +0200},
  urlpaper = {papers/concur-00.pdf},
  biburl    = {https://dblp.org/rec/conf/concur/CassezL00.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org},
  note      = {CONCUR Test-Of-Time Award 2022}
}



@MISC{cassez-etr-03,
  AUTHOR = {Cassez, Franck},
  HOWPUBLISHED = {Actes de l'\'ecole d'\'et\'e ETR'03},
  XXMONTH = SEP,
  urlpaper = {papers/verif-qualit-etr-03.pdf},
  urlslides = {papers/slides-etr-03.pdf},
  keywords = {verification, logics},
  TITLE = {{V\'erification qualitative -- {Model-Checking} et Logiques Temporelles}},
  YEAR = {2003},
abstract = {In this paper we give a quick overview of the area of modelling and verification of concurrent systems. We take transition systems as the basic model of concurrent systems, and introduce the temporal logics LTL and CTL. Moreover we give some hints for the model-checking algorithms for LTL and CTL.},
Type = {E - Reports},
}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% 2002
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%





@inproceedings{amast-98,
  author    = {Sutre, Grégoire  and
                Finkel, Alain and
                Roux, {Olivier F.} and
                Cassez, Franck},
  title     = {Effective Recognizability and Model Checking of Reactive
               {FIFFO} Automata},
  booktitle = {Algebraic Methodology and Software Technology, 7th International
               Conference, AMAST '98},
  year      = {1998},
  pages     = {106-123},
  ee        = {http://dx.doi.org/10.1007/3-540-49253-4_10},
  crossref  = {DBLP:conf/amast/1998},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  Type = {B - International Conferences},

}


\">\n            <i class=\"fa fa-download fa-fw\"></i> Download BibTeX\n          </a>\n        </li>\n        <li>\n          <a href=\"//bibbase.org/rss?bib=https://franck44.github.io/publications/franck-pubs.bib\">\n            <i class=\"fa fa-rss fa-fw\"></i> RSS Feed\n          </a>\n          </li>\n      </ul>\n      </li>\n\n      \n\n\n      \n    </ul>\n\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_embed\"\n         style=\"display: none;\">\n\n      Excellent! Next you can\n      <a href=\"/network/register?next=/network/newSiteFromTemplate%3Fbiburl=https://franck44.github.io/publications/franck-pubs.bib\"\n      >create a new website with this list</a>, or\n      embed it in an existing web page by copying &amp; pasting\n      any of the following snippets.\n\n      <div style=\"text-align: left; margin-top: 1em;\">\n        <strong>JavaScript</strong>\n        <span class=\"comment recommended\">(easiest)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;script src=\"https://bibbase.org/show?bib=https://franck44.github.io/publications/franck-pubs.bib&amp;jsonp=1&amp;jsonp=1\"&gt;&lt;/script&gt;\n          </code>\n        </div>\n\n        <strong>PHP</strong>\n        <div class=\"well well-small\">\n          <code>\n            &lt;?php\n            $contents = file_get_contents(\"https://bibbase.org/show?bib=https://franck44.github.io/publications/franck-pubs.bib&amp;jsonp=1\");\n            print_r($contents);\n            ?&gt;\n          </code>\n        </div>\n\n        <strong>iFrame</strong>\n        <span class=\"comment\">(not recommended)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;iframe src=\"https://bibbase.org/show?bib=https://franck44.github.io/publications/franck-pubs.bib&amp;jsonp=1\"&gt;&lt;/iframe&gt;\n          </code>\n        </div>\n\n        <p>\n          For more details see the <a href=\"//bibbase.org/help\">documention</a>.\n        </p>\n      </div>\n    </div>\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_preview\"\n         style=\"display: none;\">\n\n      This is a preview! To use this list on your own web site\n      or create a new web site from it,\n      <a href=\"/network/register?next=/network/newAccountWithFile%3FfileId=\"\n      >create a free account</a>. The file will be added\n      and you will be able to edit it in the File Manager.\n      We will show you instructions once you've created your account.\n    </div>\n\n    <div class=\"alert alert-warning bibbase_msg\" id=\"bibbase_msg_mendeley1\"\n         style=\"display: none;\">\n\n      <p>To the site owner:</p>\n\n      <p><strong>Action required!</strong> Mendeley is changing its\n        API. In order to keep using Mendeley with BibBase past April\n        14th, you need to:\n        <ol>\n          <li>renew the authorization for BibBase on Mendeley, and</li>\n          <li>update the BibBase URL\n            in your page the same way you did when you initially set up\n            this page.\n          </li>\n        </ol>\n      </p>\n\n      <p>\n        <a href=\"http://bibbase.org/cgi-bin/mendeley2/get.py\">\n          <i class=\"fa fa-angle-double-right\"></i>\n          Fix it now</a>\n      </p>\n    </div>\n\n  </div>\n\n\n  <div id=\"bibbase_body\">\n    \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2023\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2023')\"\n      onkeypress=\"toggleGroup('group_2023')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2023</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"cassez-fuller-ketabi-pearce-quiles-formalandexecutablesemanticsoftheevmindafny-2023\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/dafnyevm-fm-23.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-fuller-ketabi-pearce-quiles-formalandexecutablesemanticsoftheevmindafny-2023', 'https://franck44.github.io/publications/papers/dafnyevm-fm-23.pdf', event);\">\n    Formal and Executable Semantics of the EVM in Dafny.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Fuller, J.; Ketabi, M.; Pearce, D.;  and Quiles, H. M. A.\n</span>\n\n  \n\n</span>\n\n  In <i>International Symposium on Formal Methods (FM'23)</i>, of <i>Lecture Notes in Computer Science</i>,  2023. Springer\n  <span class=\"note\">Forthcoming.</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/franck-pubs.bib\"\n     onclick=\"log_download('cassez-fuller-ketabi-pearce-quiles-formalandexecutablesemanticsoftheevmindafny-2023', 'https://franck44.github.io/publications/franck-pubs.bib', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Formal and Executable Semantics of the EVM in Dafny [link]\"\n       title=\"Xx\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Xx</span></a>\n  &nbsp;\n  \n  <a href=\"https://franck44.github.io/publications/papers/dafnyevm-fm-23.pdf\"\n     onclick=\"log_download('cassez-fuller-ketabi-pearce-quiles-formalandexecutablesemanticsoftheevmindafny-2023', 'https://franck44.github.io/publications/papers/dafnyevm-fm-23.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Formal and Executable Semantics of the EVM in Dafny [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-fuller-ketabi-pearce-quiles-formalandexecutablesemanticsoftheevmindafny-2023\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>9 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-fuller-ketabi-pearce-quiles-formalandexecutablesemanticsoftheevmindafny-2023')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{dafnyevm-fm-23,\n  author    = {Franck Cassez and\n               Joanne Fuller and Milad Ketabi and David Pearce and \n               Horacio Mijail Anton Quiles},\n  title     = {Formal and Executable Semantics of the EVM in Dafny},\n  booktitle = {International Symposium on Formal Methods (FM&#x27;23)},\n  xxpages     = {445-462},\n  year      = {2023},\n  series    = {Lecture Notes in Computer Science},\n  xxxvolume    = {13047},\n  publisher = {Springer},  \n  note        = {Forthcoming.},\n  urlxx       = {},\n  xxxdoi       = {http://doi.org/10.1007/978-3-030-90870-6 24},\n\n  urlpaper = {papers/dafnyevm-fm-23.pdf},\n  abstract = {The Ethereum protocol implements a replicated state machine. The network participants keep track of the system state by: 1) agreeing on the sequence of transactions to be processed and 2) computing the state transitions that correspond to the sequence of transactions. Ethereum transactions are programs, called smart contracts, and computing a state transition requires executing some code. The Ethereum Virtual Machine (EVM) provides this capability and can execute programs written in EVM bytecode. We present a formal and executable semantics of the EVM written in the verification-friendly language Dafny: it provides (i) a readable, formal and verified specification of the semantics of the EVM; (ii) a framework to formally reason about bytecode.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The Ethereum protocol implements a replicated state machine. The network participants keep track of the system state by: 1) agreeing on the sequence of transactions to be processed and 2) computing the state transitions that correspond to the sequence of transactions. Ethereum transactions are programs, called smart contracts, and computing a state transition requires executing some code. The Ethereum Virtual Machine (EVM) provides this capability and can execute programs written in EVM bytecode. We present a formal and executable semantics of the EVM written in the verification-friendly language Dafny: it provides (i) a readable, formal and verified specification of the semantics of the EVM; (ii) a framework to formally reason about bytecode.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2022\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2022')\"\n      onkeypress=\"toggleGroup('group_2022')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2022</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"cassez-fuller-quiles-deductiveverificationofsmartcontractswithdafny-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1007/978-3-031-15008-1\\_5\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-fuller-quiles-deductiveverificationofsmartcontractswithdafny-2022', 'https://doi.org/10.1007/978-3-031-15008-1\\_5', event);\">\n    Deductive Verification of Smart Contracts with Dafny.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Fuller, J.;  and Quiles, H. M. A.\n</span>\n\n  \n\n</span>\n\n  In Groote, J. F.;  and Huisman, M., editor(s), <i>Formal Methods for Industrial Critical Systems - 27th International Conference, FMICS 2022, Warsaw, Poland, September 14-15, 2022, Proceedings</i>, volume 13487, of <i>Lecture Notes in Computer Science</i>, pages 50–66,  2022. Springer\n  <span class=\"note\">FMICS Best Paper Award</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1007/978-3-031-15008-1\\_5\"\n     onclick=\"log_download('cassez-fuller-quiles-deductiveverificationofsmartcontractswithdafny-2022', 'https://doi.org/10.1007/978-3-031-15008-1\\_5', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Deductive Verification of Smart Contracts with Dafny [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-031-15008-1_5\"\n     onclick=\"log_download('cassez-fuller-quiles-deductiveverificationofsmartcontractswithdafny-2022', 'http://doi.org/10.1007/978-3-031-15008-1_5', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-fuller-quiles-deductiveverificationofsmartcontractswithdafny-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>4 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-fuller-quiles-deductiveverificationofsmartcontractswithdafny-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/fmics/CassezFQ22,\n  author    = {Franck Cassez and\n               Joanne Fuller and\n               Horacio Mijail Anton Quiles},\n  editor    = {Jan Friso Groote and\n               Marieke Huisman},\n  title     = {Deductive Verification of Smart Contracts with Dafny},\n  booktitle = {Formal Methods for Industrial Critical Systems - 27th International\n               Conference, {FMICS} 2022, Warsaw, Poland, September 14-15, 2022, Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {13487},\n  pages     = {50--66},\n  publisher = {Springer},\n  year      = {2022},\n  url       = {https://doi.org/10.1007/978-3-031-15008-1\\_5},\n  doi       = {10.1007/978-3-031-15008-1\\_5},\n  timestamp = {Sat, 10 Sep 2022 20:58:36 +0200},\n  biburl    = {https://dblp.org/rec/conf/fmics/CassezFQ22.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org},\n  note            = {FMICS Best Paper Award},\n  abstract = {\n    We present a methodology to develop verified smart contracts. We write smart contracts, their specifications and implementations in the verification-friendly language DAFNY. In our methodology the ability to write specifications, implementations and to reason about correctness is a primary concern. We propose a simple, concise yet powerful solution to reasoning about contracts that have external calls. This includes arbitrary re-entrancy which is a major source of bugs and attacks in smart contracts. Although we do not yet have a compiler from DAFNY to EVM bytecode, the results we obtain on the DAFNY code can reasonably be assumed to hold on Solidity code: the translation of the DAFNY code to Solidity is straightforward. As a result our approach can readily be used to develop and deploy safer contracts.\n  }\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We present a methodology to develop verified smart contracts. We write smart contracts, their specifications and implementations in the verification-friendly language DAFNY. In our methodology the ability to write specifications, implementations and to reason about correctness is a primary concern. We propose a simple, concise yet powerful solution to reasoning about contracts that have external calls. This includes arbitrary re-entrancy which is a major source of bugs and attacks in smart contracts. Although we do not yet have a compiler from DAFNY to EVM bytecode, the results we obtain on the DAFNY code can reasonably be assumed to hold on Solidity code: the translation of the DAFNY code to Solidity is straightforward. As a result our approach can readily be used to develop and deploy safer contracts. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-fuller-quiles-deductiveverificationofsmartcontractswithdafny-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.48550/arXiv.2208.02920\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-fuller-quiles-deductiveverificationofsmartcontractswithdafny-2022', 'https://doi.org/10.48550/arXiv.2208.02920', event);\">\n    Deductive Verification of Smart Contracts with Dafny.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Fuller, J.;  and Quiles, H. M. A.\n</span>\n\n  \n\n</span>\n\n  <i>CoRR</i>, abs/2208.02920.  2022.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.48550/arXiv.2208.02920\"\n     onclick=\"log_download('cassez-fuller-quiles-deductiveverificationofsmartcontractswithdafny-2022', 'https://doi.org/10.48550/arXiv.2208.02920', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Deductive Verification of Smart Contracts with Dafny [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.48550/arXiv.2208.02920\"\n     onclick=\"log_download('cassez-fuller-quiles-deductiveverificationofsmartcontractswithdafny-2022', 'http://doi.org/10.48550/arXiv.2208.02920', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-fuller-quiles-deductiveverificationofsmartcontractswithdafny-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>4 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-fuller-quiles-deductiveverificationofsmartcontractswithdafny-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/corr/abs-2208-02920,\n  author    = {Franck Cassez and\n               Joanne Fuller and\n               Horacio Mijail Anton Quiles},\n  title     = {Deductive Verification of Smart Contracts with Dafny},\n  journal   = {CoRR},\n  volume    = {abs/2208.02920},\n  year      = {2022},\n  url       = {https://doi.org/10.48550/arXiv.2208.02920},\n  doi       = {10.48550/arXiv.2208.02920},\n  eprinttype = {arXiv},\n  eprint    = {2208.02920},\n  timestamp = {Wed, 10 Aug 2022 14:49:54 +0200},\n  biburl    = {https://dblp.org/rec/journals/corr/abs-2208-02920.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org},\n  abstract = {We present a methodology to develop verified smart contracts. We write smart contracts, their specifications and implementations in the verification-friendly language DAFNY. In our methodology the ability to write specifications, implementations and to reason about correctness is a primary concern. We propose a simple, concise yet powerful solution to reasoning about contracts that have external calls. This includes arbitrary re-entrancy which is a major source of bugs and attacks in smart contracts. Although we do not yet have a compiler from DAFNY to EVM bytecode, the results we obtain on the DAFNY code can reasonably be assumed to hold on Solidity code: the translation of the DAFNY code to Solidity is straightforward. As a result our approach can readily be used to develop and deploy safer contracts.}\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We present a methodology to develop verified smart contracts. We write smart contracts, their specifications and implementations in the verification-friendly language DAFNY. In our methodology the ability to write specifications, implementations and to reason about correctness is a primary concern. We propose a simple, concise yet powerful solution to reasoning about contracts that have external calls. This includes arbitrary re-entrancy which is a major source of bugs and attacks in smart contracts. Although we do not yet have a compiler from DAFNY to EVM bytecode, the results we obtain on the DAFNY code can reasonably be assumed to hold on Solidity code: the translation of the DAFNY code to Solidity is straightforward. As a result our approach can readily be used to develop and deploy safer contracts.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-fuller-asgaonkar-formalverificationoftheethereum20beaconchain-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/eth2-tacas-22.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-fuller-asgaonkar-formalverificationoftheethereum20beaconchain-2022', 'https://franck44.github.io/publications/papers/eth2-tacas-22.pdf', event);\">\n    Formal Verification of the Ethereum 2.0 Beacon Chain.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Fuller, J.;  and Asgaonkar, A.\n</span>\n\n  \n\n</span>\n\n  In Fisman, D.;  and Rosu, G., editor(s), <i>Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings, Part I</i>, volume 13243, of <i>Lecture Notes in Computer Science</i>, pages 167–182,  2022. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/eth2-tacas-22.pdf\"\n     onclick=\"log_download('cassez-fuller-asgaonkar-formalverificationoftheethereum20beaconchain-2022', 'https://franck44.github.io/publications/papers/eth2-tacas-22.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Formal Verification of the Ethereum 2.0 Beacon Chain [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-030-99524-9_9\"\n     onclick=\"log_download('cassez-fuller-asgaonkar-formalverificationoftheethereum20beaconchain-2022', 'http://doi.org/10.1007/978-3-030-99524-9_9', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-fuller-asgaonkar-formalverificationoftheethereum20beaconchain-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-fuller-asgaonkar-formalverificationoftheethereum20beaconchain-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/tacas/CassezFA22,\n  author    = {Franck Cassez and\n               Joanne Fuller and\n               Aditya Asgaonkar},\n  editor    = {Dana Fisman and\n               Grigore Rosu},\n  title     = {Formal Verification of the Ethereum 2.0 Beacon Chain},\n  booktitle = {Tools and Algorithms for the Construction and Analysis of Systems\n               - 28th International Conference, {TACAS} 2022, Held as Part of the\n               European Joint Conferences on Theory and Practice of Software, {ETAPS}\n               2022, Munich, Germany, April 2-7, 2022, Proceedings, Part {I}},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {13243},\n  pages     = {167--182},\n  publisher = {Springer},\n  year      = {2022},\n  url       = {https://doi.org/10.1007/978-3-030-99524-9\\_9},\n  doi       = {10.1007/978-3-030-99524-9\\_9},\n  timestamp = {Fri, 29 Apr 2022 14:50:36 +0200},\n  biburl    = {https://dblp.org/rec/conf/tacas/CassezFA22.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org},\n  urlpaper = {papers/eth2-tacas-22.pdf},\n  abstract = {We report our experience in the formal verification of the reference implementation of the Beacon Chain.\n  The Beacon Chain is the backbone component of the new Proof-of-Stake Ethereum 2.0 network: it is in charge of tracking \n  information about the validators,\n  their stakes, their attestations (votes) and if some validators are found to be dishonest, to slash them (they lose some of their stakes).   \n  The Beacon Chain is mission-critical and any bug in it could compromise the whole  network.\n  The Beacon Chain reference implementation developed by the Ethereum Foundation is written in Python, and provides a detailed operational description of the state machine each Beacon Chain&#x27;s network participant (node) must implement. \n  We have formally specified and verified the absence of runtime errors in (a large and critical part of) the Beacon Chain reference implementation using the verification-friendly language Dafny.\n  During the course of this work, we have uncovered several issues, proposed verified fixes.\n  We have also synthesised functional correctness specifications that enable us to provide guarantees beyond\n  runtime errors. Our software artefact with the code and proofs in Dafny is available at \\url{https://github.com/ConsenSys/eth2.0-dafny}.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We report our experience in the formal verification of the reference implementation of the Beacon Chain. The Beacon Chain is the backbone component of the new Proof-of-Stake Ethereum 2.0 network: it is in charge of tracking information about the validators, their stakes, their attestations (votes) and if some validators are found to be dishonest, to slash them (they lose some of their stakes). The Beacon Chain is mission-critical and any bug in it could compromise the whole network. The Beacon Chain reference implementation developed by the Ethereum Foundation is written in Python, and provides a detailed operational description of the state machine each Beacon Chain's network participant (node) must implement. We have formally specified and verified the absence of runtime errors in (a large and critical part of) the Beacon Chain reference implementation using the verification-friendly language Dafny. During the course of this work, we have uncovered several issues, proposed verified fixes. We have also synthesised functional correctness specifications that enable us to provide guarantees beyond runtime errors. Our software artefact with the code and proofs in Dafny is available at ˘rlhttps://github.com/ConsenSys/eth2.0-dafny.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2021\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2021')\"\n      onkeypress=\"toggleGroup('group_2021')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2021</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"cassez-verificationoftheincrementalmerkletreealgorithmwithdafny-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/merkle-fm-21.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-verificationoftheincrementalmerkletreealgorithmwithdafny-2021', 'https://franck44.github.io/publications/papers/merkle-fm-21.pdf', event);\">\n    Verification of the Incremental Merkle Tree Algorithm with Dafny.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>International Symposium on Formal Methods (FM'21)</i>, volume 13047, of <i>Lecture Notes in Computer Science</i>, pages 445-462,  2021. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/franck-pubs.bib\"\n     onclick=\"log_download('cassez-verificationoftheincrementalmerkletreealgorithmwithdafny-2021', 'https://franck44.github.io/publications/franck-pubs.bib', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Verification of the Incremental Merkle Tree Algorithm with Dafny [link]\"\n       title=\"Xx\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Xx</span></a>\n  &nbsp;\n  \n  <a href=\"https://franck44.github.io/publications/papers/merkle-fm-21.pdf\"\n     onclick=\"log_download('cassez-verificationoftheincrementalmerkletreealgorithmwithdafny-2021', 'https://franck44.github.io/publications/papers/merkle-fm-21.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Verification of the Incremental Merkle Tree Algorithm with Dafny [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/http://doi.org/10.1007/978-3-030-90870-6 24\"\n     onclick=\"log_download('cassez-verificationoftheincrementalmerkletreealgorithmwithdafny-2021', 'http://doi.org/http://doi.org/10.1007/978-3-030-90870-6 24', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-verificationoftheincrementalmerkletreealgorithmwithdafny-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>13 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-verificationoftheincrementalmerkletreealgorithmwithdafny-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{merkle-fm-21,\n  author    = {Franck Cassez},\n  title     = {Verification of the Incremental Merkle Tree Algorithm with Dafny},\n  booktitle = {International Symposium on Formal Methods (FM&#x27;21)},\n  pages     = {445-462},\n  year      = {2021},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {13047},\n  publisher = {Springer},  \n  xxxnote        = {Forthcoming.},\n  urlxx       = {},\n  doi       = {http://doi.org/10.1007/978-3-030-90870-6 24},\n\n  urlpaper = {papers/merkle-fm-21.pdf},\n  abstract = {The Deposit Smart Contract (DSC) is an instrumental component of the Ethereum 2.0 Phase 0 infrastructure. We have developed the first machine-checkable version of the incremental Merkle tree algorithm used in the DSC. We present our new and original correctness proof of the algorithm along with the Dafny machine-checkable version. The main results are: 1) a new proof of total correctness; 2) a software artefact with the proof in the form of the complete Dafny code base and 3) new provably correct optimisations of the algorithm.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The Deposit Smart Contract (DSC) is an instrumental component of the Ethereum 2.0 Phase 0 infrastructure. We have developed the first machine-checkable version of the incremental Merkle tree algorithm used in the DSC. We present our new and original correctness proof of the algorithm along with the Dafny machine-checkable version. The main results are: 1) a new proof of total correctness; 2) a software artefact with the proof in the form of the complete Dafny code base and 3) new provably correct optimisations of the algorithm.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-fuller-asgaonkar-formalverificationoftheethereum20beaconchain-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/abs/2110.12909\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-fuller-asgaonkar-formalverificationoftheethereum20beaconchain-2021', 'https://arxiv.org/abs/2110.12909', event);\">\n    Formal Verification of the Ethereum 2.0 Beacon Chain.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Fuller, J.;  and Asgaonkar, A.\n</span>\n\n  \n\n</span>\n\n  <i>CoRR</i>, abs/2110.12909.  2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/abs/2110.12909\"\n     onclick=\"log_download('cassez-fuller-asgaonkar-formalverificationoftheethereum20beaconchain-2021', 'https://arxiv.org/abs/2110.12909', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Formal Verification of the Ethereum 2.0 Beacon Chain [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-fuller-asgaonkar-formalverificationoftheethereum20beaconchain-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-fuller-asgaonkar-formalverificationoftheethereum20beaconchain-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/corr/abs-2110-12909,\n  author    = {Franck Cassez and\n               Joanne Fuller and\n               Aditya Asgaonkar},\n  title     = {Formal Verification of the Ethereum 2.0 Beacon Chain},\n  journal   = {CoRR},\n  volume    = {abs/2110.12909},\n  year      = {2021},\n  url       = {https://arxiv.org/abs/2110.12909},\n  eprinttype = {arXiv},\n  eprint    = {2110.12909},\n  timestamp = {Thu, 28 Oct 2021 15:25:31 +0200},\n  biburl    = {https://dblp.org/rec/journals/corr/abs-2110-12909.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-verificationoftheincrementalmerkletreealgorithmwithdafny-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/abs/2105.06009\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-verificationoftheincrementalmerkletreealgorithmwithdafny-2021', 'https://arxiv.org/abs/2105.06009', event);\">\n    Verification of the Incremental Merkle Tree Algorithm with Dafny.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>\n</span>\n\n  \n\n</span>\n\n  <i>CoRR</i>, abs/2105.06009.  2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/abs/2105.06009\"\n     onclick=\"log_download('cassez-verificationoftheincrementalmerkletreealgorithmwithdafny-2021', 'https://arxiv.org/abs/2105.06009', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Verification of the Incremental Merkle Tree Algorithm with Dafny [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-verificationoftheincrementalmerkletreealgorithmwithdafny-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>13 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-verificationoftheincrementalmerkletreealgorithmwithdafny-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/corr/abs-2021,\n    title={Verification of the Incremental Merkle Tree Algorithm with Dafny}, \n    author={Franck Cassez},\n    year={2021},\n    eprint={2105.06009},\n    archivePrefix={arXiv},\n    primaryClass={cs.LO},\n    abstract={\n    The Deposit Smart Contract (DSC) is an instrumental component of the Ethereum 2.0 Phase 0 infrastructure. We have developed the first machine-checkable version of the incremental Merkle tree algorithm used in the DSC. We present our new and original correctness proof of the algorithm along with the Dafny machine-checkable version. The main results are: 1) a new proof of total correctness; 2) a software artefact with the proof in the form of the complete Dafny code base and 3) new provably correct optimisations of the algorithm.\n    },\n  journal   = {CoRR},\n  volume    = {abs/2105.06009},\n  url       = {https://arxiv.org/abs/2105.06009}\n}\n  \n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The Deposit Smart Contract (DSC) is an instrumental component of the Ethereum 2.0 Phase 0 infrastructure. We have developed the first machine-checkable version of the incremental Merkle tree algorithm used in the DSC. We present our new and original correctness proof of the algorithm along with the Dafny machine-checkable version. The main results are: 1) a new proof of total correctness; 2) a software artefact with the proof in the form of the complete Dafny code base and 3) new provably correct optimisations of the algorithm. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-jensen-larsen-verificationandparametersynthesisforrealtimeprogramsusingrefinementoftraceabstraction-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/fi-2021.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-jensen-larsen-verificationandparametersynthesisforrealtimeprogramsusingrefinementoftraceabstraction-2021', 'https://franck44.github.io/publications/papers/fi-2021.pdf', event);\">\n    Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Jensen, P. G.;  and Larsen, K. G.\n</span>\n\n  \n\n</span>\n\n  <i>Fundam. Informaticae</i>, 178(1-2): 31–57.  2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/fi-2021.pdf\"\n     onclick=\"log_download('cassez-jensen-larsen-verificationandparametersynthesisforrealtimeprogramsusingrefinementoftraceabstraction-2021', 'https://franck44.github.io/publications/papers/fi-2021.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.3233/FI-2021-1997\"\n     onclick=\"log_download('cassez-jensen-larsen-verificationandparametersynthesisforrealtimeprogramsusingrefinementoftraceabstraction-2021', 'http://doi.org/10.3233/FI-2021-1997', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-jensen-larsen-verificationandparametersynthesisforrealtimeprogramsusingrefinementoftraceabstraction-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>3 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-jensen-larsen-verificationandparametersynthesisforrealtimeprogramsusingrefinementoftraceabstraction-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/fuin/CassezJL21,\n  author    = {Franck Cassez and\n               Peter Gj{\\o}l Jensen and\n               Kim Guldstrand Larsen},\n  title     = {Verification and Parameter Synthesis for Real-Time Programs using\n               Refinement of Trace Abstraction},\n  journal   = {Fundam. Informaticae},\n  abstract = {We address the safety verification and synthesis problems for real-time systems. We introduce real-time programs that are made of instructions that can perform assignments to discrete and real-valued variables. They are general enough to capture interesting classes of timed systems such as timed automata, stopwatch automata, time(d) Petri nets and hybrid automata. \nWe propose a semi-algorithm using refinement of trace abstractions to solve both the reachability verification problem and the parameter synthesis problem for real-time programs. \nAll of the algorithms proposed have been implemented and we have conducted a series of experiments, comparing the performance of our new approach to state-of-the-art tools in classical reachability, robustness analysis and parameter synthesis for timed systems. We show that our new method provides solutions to problems which are unsolvable by the current state-of-the-art tools.},\n\n  volume    = {178},\n  number    = {1-2},\n  pages     = {31--57},\n  year      = {2021},\n  url       = {https://doi.org/10.3233/FI-2021-1997},\n  doi       = {10.3233/FI-2021-1997},\n  timestamp = {Fri, 22 Jan 2021 00:00:00 +0100},\n  biburl    = {https://dblp.org/rec/journals/fuin/CassezJL21.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org},\n   urlpaper = {papers/fi-2021.pdf},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We address the safety verification and synthesis problems for real-time systems. We introduce real-time programs that are made of instructions that can perform assignments to discrete and real-valued variables. They are general enough to capture interesting classes of timed systems such as timed automata, stopwatch automata, time(d) Petri nets and hybrid automata. We propose a semi-algorithm using refinement of trace abstractions to solve both the reachability verification problem and the parameter synthesis problem for real-time programs. All of the algorithms proposed have been implemented and we have conducted a series of experiments, comparing the performance of our new approach to state-of-the-art tools in classical reachability, robustness analysis and parameter synthesis for timed systems. We show that our new method provides solutions to problems which are unsolvable by the current state-of-the-art tools.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2020\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2020')\"\n      onkeypress=\"toggleGroup('group_2020')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2020</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"cassez-jensen-larsen-verificationandparametersynthesisforrealtimeprogramsusingrefinementoftraceabstraction-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/abs/2007.10539\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-jensen-larsen-verificationandparametersynthesisforrealtimeprogramsusingrefinementoftraceabstraction-2020', 'https://arxiv.org/abs/2007.10539', event);\">\n    Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Jensen, P. G.;  and Larsen, K. G.\n</span>\n\n  \n\n</span>\n\n  <i>CoRR</i>, abs/2007.10539.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/abs/2007.10539\"\n     onclick=\"log_download('cassez-jensen-larsen-verificationandparametersynthesisforrealtimeprogramsusingrefinementoftraceabstraction-2020', 'https://arxiv.org/abs/2007.10539', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-jensen-larsen-verificationandparametersynthesisforrealtimeprogramsusingrefinementoftraceabstraction-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>4 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-jensen-larsen-verificationandparametersynthesisforrealtimeprogramsusingrefinementoftraceabstraction-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/corr/abs-2007-10539,\n  author    = {Franck Cassez and\n               Peter Gj{\\o}l Jensen and\n               Kim Guldstrand Larsen},\n  title     = {Verification and Parameter Synthesis for Real-Time Programs using\n               Refinement of Trace Abstraction},\n  journal   = {CoRR},\n  abstract = {We address the safety verification and synthesis problems for real-time systems. We introduce real-time programs that are made of instructions that can perform assignments to discrete and real-valued variables. They are general enough to capture interesting classes of timed systems such as timed automata, stopwatch automata, time(d) Petri nets and hybrid automata. \nWe propose a semi-algorithm using refinement of trace abstractions to solve both the reachability verification problem and the parameter synthesis problem for real-time programs. \nAll of the algorithms proposed have been implemented and we have conducted a series of experiments, comparing the performance of our new approach to state-of-the-art tools in classical reachability, robustness analysis and parameter synthesis for timed systems. We show that our new method provides solutions to problems which are unsolvable by the current state-of-the-art tools.},\n  volume    = {abs/2007.10539},\n  year      = {2020},\n  url       = {https://arxiv.org/abs/2007.10539},\n  archivePrefix = {arXiv},\n  eprint    = {2007.10539},\n  timestamp = {Tue, 28 Jul 2020 01:00:00 +0200},\n  biburl    = {https://dblp.org/rec/journals/corr/abs-2007-10539.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We address the safety verification and synthesis problems for real-time systems. We introduce real-time programs that are made of instructions that can perform assignments to discrete and real-valued variables. They are general enough to capture interesting classes of timed systems such as timed automata, stopwatch automata, time(d) Petri nets and hybrid automata. We propose a semi-algorithm using refinement of trace abstractions to solve both the reachability verification problem and the parameter synthesis problem for real-time programs. All of the algorithms proposed have been implemented and we have conducted a series of experiments, comparing the performance of our new approach to state-of-the-art tools in classical reachability, robustness analysis and parameter synthesis for timed systems. We show that our new method provides solutions to problems which are unsolvable by the current state-of-the-art tools.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2018\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2018')\"\n      onkeypress=\"toggleGroup('group_2018')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2018</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"zheng-julien-podorozhny-cassez-rakotoarivelo-efficientandscalableruntimemonitoringforcyberphysicalsystem-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1109/JSYST.2016.2614599\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'zheng-julien-podorozhny-cassez-rakotoarivelo-efficientandscalableruntimemonitoringforcyberphysicalsystem-2018', 'https://doi.org/10.1109/JSYST.2016.2614599', event);\">\n    Efficient and Scalable Runtime Monitoring for Cyber-Physical System.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Zheng, X.; Julien, C.; Podorozhny, R. M.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Rakotoarivelo, T.\n</span>\n\n  \n\n</span>\n\n  <i>IEEE Syst. J.</i>, 12(2): 1667–1678.  2018.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1109/JSYST.2016.2614599\"\n     onclick=\"log_download('zheng-julien-podorozhny-cassez-rakotoarivelo-efficientandscalableruntimemonitoringforcyberphysicalsystem-2018', 'https://doi.org/10.1109/JSYST.2016.2614599', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Efficient and Scalable Runtime Monitoring for Cyber-Physical System [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/JSYST.2016.2614599\"\n     onclick=\"log_download('zheng-julien-podorozhny-cassez-rakotoarivelo-efficientandscalableruntimemonitoringforcyberphysicalsystem-2018', 'http://doi.org/10.1109/JSYST.2016.2614599', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/zheng-julien-podorozhny-cassez-rakotoarivelo-efficientandscalableruntimemonitoringforcyberphysicalsystem-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('zheng-julien-podorozhny-cassez-rakotoarivelo-efficientandscalableruntimemonitoringforcyberphysicalsystem-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/sj/Zheng0PCR18,\n  author    = {Xi Zheng and\n               Christine Julien and\n               Rodion M. Podorozhny and\n               Franck Cassez and\n               Thierry Rakotoarivelo},\n  title     = {Efficient and Scalable Runtime Monitoring for Cyber-Physical System},\n  journal   = {{IEEE} Syst. J.},\n  abstract={\n  Our reliance on cyber-physical systems (CPSs) is increasingly widespread, but scalable methods for the analysis of such systems remain a significant challenge. Runtime verification of CPSs provides a reasonable middle ground between formal verification and simulation approaches, but it comes with its own challenges. A runtime verification system must run directly on the deployed application. In the CPS domain, it is therefore critical that a runtime verification system exhibits low overhead and good scalability so that the verification does not interfere with the analyzed CPS application. In this paper, we introduce Brace, a runtime verification system whose focus is on ensuring these performance qualities for applications in the CPS domain. Brace strives to bound the computation overhead for CPS runtime verification while preserving a high level of monitoring accuracy in terms of the number of false positive and false negative reports. Brace is particularly suitable to systems in which scheduling is distributed across networked CPS components. We evaluate Brace to determine how effectively and efficiently it can detect injected errors in two existing real-life CPS applications with distributed scheduling. Our results demonstrate that Brace efficiently detects those errors and a few true bugs and is able to bound both the memory and computation overhead even in systems with large numbers of observed events.},\n  volume    = {12},\n  number    = {2},\n  pages     = {1667--1678},\n  year      = {2018},\n  url       = {https://doi.org/10.1109/JSYST.2016.2614599},\n  doi       = {10.1109/JSYST.2016.2614599},\n  timestamp = {Fri, 11 Sep 2020 15:02:08 +0200},\n  biburl    = {https://dblp.org/rec/journals/sj/Zheng0PCR18.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Our reliance on cyber-physical systems (CPSs) is increasingly widespread, but scalable methods for the analysis of such systems remain a significant challenge. Runtime verification of CPSs provides a reasonable middle ground between formal verification and simulation approaches, but it comes with its own challenges. A runtime verification system must run directly on the deployed application. In the CPS domain, it is therefore critical that a runtime verification system exhibits low overhead and good scalability so that the verification does not interfere with the analyzed CPS application. In this paper, we introduce Brace, a runtime verification system whose focus is on ensuring these performance qualities for applications in the CPS domain. Brace strives to bound the computation overhead for CPS runtime verification while preserving a high level of monitoring accuracy in terms of the number of false positive and false negative reports. Brace is particularly suitable to systems in which scheduling is distributed across networked CPS components. We evaluate Brace to determine how effectively and efficiently it can detect injected errors in two existing real-life CPS applications with distributed scheduling. Our results demonstrate that Brace efficiently detects those errors and a few true bugs and is able to bound both the memory and computation overhead even in systems with large numbers of observed events.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2017\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2017')\"\n      onkeypress=\"toggleGroup('group_2017')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2017</span>\n      <span class=\"bibbase_group_count\">\n        \n        (6)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"cassez-dealedo-jensen-wuppaalcomputationofworstcaseexecutiontimeforbinaryprogramswithuppaal-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/kim-fest-17.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-dealedo-jensen-wuppaalcomputationofworstcaseexecutiontimeforbinaryprogramswithuppaal-2017', 'https://franck44.github.io/publications/papers/kim-fest-17.pdf', event);\">\n    WUPPAAL: Computation of Worst-Case Execution-Time for Binary Programs with UPPAAL.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; de Aledo, P. G.;  and Jensen, P. G.\n</span>\n\n  \n\n</span>\n\n  In <i>Models, Algorithms, Logics and Tools - Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday</i>, volume 10460, of <i>Lecture Notes in Computer Science</i>, pages 560–577,  2017. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/kim-fest-17.pdf\"\n     onclick=\"log_download('cassez-dealedo-jensen-wuppaalcomputationofworstcaseexecutiontimeforbinaryprogramswithuppaal-2017', 'https://franck44.github.io/publications/papers/kim-fest-17.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"WUPPAAL: Computation of Worst-Case Execution-Time for Binary Programs with UPPAAL [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-319-63121-9_28\"\n     onclick=\"log_download('cassez-dealedo-jensen-wuppaalcomputationofworstcaseexecutiontimeforbinaryprogramswithuppaal-2017', 'http://doi.org/10.1007/978-3-319-63121-9_28', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-dealedo-jensen-wuppaalcomputationofworstcaseexecutiontimeforbinaryprogramswithuppaal-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-dealedo-jensen-wuppaalcomputationofworstcaseexecutiontimeforbinaryprogramswithuppaal-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{mod-17,\n  author    = {Franck Cassez and\n               Pablo Gonz{\\&#x27;{a}}lez de Aledo and\n               Peter Gj{\\o}l Jensen},\n  title     = {{WUPPAAL:} Computation of Worst-Case Execution-Time for Binary Programs\n               with {UPPAAL}},\n  booktitle = {Models, Algorithms, Logics and Tools - Essays Dedicated to Kim Guldstrand\n               Larsen on the Occasion of His 60th Birthday},\n  pages     = {560--577},\n  year      = {2017},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {10460},\n  publisher = {Springer},  \n  url       = {https://doi.org/10.1007/978-3-319-63121-9_28},\n  doi       = {10.1007/978-3-319-63121-9_28},\n  timestamp = {Tue, 22 Aug 2017 08:17:15 +0200},\n  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/birthday/CassezAJ17},\n  bibsource = {dblp computer science bibliography, http://dblp.org},\n\n  urlpaper = {papers/kim-fest-17.pdf},\n  abstract = {We address the problem of computing the worst-case execu- tion-time (WCET) of binary programs using a real-time model-checker. \n  In our previous work, we introduced a fully automated and modular methodology to build a model (network of timed automata) that combined a binary \n  program and the hardware to run the program on. \n  Computing the WCET amounts to finding the longest path time-wise in this model, which can be done using a real-time model checker like Uppaal. \n  In this work, we generalise the previous approach and we define a generic framework to support arbitrary binary language and hardware.\nWe have implemented our new approach in an extended version of Uppaal, called Wuppaal. \nExperimental results using some standard benchmarks suite for WCET computation (from Malardalen University) \nshow that our technique is practical and promising.}\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We address the problem of computing the worst-case execu- tion-time (WCET) of binary programs using a real-time model-checker. In our previous work, we introduced a fully automated and modular methodology to build a model (network of timed automata) that combined a binary program and the hardware to run the program on. Computing the WCET amounts to finding the longest path time-wise in this model, which can be done using a real-time model checker like Uppaal. In this work, we generalise the previous approach and we define a generic framework to support arbitrary binary language and hardware. We have implemented our new approach in an extended version of Uppaal, called Wuppaal. Experimental results using some standard benchmarks suite for WCET computation (from Malardalen University) show that our technique is practical and promising.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-jensen-larsen-refinementoftraceabstractionforrealtimeprograms-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/rp-17.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-jensen-larsen-refinementoftraceabstractionforrealtimeprograms-2017', 'https://franck44.github.io/publications/papers/rp-17.pdf', event);\">\n    Refinement of Trace Abstraction for Real-Time Programs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Jensen, P. G.;  and Larsen, K. G.\n</span>\n\n  \n\n</span>\n\n  In <i>Reachability Problems - 11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings</i>, volume 10506, pages 42–58,  2017. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/rp-17.pdf\"\n     onclick=\"log_download('cassez-jensen-larsen-refinementoftraceabstractionforrealtimeprograms-2017', 'https://franck44.github.io/publications/papers/rp-17.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Refinement of Trace Abstraction for Real-Time Programs [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-319-67089-8_4\"\n     onclick=\"log_download('cassez-jensen-larsen-refinementoftraceabstractionforrealtimeprograms-2017', 'http://doi.org/10.1007/978-3-319-67089-8_4', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-jensen-larsen-refinementoftraceabstractionforrealtimeprograms-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-jensen-larsen-refinementoftraceabstractionforrealtimeprograms-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{rp-17,\n  author    = {Franck Cassez and\n               Peter Gj{\\o}l Jensen and\n               Kim Guldstrand Larsen},\n  title     = {Refinement of Trace Abstraction for Real-Time Programs},\n  booktitle = {Reachability Problems - 11th International Workshop, {RP} 2017, London,\n               UK, September 7-9, 2017, Proceedings},\n  volume    = {10506},\n  pages     = {42--58},\n  year      = {2017},\n  publisher = {Springer},\n  url       = {https://doi.org/10.1007/978-3-319-67089-8_4},\n  doi       = {10.1007/978-3-319-67089-8_4},\n  timestamp = {Wed, 30 Aug 2017 15:59:47 +0200},\n  isbn      = {978-3-319-67088-1},\n  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/rp/CassezJL17},\n  bibsource = {dblp computer science bibliography, http://dblp.org},\n  urlpaper = {papers/rp-17.pdf},\n  abstract = {Real-time programs are made of instructions that can perform assignments to discrete and real-valued variables. \n  They are general enough to capture interesting classes of timed systems such as timed automata, stopwatch automata, time(d) Petri nets and hybrid automata. \n  We propose a semi-algorithm using refinement of trace abstractions to solve the reachability verification problem for real-time programs. \n  We report on the implementation of our algorithm and we show that our new method provides solutions to problems which are unsolvable by the current state-of-the-art tools.}\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Real-time programs are made of instructions that can perform assignments to discrete and real-valued variables. They are general enough to capture interesting classes of timed systems such as timed automata, stopwatch automata, time(d) Petri nets and hybrid automata. We propose a semi-algorithm using refinement of trace abstractions to solve the reachability verification problem for real-time programs. We report on the implementation of our algorithm and we show that our new method provides solutions to problems which are unsolvable by the current state-of-the-art tools.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-sloane-scalasmtsatisfiabilitymodulotheoryinscalatoolpaper-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/scala-17.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-sloane-scalasmtsatisfiabilitymodulotheoryinscalatoolpaper-2017', 'https://franck44.github.io/publications/papers/scala-17.pdf', event);\">\n    ScalaSMT: Satisfiability Modulo Theory in Scala (Tool Paper).\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Sloane, A.\n</span>\n\n  \n\n</span>\n\n  In <i>SCALA'17, October 23–27, 2017, Vancouver, BC, Canada. Proceedings.</i>,  2017. acm\n  <span class=\"note\">forthcoming</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/scala-17.pdf\"\n     onclick=\"log_download('cassez-sloane-scalasmtsatisfiabilitymodulotheoryinscalatoolpaper-2017', 'https://franck44.github.io/publications/papers/scala-17.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"ScalaSMT: Satisfiability Modulo Theory in Scala (Tool Paper) [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-sloane-scalasmtsatisfiabilitymodulotheoryinscalatoolpaper-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>3 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-sloane-scalasmtsatisfiabilitymodulotheoryinscalatoolpaper-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{scala-17,\nauthor    = {Franck Cassez\nand {Anthony M.} Sloane},\n  title     = {ScalaSMT: Satisfiability Modulo Theory in Scala (Tool Paper)},\n  booktitle = {SCALA&#x27;17, October 23--27, 2017, Vancouver, BC, Canada. Proceedings.},\n  pages     = {},\n  year      = {2017},\n  xxxurl       = {http://dx.doi.org/10.1007/978-3-662-46681-0_39},\n  xxxdoi       = {10.1007/978-3-662-46681-0_39},\n  publisher = &quot;acm&quot;,\n  xvolume = 9035,\n  xxxseries    = lncs,\n  mywebpage = {soft-verif},\n  keywords = {scala, SMT solvers},\n  category = {soft-verif},\n  show = {},\n  note={forthcoming},\n  urlpaper = {papers/scala-17.pdf},\n  abstract = {A Satisfiability Modulo Theory (SMT) solver is a program that implements algorithms to automatically determine whether \n  a logical formula is satisfiable. \n  The performance of SMT solvers has dramatically increased in the last decade and for instance, \n  many of the state-of-the-art software analysis tools heavily rely on SMT solving to analyse source code. \n  We present ScalaSMT, a Scala library that leverages the power of SMT solvers and makes SMT solving directly usable in Scala. \n  ScalaSMT provides seamless access to numerous popular SMT solvers like Z3, CVC4, Yices, MathSat or SMTInterpol. \n  Our library comes with a domain-specific language to write terms and logical formulas for a wide range of logical theories, \n  thereby isolating users from the details of particular solvers.},\n    Type = {B - International Conferences},\n    show = {},\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  A Satisfiability Modulo Theory (SMT) solver is a program that implements algorithms to automatically determine whether a logical formula is satisfiable. The performance of SMT solvers has dramatically increased in the last decade and for instance, many of the state-of-the-art software analysis tools heavily rely on SMT solving to analyse source code. We present ScalaSMT, a Scala library that leverages the power of SMT solvers and makes SMT solving directly usable in Scala. ScalaSMT provides seamless access to numerous popular SMT solvers like Z3, CVC4, Yices, MathSat or SMTInterpol. Our library comes with a domain-specific language to write terms and logical formulas for a wide range of logical theories, thereby isolating users from the details of particular solvers.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"zheng-julien-chen-podorozhny-cassez-realtimesimulationsupportforruntimeverificationofcyberphysicalsystems-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1145/3063382\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'zheng-julien-chen-podorozhny-cassez-realtimesimulationsupportforruntimeverificationofcyberphysicalsystems-2017', 'https://doi.org/10.1145/3063382', event);\">\n    Real-Time Simulation Support for Runtime Verification of Cyber-Physical Systems.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Zheng, X.; Julien, C.; Chen, H.; Podorozhny, R. M.;  and <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>\n</span>\n\n  \n\n</span>\n\n  <i>ACM Trans. Embed. Comput. Syst.</i>, 16(4): 106:1–106:24.  2017.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1145/3063382\"\n     onclick=\"log_download('zheng-julien-chen-podorozhny-cassez-realtimesimulationsupportforruntimeverificationofcyberphysicalsystems-2017', 'https://doi.org/10.1145/3063382', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Real-Time Simulation Support for Runtime Verification of Cyber-Physical Systems [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1145/3063382\"\n     onclick=\"log_download('zheng-julien-chen-podorozhny-cassez-realtimesimulationsupportforruntimeverificationofcyberphysicalsystems-2017', 'http://doi.org/10.1145/3063382', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/zheng-julien-chen-podorozhny-cassez-realtimesimulationsupportforruntimeverificationofcyberphysicalsystems-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('zheng-julien-chen-podorozhny-cassez-realtimesimulationsupportforruntimeverificationofcyberphysicalsystems-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/tecs/ZhengJCPC17,\n  author    = {Xi Zheng and\n               Christine Julien and\n               Hongxu Chen and\n               Rodion M. Podorozhny and\n               Franck Cassez},\n  title     = {Real-Time Simulation Support for Runtime Verification of Cyber-Physical\n               Systems},\n  journal   = {{ACM} Trans. Embed. Comput. Syst.},\n  volume    = {16},\n  number    = {4},\n  abstract={\n    In Cyber-Physical Systems (CPS), cyber and physical components must work seamlessly in tandem. Runtime verification of CPS is essential yet very difficult, due to deployment environments that are expensive, dangerous, or simply impossible to use for verification tasks. A key enabling factor of runtime verification of CPS is the ability to integrate real-time simulations of portions of the CPS into live running systems. We propose a verification approach that allows CPS application developers to opportunistically leverage real-time simulation to support runtime verification. Our approach, termed BraceBind, allows selecting, at runtime, between actual physical processes or simulations of them to support a running CPS application. To build BraceBind, we create a real-time simulation architecture to generate and manage multiple real-time simulation environments based on existing simulation models in a manner that ensures sufficient accuracy for verifying a CPS application. Specifically, BraceBind aims to both improve simulation speed and minimize latency, thereby making it feasible to integrate simulations of physical processes into the running CPS application. BraceBind then integrates this real-time simulation architecture with an existing runtime verification approach that has low computational overhead and high accuracy. This integration uses an aspect-oriented adapter architecture that connects the variables in the cyber portion of the CPS application with either sensors and actuators in the physical world or the automatically generated real-time simulation. Our experimental results show that, with a negligible performance penalty, our approach is both efficient and effective in detecting program errors that are otherwise only detectable in a physical deployment.\n  },\n  pages     = {106:1--106:24},\n  year      = {2017},\n  url       = {https://doi.org/10.1145/3063382},\n  doi       = {10.1145/3063382},\n  timestamp = {Fri, 09 Apr 2021 18:25:32 +0200},\n  biburl    = {https://dblp.org/rec/journals/tecs/ZhengJCPC17.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In Cyber-Physical Systems (CPS), cyber and physical components must work seamlessly in tandem. Runtime verification of CPS is essential yet very difficult, due to deployment environments that are expensive, dangerous, or simply impossible to use for verification tasks. A key enabling factor of runtime verification of CPS is the ability to integrate real-time simulations of portions of the CPS into live running systems. We propose a verification approach that allows CPS application developers to opportunistically leverage real-time simulation to support runtime verification. Our approach, termed BraceBind, allows selecting, at runtime, between actual physical processes or simulations of them to support a running CPS application. To build BraceBind, we create a real-time simulation architecture to generate and manage multiple real-time simulation environments based on existing simulation models in a manner that ensures sufficient accuracy for verifying a CPS application. Specifically, BraceBind aims to both improve simulation speed and minimize latency, thereby making it feasible to integrate simulations of physical processes into the running CPS application. BraceBind then integrates this real-time simulation architecture with an existing runtime verification approach that has low computational overhead and high accuracy. This integration uses an aspect-oriented adapter architecture that connects the variables in the cyber portion of the CPS application with either sensors and actuators in the physical world or the automatically generated real-time simulation. Our experimental results show that, with a negligible performance penalty, our approach is both efficient and effective in detecting program errors that are otherwise only detectable in a physical deployment. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-mller-analysisofprogramcode-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.google.com/patents/US9760469\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-mller-analysisofprogramcode-2017', 'https://www.google.com/patents/US9760469', event);\">\n    Analysis of program code.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Müller, C.\n</span>\n\n  \n\n</span>\n\n  September 12 2017.\n  <span class=\"note\">US Patent 9,760,469</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.google.com/patents/US9760469\"\n     onclick=\"log_download('cassez-mller-analysisofprogramcode-2017', 'https://www.google.com/patents/US9760469', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Analysis of program code [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-mller-analysisofprogramcode-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-mller-analysisofprogramcode-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@misc{cassez2017analysis,\n  title={Analysis of program code},\n  author={Cassez, F. and M{\\&quot;u}ller, C.},\n  url={https://www.google.com/patents/US9760469},\n  year={2017},\n  mywebpage = {soft-verif},\n  abstract={\n  This disclosure relates to the analysis of a program based on source code where the source code comprises a call to a function associated with a function implementation. A processor determines, based on a summary that over-approximates the function, an assignment of an input variable and an output variable of the function call to reach a predefined state. The processor then determines, based on the implementation of the function whether the assignment of the input variable results in the assignment of the output variable. If it does not, the processor determines a narrowed summary for the function such that the narrowed summary over-approximates the function and excludes the assignment of the input variable and the output variable. Finally, the processor stores the narrowed summary on a datastore. Inlining of function code and unfolding of loops is avoided and parallel processing of multiple functions is possible.\n  },\n  keywords = {software verification},\n  category = {soft-verif},\n  month=sep # &quot;~12&quot;,\n  note={US Patent 9,760,469}\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This disclosure relates to the analysis of a program based on source code where the source code comprises a call to a function associated with a function implementation. A processor determines, based on a summary that over-approximates the function, an assignment of an input variable and an output variable of the function call to reach a predefined state. The processor then determines, based on the implementation of the function whether the assignment of the input variable results in the assignment of the output variable. If it does not, the processor determines a narrowed summary for the function such that the narrowed summary over-approximates the function and excludes the assignment of the input variable and the output variable. Finally, the processor stores the narrowed summary on a datastore. Inlining of function code and unfolding of loops is avoided and parallel processing of multiple functions is possible. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-sloane-roberts-pigram-suvanpong-dealedomarugn-skinkstaticanalysisofprogramsinllvmintermediaterepresentationcompetitioncontribution-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/sv-comp-2017.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-sloane-roberts-pigram-suvanpong-dealedomarugn-skinkstaticanalysisofprogramsinllvmintermediaterepresentationcompetitioncontribution-2017', 'https://franck44.github.io/publications/papers/sv-comp-2017.pdf', event);\">\n    Skink: Static Analysis of Programs in LLVM Intermediate Representation (Competition contribution).\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Sloane, A.; Roberts, M.; Pigram, M.; Suvanpong, P.;  and de Aledo Marugán, P. G.\n</span>\n\n  \n\n</span>\n\n  In <i>Tools and Algorithms for the Construction and Analysis of Systems - 23rd International Conference, TACAS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017. Proceedings</i>, of <i>lncs</i>, pages 380–384,  2017. springv\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/sv-comp-2017.pdf\"\n     onclick=\"log_download('cassez-sloane-roberts-pigram-suvanpong-dealedomarugn-skinkstaticanalysisofprogramsinllvmintermediaterepresentationcompetitioncontribution-2017', 'https://franck44.github.io/publications/papers/sv-comp-2017.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Skink: Static Analysis of Programs in LLVM Intermediate Representation (Competition contribution) [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-662-54580-5_27\"\n     onclick=\"log_download('cassez-sloane-roberts-pigram-suvanpong-dealedomarugn-skinkstaticanalysisofprogramsinllvmintermediaterepresentationcompetitioncontribution-2017', 'http://doi.org/10.1007/978-3-662-54580-5_27', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-sloane-roberts-pigram-suvanpong-dealedomarugn-skinkstaticanalysisofprogramsinllvmintermediaterepresentationcompetitioncontribution-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-sloane-roberts-pigram-suvanpong-dealedomarugn-skinkstaticanalysisofprogramsinllvmintermediaterepresentationcompetitioncontribution-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{tacas-17,\nauthor    = {Franck Cassez\nand {Anthony M.} Sloane\nand Matthew Roberts\nand Matthew Pigram\nand Pongsak Suvanpong\nand Pablo Gonz{\\&#x27;{a}}lez de Aledo Marug{\\&#x27;{a}}n},\n  title     = {Skink: Static Analysis of Programs in LLVM Intermediate Representation (Competition contribution)},\n  booktitle = {Tools and Algorithms for the Construction and Analysis of Systems\n               - 23rd International Conference, {TACAS} 2017, Held as Part of the\n               European Joint Conferences on Theory and Practice of Software, {ETAPS}\n               2017, Uppsala, Sweden, April 22-29, 2017. Proceedings},\n  \n pages     = {380--384},\n  year      = {2017},\n  url       = {https://doi.org/10.1007/978-3-662-54580-5_27},\n  doi       = {10.1007/978-3-662-54580-5_27},\n  publisher = springv,\n  xvolume = 10206,\n  series    = lncs,\n  mywebpage = {soft-verif},\n  keywords = {refinement, software verification},\n  category = {soft-verif},\n  show = {},\n  xxnote={forthcoming},\n  urlpaper = {papers/sv-comp-2017.pdf},\n  abstract = {Skink is a static analysis tool that analyses the LLVM intermediate representation (LLVM-IR)\nof a program source code.\nThe analysis consists of checking whether there is a feasible execution that can reach a\n designated error block in the LLVM-IR.\nThe result of a program analysis is &#x60;&#x60;correct&#x27;&#x27; if the error block is not reachable,\n&#x60;&#x60;incorrect&#x27;&#x27; if the error block is reachable, or &#x60;&#x60;inconclusive&#x27;&#x27; if the status of the program could not be determined.\nIn this paper, we introduce Skink V2.0 to analyse single and multi-threaded C programs.},\n    Type = {A - International Conferences},\n}\n\n\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n%%% 2016\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Skink is a static analysis tool that analyses the LLVM intermediate representation (LLVM-IR) of a program source code. The analysis consists of checking whether there is a feasible execution that can reach a designated error block in the LLVM-IR. The result of a program analysis is ``correct'' if the error block is not reachable, ``incorrect'' if the error block is reachable, or ``inconclusive'' if the status of the program could not be determined. In this paper, we introduce Skink V2.0 to analyse single and multi-threaded C programs.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2016\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2016')\"\n      onkeypress=\"toggleGroup('group_2016')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2016</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"sloane-cassez-buckley-thesbtratsparsergeneratorpluginforscalatoolpaper-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/scala-2016.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'sloane-cassez-buckley-thesbtratsparsergeneratorpluginforscalatoolpaper-2016', 'https://franck44.github.io/publications/papers/scala-2016.pdf', event);\">\n    The Sbt-rats Parser Generator Plugin for Scala (Tool Paper).\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Sloane, A.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Buckley, S.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 2016 7th ACM SIGPLAN Symposium on Scala</i>, of <i>SCALA 2016</i>, pages 110–113, New York, NY, USA,  2016. ACM\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/scala-2016.pdf\"\n     onclick=\"log_download('sloane-cassez-buckley-thesbtratsparsergeneratorpluginforscalatoolpaper-2016', 'https://franck44.github.io/publications/papers/scala-2016.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"The Sbt-rats Parser Generator Plugin for Scala (Tool Paper) [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1145/2998392.3001580\"\n     onclick=\"log_download('sloane-cassez-buckley-thesbtratsparsergeneratorpluginforscalatoolpaper-2016', 'http://doi.org/10.1145/2998392.3001580', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sloane-cassez-buckley-thesbtratsparsergeneratorpluginforscalatoolpaper-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sloane-cassez-buckley-thesbtratsparsergeneratorpluginforscalatoolpaper-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{scala-16,\n author = {Sloane, {Anthony M.} and Cassez, Franck and Buckley, Scott},\n title = {The {Sbt-rats} Parser Generator Plugin for Scala (Tool Paper)},\n booktitle = {Proceedings of the 2016 7th ACM SIGPLAN Symposium on Scala},\n series = {SCALA 2016},\n year = {2016},\n isbn = {978-1-4503-4648-1},\n location = {Amsterdam, Netherlands},\n pages = {110--113},\n numpages = {4},\n url = {http://doi.acm.org/10.1145/2998392.3001580},\n doi = {10.1145/2998392.3001580},\n urlpaper={papers/scala-2016.pdf},\n xxacmid = {3001580},\n publisher = {ACM},\n address = {New York, NY, USA},\n keywords = {Parsing expression grammars, Scala build tool},\n abstract={Tools for creating parsers are a key part of a mature language eco-system. Scala has traditionally relied on combinator libraries for defining parsers but being libraries they come with fundamental implementation limitations. An alternative is to use a Java-based parser generator such as ANTLR or Rats! but these tools are quite verbose and not ideal to use with Scala code. We describe our experiences with Scala-focused parser generation that is embodied in our sbtrats plugin for the Scala Build Tool. At its simplest, sbtrats provides a bridge to the Rats! parser generator for Java. On top of this bridge, we have a simple grammar definition notation that incorporates annotations for tree construction and pretty-printing. As well as generating a Rats! grammar, sbtrats can optionally generate case class definitions for the tree structure and a pretty-printer defined using our Kiama language processing library. We explain the sbtrats grammar notation and describe our positive experiences using it to define grammars for LLVM assembly notation and the SMTLIB input/output language for SMT solvers.},\n show = {},\n Type = {B - International Conferences},\n\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Tools for creating parsers are a key part of a mature language eco-system. Scala has traditionally relied on combinator libraries for defining parsers but being libraries they come with fundamental implementation limitations. An alternative is to use a Java-based parser generator such as ANTLR or Rats! but these tools are quite verbose and not ideal to use with Scala code. We describe our experiences with Scala-focused parser generation that is embodied in our sbtrats plugin for the Scala Build Tool. At its simplest, sbtrats provides a bridge to the Rats! parser generator for Java. On top of this bridge, we have a simple grammar definition notation that incorporates annotations for tree construction and pretty-printing. As well as generating a Rats! grammar, sbtrats can optionally generate case class definitions for the tree structure and a pretty-printer defined using our Kiama language processing library. We explain the sbtrats grammar notation and describe our positive experiences using it to define grammars for LLVM assembly notation and the SMTLIB input/output language for SMT solvers.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"zheng-julien-podorozhny-cassez-rakotoarivelo-efficientandscalableruntimemonitoringforcyberphysicalsystem-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/ieee-systems-2016.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'zheng-julien-podorozhny-cassez-rakotoarivelo-efficientandscalableruntimemonitoringforcyberphysicalsystem-2016', 'https://franck44.github.io/publications/papers/ieee-systems-2016.pdf', event);\">\n    Efficient and Scalable Runtime Monitoring for Cyber–Physical System.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Zheng, X.; Julien, C.; Podorozhny, R.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Rakotoarivelo, T.\n</span>\n\n  \n\n</span>\n\n  <i>IEEE Systems Journal</i>, 99: 1–12. October 2016.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/ieee-systems-2016.pdf\"\n     onclick=\"log_download('zheng-julien-podorozhny-cassez-rakotoarivelo-efficientandscalableruntimemonitoringforcyberphysicalsystem-2016', 'https://franck44.github.io/publications/papers/ieee-systems-2016.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Efficient and Scalable Runtime Monitoring for Cyber–Physical System [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"http://ieeexplore.ieee.org/document/7605519/\"\n     onclick=\"log_download('zheng-julien-podorozhny-cassez-rakotoarivelo-efficientandscalableruntimemonitoringforcyberphysicalsystem-2016', 'http://ieeexplore.ieee.org/document/7605519/', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Efficient and Scalable Runtime Monitoring for Cyber–Physical System [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/JSYST.2016.2614599\"\n     onclick=\"log_download('zheng-julien-podorozhny-cassez-rakotoarivelo-efficientandscalableruntimemonitoringforcyberphysicalsystem-2016', 'http://doi.org/10.1109/JSYST.2016.2614599', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/zheng-julien-podorozhny-cassez-rakotoarivelo-efficientandscalableruntimemonitoringforcyberphysicalsystem-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('zheng-julien-podorozhny-cassez-rakotoarivelo-efficientandscalableruntimemonitoringforcyberphysicalsystem-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{ieee-16,\n  title={Efficient and Scalable Runtime Monitoring for Cyber--Physical System},\n  author={Zheng, Xi and Christine Julien and {Rodion M.} Podorozhny  and Franck Cassez and Thierry Rakotoarivelo},\n  journal={IEEE Systems Journal},\n  year={2016},\n  volume=99,\n  pages={1--12},\n  publisher={IEEE},\n  doi={10.1109/JSYST.2016.2614599},\n  ISSN={1932-8184},\n  urlpaper={papers/ieee-systems-2016.pdf},\n  url_link={http://ieeexplore.ieee.org/document/7605519/},\n  month=oct,\n  show = {},\n  keywords = {wcet, timed automata},\n\n  abstract={Our reliance on cyber–physical systems (CPSs) is increasingly widespread, but scalable methods for the analysis of such systems remain a significant challenge. Runtime verification of CPSs provides a reasonable middle ground between formal verification and simulation approaches, but it comes with its own challenges. A runtime verification system must run directly on the deployed application. In the CPS domain, it is therefore critical that a runtime verification system exhibits low overhead and good scalability so that the verification does not interfere with the analyzed CPS application. In this paper, we introduce Brace, a runtime verification system whose focus is on ensuring these performance qualities for applications in the CPS domain. Brace strives to bound the computation overhead for CPS runtime verification while preserving a high level of monitoring accuracy in terms of the number of false positive and false negative reports. Brace is particularly suitable to systems in which scheduling is distributed across networked CPS components. We evaluate Brace to determine how effectively and efficiently it can detect injected errors in two existing real-life CPS applications with distributed scheduling. Our results demonstrate that Brace efficiently detects those errors and a few true bugs and is able to bound both the memory and computation overhead even in systems with large numbers of observed events.},\n  Type = {A - Journal},\n\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Our reliance on cyber–physical systems (CPSs) is increasingly widespread, but scalable methods for the analysis of such systems remain a significant challenge. Runtime verification of CPSs provides a reasonable middle ground between formal verification and simulation approaches, but it comes with its own challenges. A runtime verification system must run directly on the deployed application. In the CPS domain, it is therefore critical that a runtime verification system exhibits low overhead and good scalability so that the verification does not interfere with the analyzed CPS application. In this paper, we introduce Brace, a runtime verification system whose focus is on ensuring these performance qualities for applications in the CPS domain. Brace strives to bound the computation overhead for CPS runtime verification while preserving a high level of monitoring accuracy in terms of the number of false positive and false negative reports. Brace is particularly suitable to systems in which scheduling is distributed across networked CPS components. We evaluate Brace to determine how effectively and efficiently it can detect injected errors in two existing real-life CPS applications with distributed scheduling. Our results demonstrate that Brace efficiently detects those errors and a few true bugs and is able to bound both the memory and computation overhead even in systems with large numbers of observed events.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-vandermeyden-zhang-thecomplexityofsynchronousnotionsofinformationflowsecurity-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/tcs-2016.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-vandermeyden-zhang-thecomplexityofsynchronousnotionsofinformationflowsecurity-2016', 'https://franck44.github.io/publications/papers/tcs-2016.pdf', event);\">\n    The complexity of synchronous notions of information flow security.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; van der Meyden, R.;  and Zhang, C.\n</span>\n\n  \n\n</span>\n\n  <i>Theor. Comput. Sci.</i>, 631: 16–42.  2016.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/tcs-2016.pdf\"\n     onclick=\"log_download('cassez-vandermeyden-zhang-thecomplexityofsynchronousnotionsofinformationflowsecurity-2016', 'https://franck44.github.io/publications/papers/tcs-2016.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"The complexity of synchronous notions of information flow security [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"http://dx.doi.org/10.1016/j.tcs.2016.03.011\"\n     onclick=\"log_download('cassez-vandermeyden-zhang-thecomplexityofsynchronousnotionsofinformationflowsecurity-2016', 'http://dx.doi.org/10.1016/j.tcs.2016.03.011', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"The complexity of synchronous notions of information flow security [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1016/j.tcs.2016.03.011\"\n     onclick=\"log_download('cassez-vandermeyden-zhang-thecomplexityofsynchronousnotionsofinformationflowsecurity-2016', 'http://doi.org/10.1016/j.tcs.2016.03.011', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-vandermeyden-zhang-thecomplexityofsynchronousnotionsofinformationflowsecurity-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-vandermeyden-zhang-thecomplexityofsynchronousnotionsofinformationflowsecurity-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{cassez-tcs-2016,\n  author    = {Franck Cassez and\n               Ron van der Meyden and\n               Chenyi Zhang},\n  title     = {The complexity of synchronous notions of information flow security},\n  journal   = {Theor. Comput. Sci.},\n  volume    = {631},\n  pages     = {16--42},\n  year      = {2016},\n  urlpaper = {papers/tcs-2016.pdf},\n  url_link       = {http://dx.doi.org/10.1016/j.tcs.2016.03.011},\n  doi       = {10.1016/j.tcs.2016.03.011},\n  timestamp = {Tue, 17 May 2016 17:26:44 +0200},\n  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/tcs/CassezMZ16},\n  bibsource = {dblp computer science bibliography, http://dblp.org},\n  show = {},\n  abstract={The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one in which agents operate synchronously with awareness of the global clock. This enables timing based attacks to be captured, whereas previous work on this topic has dealt primarily with asynchronous systems. Versions of the notions of nondeducibility on inputs, nondeducibility on strategies, and an unwinding based notion are formulated for this model. All three notions are shown to be decidable, and their computational complexity is characterised.},\n  Type = {A - Journal},\n  keywords = {security, non-interference},\n\n\n}\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n%%% 2015\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one in which agents operate synchronously with awareness of the global clock. This enables timing based attacks to be captured, whereas previous work on this topic has dealt primarily with asynchronous systems. Versions of the notions of nondeducibility on inputs, nondeducibility on strategies, and an unwinding based notion are formulated for this model. All three notions are shown to be decidable, and their computational complexity is characterised.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2015\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2015')\"\n      onkeypress=\"toggleGroup('group_2015')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2015</span>\n      <span class=\"bibbase_group_count\">\n        \n        (5)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"zheng-julien-podorozhny-cassez-braceassertionruntimeverificationofcyberphysicalsystems-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/mass-2015.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'zheng-julien-podorozhny-cassez-braceassertionruntimeverificationofcyberphysicalsystems-2015', 'https://franck44.github.io/publications/papers/mass-2015.pdf', event);\">\n    BraceAssertion: Runtime Verification of Cyber-Physical Systems.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Zheng, X.; Julien, C.; Podorozhny, R.;  and <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>12th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015, Dallas, TX, USA, October 19-22, 2015</i>, pages 298–306,  2015. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/mass-2015.pdf\"\n     onclick=\"log_download('zheng-julien-podorozhny-cassez-braceassertionruntimeverificationofcyberphysicalsystems-2015', 'https://franck44.github.io/publications/papers/mass-2015.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"BraceAssertion: Runtime Verification of Cyber-Physical Systems [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"http://dx.doi.org/10.1109/MASS.2015.15\"\n     onclick=\"log_download('zheng-julien-podorozhny-cassez-braceassertionruntimeverificationofcyberphysicalsystems-2015', 'http://dx.doi.org/10.1109/MASS.2015.15', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"BraceAssertion: Runtime Verification of Cyber-Physical Systems [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/MASS.2015.15\"\n     onclick=\"log_download('zheng-julien-podorozhny-cassez-braceassertionruntimeverificationofcyberphysicalsystems-2015', 'http://doi.org/10.1109/MASS.2015.15', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/zheng-julien-podorozhny-cassez-braceassertionruntimeverificationofcyberphysicalsystems-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('zheng-julien-podorozhny-cassez-braceassertionruntimeverificationofcyberphysicalsystems-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{mass-Zheng-15,\n  author    = {Xi Zheng and\n               Christine Julien and\n               {Rodion M.} Podorozhny and\n               Franck Cassez},\n  title     = {BraceAssertion: Runtime Verification of Cyber-Physical Systems},\n  booktitle = {12th {IEEE} International Conference on Mobile Ad Hoc and Sensor Systems,\n               {MASS} 2015, Dallas, TX, USA, October 19-22, 2015},\n  pages     = {298--306},\n  year      = {2015},\n  urlpaper = {papers/mass-2015.pdf},\n  url_link       = {http://dx.doi.org/10.1109/MASS.2015.15},\n  doi       = {10.1109/MASS.2015.15},\n  timestamp = {Fri, 06 May 2016 13:36:43 +0200},\n  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/mass/ZhengJPC15},\n  bibsource = {dblp computer science bibliography, http://dblp.org},\n  show = {},\n  keywords = {wcet, timed automata},\n\n  abstract={Cyber-Physical Systems (CPS) have gained wide popularity, however, developing and debugging CPS remain significant challenges. Many bugs are detectable only at runtime under deployment conditions that may be unpredictable or at least unexpected at development time. The current state of the practice of debugging CPS is generally ad hoc, involving trial and error in a real deployment. For increased rigor, it is appealing to bring formal methods to CPS verification. However developers often eschew formal approaches due to complexity and lack of efficiency. This paper presents Brace Assertion, a specification framework based on natural language queries that are automatically converted to a determinitic class of timed automata used for runtime monitoring. To reduce runtime overhead and support properties that reference predicate logic, we use a second monitor automaton to create filtered traces on which to run the analysis using the specification monitor. We evaluate the Brace Assertion framework using a real CPS case study and show that the framework is able to minimize runtime overhead with an increasing number of monitors.},\n  Type = {B - International Conferences},\n\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Cyber-Physical Systems (CPS) have gained wide popularity, however, developing and debugging CPS remain significant challenges. Many bugs are detectable only at runtime under deployment conditions that may be unpredictable or at least unexpected at development time. The current state of the practice of debugging CPS is generally ad hoc, involving trial and error in a real deployment. For increased rigor, it is appealing to bring formal methods to CPS verification. However developers often eschew formal approaches due to complexity and lack of efficiency. This paper presents Brace Assertion, a specification framework based on natural language queries that are automatically converted to a determinitic class of timed automata used for runtime monitoring. To reduce runtime overhead and support properties that reference predicate logic, we use a second monitor automaton to create filtered traces on which to run the analysis using the specification monitor. We evaluate the Brace Assertion framework using a real CPS case study and show that the framework is able to minimize runtime overhead with an increasing number of monitors.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-dealedomarugn-timedautomataformodellingcachesandpipelines-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/slides-mars-2015.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-dealedomarugn-timedautomataformodellingcachesandpipelines-2015', 'https://franck44.github.io/publications/papers/slides-mars-2015.pdf', event);\">\n    Timed Automata for Modelling Caches and Pipelines.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and de Aledo Marugán, P. G.\n</span>\n\n  \n\n</span>\n\n  In van Glabbeek, R. J.; Groote, J. F.;  and Höfner, P., editor(s), <i>Proceedings Workshop on Models for Formal Analysis of Real Systems, MARS 2015, Suva, Fiji, November 23, 2015.</i>, volume 196, of <i>EPTCS</i>, pages 37–45,  2015. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://dx.doi.org/10.4204/EPTCS.196.4\"\n     onclick=\"log_download('cassez-dealedomarugn-timedautomataformodellingcachesandpipelines-2015', 'http://dx.doi.org/10.4204/EPTCS.196.4', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Timed Automata for Modelling Caches and Pipelines [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n  <a href=\"https://franck44.github.io/publications/papers/slides-mars-2015.pdf\"\n     onclick=\"log_download('cassez-dealedomarugn-timedautomataformodellingcachesandpipelines-2015', 'https://franck44.github.io/publications/papers/slides-mars-2015.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Timed Automata for Modelling Caches and Pipelines [pdf]\"\n       title=\"Slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Slides</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.4204/EPTCS.196.4\"\n     onclick=\"log_download('cassez-dealedomarugn-timedautomataformodellingcachesandpipelines-2015', 'http://doi.org/10.4204/EPTCS.196.4', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-dealedomarugn-timedautomataformodellingcachesandpipelines-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-dealedomarugn-timedautomataformodellingcachesandpipelines-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{cassez-mars-2015,\n  author    = {Franck Cassez and\n               Pablo Gonz{\\&#x27;{a}}lez de Aledo Marug{\\&#x27;{a}}n},\n  title     = {Timed Automata for Modelling Caches and Pipelines},\n  booktitle = {Proceedings Workshop on Models for Formal Analysis of Real Systems,\n               {MARS} 2015, Suva, Fiji, November 23, 2015.},\n  pages     = {37--45},\n  year      = {2015},\n   editor    = {Rob J. van Glabbeek and\n               Jan Friso Groote and\n               Peter H{\\&quot;{o}}fner},\n                series    = {{EPTCS}},\n  volume    = {196},\n  year      = {2015},\n  url_link       = {http://dx.doi.org/10.4204/EPTCS.196.4},\n    urlslides = {papers/slides-mars-2015.pdf},\n  doi       = {10.4204/EPTCS.196.4},\n  category= {wcet},\n  mywebpage = {wcet},\n  show = {},\n  keywords = {wcet, timed automata},\n  abstract = {\n  In this paper, we focus on modelling the timing aspects of binary programs running on architectures featuring caches and pipelines. The objective is to obtain a timed automaton model to compute tight bounds for the worst-case execution time (WCET) of the programs using model-checking techniques.\n  },\n  Type = {B - International Conferences},\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper, we focus on modelling the timing aspects of binary programs running on architectures featuring caches and pipelines. The objective is to obtain a timed automaton model to compute tight bounds for the worst-case execution time (WCET) of the programs using model-checking techniques. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-ziegler-verificationofconcurrentprogramsusingtraceabstractionrefinement-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/lpar-2015.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-ziegler-verificationofconcurrentprogramsusingtraceabstractionrefinement-2015', 'https://franck44.github.io/publications/papers/lpar-2015.pdf', event);\">\n    Verification of Concurrent Programs Using Trace Abstraction Refinement.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Ziegler, F.\n</span>\n\n  \n\n</span>\n\n  In Davis, M.; Fehnker, A.; McIver, A.;  and Voronkov, A., editor(s), <i>Logic for Programming, Artificial Intelligence, and Reasoning - 20th International Conference, LPAR-20 2015, Suva, Fiji, November 24-28, 2015, Proceedings</i>, volume 9450, of <i>Lecture Notes in Computer Science</i>, pages 233–248,  2015. Springer\n  <span class=\"note\">LPAR FMICS paper award</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/lpar-2015.pdf\"\n     onclick=\"log_download('cassez-ziegler-verificationofconcurrentprogramsusingtraceabstractionrefinement-2015', 'https://franck44.github.io/publications/papers/lpar-2015.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Verification of Concurrent Programs Using Trace Abstraction Refinement [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://franck44.github.io/publications/papers/slides-lpar-2015.pdf\"\n     onclick=\"log_download('cassez-ziegler-verificationofconcurrentprogramsusingtraceabstractionrefinement-2015', 'https://franck44.github.io/publications/papers/slides-lpar-2015.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Verification of Concurrent Programs Using Trace Abstraction Refinement [pdf]\"\n       title=\"Slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Slides</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-662-48899-7_17\"\n     onclick=\"log_download('cassez-ziegler-verificationofconcurrentprogramsusingtraceabstractionrefinement-2015', 'http://doi.org/10.1007/978-3-662-48899-7_17', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-ziegler-verificationofconcurrentprogramsusingtraceabstractionrefinement-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-ziegler-verificationofconcurrentprogramsusingtraceabstractionrefinement-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{cassez-lpar-2015,\n  author    = {Franck Cassez and\n               Frowin Ziegler},\n                editor    = {Martin Davis and\n               Ansgar Fehnker and\n               Annabelle McIver and\n               Andrei Voronkov},\n  title     = {Verification of Concurrent Programs Using Trace Abstraction Refinement},\n  booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning - 20th\n               International Conference, {LPAR-20} 2015, Suva, Fiji, November 24-28,\n               2015, Proceedings},\n  pages     = {233--248},\n  year      = {2015},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {9450},\n  publisher = {Springer},\n  year      = {2015},\n  url       = {http://dx.doi.org/10.1007/978-3-662-48899-7_17},\n  mywebpage = {soft-verif},\n  category = {soft-verif},\n  isbn      = {978-3-662-48898-0},\n  doi       = {10.1007/978-3-662-48899-7_17},\n  show = {},\n  note = {LPAR FMICS  paper award},\n  urlpaper = {papers/lpar-2015.pdf},\n    urlslides = {papers/slides-lpar-2015.pdf},\n  abstract = {Verifying concurrent programs is notoriously hard due to the state explosion problem: (1) the data state space can be very large as the variables can range over very large sets, and (2) the control state space is the Cartesian product of the control state space of the concurrent com- ponents and thus grows exponentially in the number of components. On the one hand, the most successful approaches to address the control state explosion problem are based on assume-guarantee reasoning or model-checking coupled with partial order reduction. On the other hand, the most successful techniques to address the data space explosion problem for sequential programs verification are based on the abstraction/refine- ment paradigm which consists in refining an abstract over-approximation of a program via predicate refinement. In this paper, we show that we can combine partial order reduction techniques with trace abstraction refinement. We apply our approach to standard benchmarks and show that it matches current state-of-the-art analysis techniques.},\n  Type = {B - International Conferences},\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Verifying concurrent programs is notoriously hard due to the state explosion problem: (1) the data state space can be very large as the variables can range over very large sets, and (2) the control state space is the Cartesian product of the control state space of the concurrent com- ponents and thus grows exponentially in the number of components. On the one hand, the most successful approaches to address the control state explosion problem are based on assume-guarantee reasoning or model-checking coupled with partial order reduction. On the other hand, the most successful techniques to address the data space explosion problem for sequential programs verification are based on the abstraction/refine- ment paradigm which consists in refining an abstract over-approximation of a program via predicate refinement. In this paper, we show that we can combine partial order reduction techniques with trace abstraction refinement. We apply our approach to standard benchmarks and show that it matches current state-of-the-art analysis techniques.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-matsuoka-pierzchalski-smyth-perentiemodulartracerefinementandselectivevaluetrackingcompetitioncontribution-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/sv-comp-2015.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-matsuoka-pierzchalski-smyth-perentiemodulartracerefinementandselectivevaluetrackingcompetitioncontribution-2015', 'https://franck44.github.io/publications/papers/sv-comp-2015.pdf', event);\">\n    Perentie: Modular Trace Refinement and Selective Value Tracking - (Competition Contribution).\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Matsuoka, T.; Pierzchalski, E.;  and Smyth, N.\n</span>\n\n  \n\n</span>\n\n  In <i>Tools and Algorithms for the Construction and Analysis of Systems - 21st International Conference, TACAS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015. Proceedings</i>, volume 9035, of <i>lncs</i>, pages 439–442,  2015. springv\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/sv-comp-2015.pdf\"\n     onclick=\"log_download('cassez-matsuoka-pierzchalski-smyth-perentiemodulartracerefinementandselectivevaluetrackingcompetitioncontribution-2015', 'https://franck44.github.io/publications/papers/sv-comp-2015.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Perentie: Modular Trace Refinement and Selective Value Tracking - (Competition Contribution) [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-662-46681-0_39\"\n     onclick=\"log_download('cassez-matsuoka-pierzchalski-smyth-perentiemodulartracerefinementandselectivevaluetrackingcompetitioncontribution-2015', 'http://doi.org/10.1007/978-3-662-46681-0_39', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-matsuoka-pierzchalski-smyth-perentiemodulartracerefinementandselectivevaluetrackingcompetitioncontribution-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-matsuoka-pierzchalski-smyth-perentiemodulartracerefinementandselectivevaluetrackingcompetitioncontribution-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{tacas-15,\nauthor    = {Franck Cassez and\n               Takashi Matsuoka and\n               Edward Pierzchalski and\n               Nathan Smyth},\n  title     = {Perentie: Modular Trace Refinement and Selective Value Tracking -\n               (Competition Contribution)},\n  booktitle = {Tools and Algorithms for the Construction and Analysis of Systems\n               - 21st International Conference, {TACAS} 2015, Held as Part of the\n               European Joint Conferences on Theory and Practice of Software, {ETAPS}\n               2015, London, UK, April 11-18, 2015. Proceedings},\n  pages     = {439--442},\n  year      = {2015},\n  url       = {http://dx.doi.org/10.1007/978-3-662-46681-0_39},\n  doi       = {10.1007/978-3-662-46681-0_39},\n  publisher = springv,\n  volume = 9035,\n  series    = lncs,\n  mywebpage = {soft-verif},\n  keywords = {refinement, software verification},\n  category = {soft-verif},\n  show = {},\n  urlpaper = {papers/sv-comp-2015.pdf},\n  abstract = {Perentie is a software analysis tool based on iterative refinement of trace abstraction:\n  if the refinement process terminates, the program is either declared correct or a counterexample is\n  provided and the program is incorrect.},\n    Type = {B - International Conferences},\n\n}\n\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n%%% 2014\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Perentie is a software analysis tool based on iterative refinement of trace abstraction: if the refinement process terminates, the program is either declared correct or a counterexample is provided and the program is incorrect.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"benattar-cassez-lime-roux-controlandsynthesisofnoninterferenttimedsystems-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/ijc-2014.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'benattar-cassez-lime-roux-controlandsynthesisofnoninterferenttimedsystems-2015', 'https://franck44.github.io/publications/papers/ijc-2014.pdf', event);\">\n    Control and Synthesis of Non-Interferent Timed Systems.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Benattar, G.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Lime, D.;  and Roux, O. H.\n</span>\n\n  \n\n</span>\n\n  <i>International Journal of Control</i>, 88(2): 217–236.  2015.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/ijc-2014.pdf\"\n     onclick=\"log_download('benattar-cassez-lime-roux-controlandsynthesisofnoninterferenttimedsystems-2015', 'https://franck44.github.io/publications/papers/ijc-2014.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Control and Synthesis of Non-Interferent Timed Systems [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"http://www.tandfonline.com/eprint/h7nIKxnegMGR5M7EaeSF/full\"\n     onclick=\"log_download('benattar-cassez-lime-roux-controlandsynthesisofnoninterferenttimedsystems-2015', 'http://www.tandfonline.com/eprint/h7nIKxnegMGR5M7EaeSF/full', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Control and Synthesis of Non-Interferent Timed Systems [link]\"\n       title=\"Link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1080/00207179.2014.944356\"\n     onclick=\"log_download('benattar-cassez-lime-roux-controlandsynthesisofnoninterferenttimedsystems-2015', 'http://doi.org/10.1080/00207179.2014.944356', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/benattar-cassez-lime-roux-controlandsynthesisofnoninterferenttimedsystems-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('benattar-cassez-lime-roux-controlandsynthesisofnoninterferenttimedsystems-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{ijc-14,\nauthor = {Benattar, Gilles and Franck Cassez and Lime, Didier\nand Roux, Olivier H.},\ntitle = {Control and Synthesis of Non-Interferent Timed\nSystems},\nType = {A - Journal},\njournal = {International Journal of Control}, \nvolume = {88}, \nnumber =\n{2},\npages = {217--236},\nyear = {2015},\ndoi = {10.1080/00207179.2014.944356},\nmywebpage = {timed},\nurlpaper = {papers/ijc-2014.pdf},\nee = {http://www.tandfonline.com/eprint/h7nIKxnegMGR5M7EaeSF/full},\nkeywords = {security, non-interference},\ncategory = {Non-interference},\nabstract = {We focus on the control and the\nsynthesis of secure timed systems which are modelled as timed automata. The\nsecurity property that the system must satisfy is a non-interference property.\nIntuitively, non-interference ensures the absence of any causal dependency from\na high-level domain to a lower level domain. Various notions of non-interference\nhave been defined in the literature, and in this paper, we focus on strong non-\ndeterministic non-interference (SNNI) and two (bi)simulation-based variants\nthereof (cosimulation-based SNNI and bisimulation-based SNNI). These properties\nand their extensions have been mostly studied in the context of discrete event\nsystems, while it is now well-known that time is an important attack vector\nagainst secure systems. At the same time, there is an obvious interest in going\nbeyond simple verification to control problems: to be able to automatically make\nsystems secure. We consider non-interference properties in the challenging\nsetting of control of dense-time systems specified by timed automata and we\nstudy the two following problems: (1) check whether it is possible to find a\nsub-system so that it is non- interferent; if yes, (2) compute a (largest) sub-\nsystem which is non- interferent. We exhibit decidable sub-classes for these\nproblems, assess their theoretical complexities and provide effective algorithms\nbased on the classical framework of timed games.}\n}\n\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We focus on the control and the synthesis of secure timed systems which are modelled as timed automata. The security property that the system must satisfy is a non-interference property. Intuitively, non-interference ensures the absence of any causal dependency from a high-level domain to a lower level domain. Various notions of non-interference have been defined in the literature, and in this paper, we focus on strong non- deterministic non-interference (SNNI) and two (bi)simulation-based variants thereof (cosimulation-based SNNI and bisimulation-based SNNI). These properties and their extensions have been mostly studied in the context of discrete event systems, while it is now well-known that time is an important attack vector against secure systems. At the same time, there is an obvious interest in going beyond simple verification to control problems: to be able to automatically make systems secure. We consider non-interference properties in the challenging setting of control of dense-time systems specified by timed automata and we study the two following problems: (1) check whether it is possible to find a sub-system so that it is non- interferent; if yes, (2) compute a (largest) sub- system which is non- interferent. We exhibit decidable sub-classes for these problems, assess their theoretical complexities and provide effective algorithms based on the classical framework of timed games.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2014\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2014')\"\n      onkeypress=\"toggleGroup('group_2014')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2014</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"cassez-raskin-automatedtechnologyforverificationandanalysis12thinternationalsymposiumatva2014sydneynswaustralianovember372014proceedings-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://dx.doi.org/10.1007/978-3-319-11936-6\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-raskin-automatedtechnologyforverificationandanalysis12thinternationalsymposiumatva2014sydneynswaustralianovember372014proceedings-2014', 'http://dx.doi.org/10.1007/978-3-319-11936-6', event);\">\n    Automated Technology for Verification and Analysis - 12th International Symposium, ATVA 2014, Sydney, NSW, Australia, November 3-7, 2014, Proceedings.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Raskin, J.,\n  editors.\n  \n</span>\n\n  \n\n</span>\n\n  Volume 8837, of lncs.springv.  2014.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://dx.doi.org/10.1007/978-3-319-11936-6\"\n     onclick=\"log_download('cassez-raskin-automatedtechnologyforverificationandanalysis12thinternationalsymposiumatva2014sydneynswaustralianovember372014proceedings-2014', 'http://dx.doi.org/10.1007/978-3-319-11936-6', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Automated Technology for Verification and Analysis - 12th International Symposium, ATVA 2014, Sydney, NSW, Australia, November 3-7, 2014, Proceedings [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-319-11936-6\"\n     onclick=\"log_download('cassez-raskin-automatedtechnologyforverificationandanalysis12thinternationalsymposiumatva2014sydneynswaustralianovember372014proceedings-2014', 'http://doi.org/10.1007/978-3-319-11936-6', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-raskin-automatedtechnologyforverificationandanalysis12thinternationalsymposiumatva2014sydneynswaustralianovember372014proceedings-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-raskin-automatedtechnologyforverificationandanalysis12thinternationalsymposiumatva2014sydneynswaustralianovember372014proceedings-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@proceedings{atva-14,\n  editor    = {Franck Cassez and\n               Jean-François Raskin},\n  title     = {Automated Technology for Verification and Analysis - 12th International\n               Symposium, {ATVA} 2014, Sydney, NSW, Australia, November 3-7, 2014,\n               Proceedings},\n  series    = lncs,\n  volume    = {8837},\n  publisher = springv,\n  year      = {2014},\n  url       = {http://dx.doi.org/10.1007/978-3-319-11936-6},\n  doi       = {10.1007/978-3-319-11936-6},\n  show = {},\n  category = {Proceedings (Editor)},\n  isbn      = {978-3-319-11935-9},\n  Type = {D - Conference Proceedings},\n}\n\n\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-mller-burnett-summarybasedinterproceduralanalysisviamodulartracerefinement-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2014.545\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-mller-burnett-summarybasedinterproceduralanalysisviamodulartracerefinement-2014', 'http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2014.545', event);\">\n    Summary-Based Inter-Procedural Analysis via Modular Trace Refinement.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Müller, C.;  and Burnett, K.\n</span>\n\n  \n\n</span>\n\n  In <i>34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, December 15-17, 2014, New Delhi, India</i>, pages 545–556,  2014. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2014.545\"\n     onclick=\"log_download('cassez-mller-burnett-summarybasedinterproceduralanalysisviamodulartracerefinement-2014', 'http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2014.545', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Summary-Based Inter-Procedural Analysis via Modular Trace Refinement [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.4230/LIPIcs.FSTTCS.2014.545\"\n     onclick=\"log_download('cassez-mller-burnett-summarybasedinterproceduralanalysisviamodulartracerefinement-2014', 'http://doi.org/10.4230/LIPIcs.FSTTCS.2014.545', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-mller-burnett-summarybasedinterproceduralanalysisviamodulartracerefinement-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-mller-burnett-summarybasedinterproceduralanalysisviamodulartracerefinement-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{fsttcs-14,\n  author    = {Franck Cassez and\n               Christian Müller and\n               Karla Burnett},\n  title     = {Summary-Based Inter-Procedural Analysis via Modular Trace Refinement},\n  booktitle = {34th International Conference on Foundation of Software Technology\n               and Theoretical Computer Science, {FSTTCS} 2014, December 15-17, 2014,\n               New Delhi, India},\n  pages     = {545--556},\n  year      = {2014},\n  mywebpage = {soft-verif},\n  category = {Software verification},\n  keywords = {trace refinement, software verification, Hoare logic},\n  url_link       = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2014.545},\n  doi       = {10.4230/LIPIcs.FSTTCS.2014.545},\n  abstract = {We propose a generalisation of trace refinement for the verification of inter-procedural programs.\n  Our method is a top-down modular, summary-based approach, and analyses inter-procedural programs by building function summaries on-demand\n  and improving the summaries each time a function is analysed. Our method is sound, and complete relative to the existence of a\n  modular Hoare proof for a non-recursive program. We have implemented a prototype analyser that demonstrates the\n  main features of our approach and yields promising results.\n  },\n  Type = {B - International Conferences},\n}\n\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We propose a generalisation of trace refinement for the verification of inter-procedural programs. Our method is a top-down modular, summary-based approach, and analyses inter-procedural programs by building function summaries on-demand and improving the summaries each time a function is analysed. Our method is sound, and complete relative to the existence of a modular Hoare proof for a non-recursive program. We have implemented a prototype analyser that demonstrates the main features of our approach and yields promising results. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"brenguier-cassez-raskin-energyandmeanpayofftimedgames-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/hscc-2014.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'brenguier-cassez-raskin-energyandmeanpayofftimedgames-2014', 'https://franck44.github.io/publications/papers/hscc-2014.pdf', event);\">\n    Energy and mean-payoff timed games.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Brenguier, R.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Raskin, J.\n</span>\n\n  \n\n</span>\n\n  In <i>17th International Conference on Hybrid Systems: Computation and Control, HSCC'14</i>, pages 283-292,  2014. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/hscc-2014.pdf\"\n     onclick=\"log_download('brenguier-cassez-raskin-energyandmeanpayofftimedgames-2014', 'https://franck44.github.io/publications/papers/hscc-2014.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Energy and mean-payoff timed games [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"http://doi.acm.org/10.1145/2562059.2562116\"\n     onclick=\"log_download('brenguier-cassez-raskin-energyandmeanpayofftimedgames-2014', 'http://doi.acm.org/10.1145/2562059.2562116', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Energy and mean-payoff timed games [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/brenguier-cassez-raskin-energyandmeanpayofftimedgames-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('brenguier-cassez-raskin-energyandmeanpayofftimedgames-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{hscc-14,\n  author    = {Romain Brenguier and\n               Franck Cassez and\n               Jean-François Raskin},\n  title     = {Energy and mean-payoff timed games},\n  booktitle = {17th International Conference on Hybrid Systems: Computation\n               and Control, HSCC&#x27;14},\n  year      = {2014},\n  pages     = {283-292},\n  urlpaper = {papers/hscc-2014.pdf},\n  url_link     = {http://doi.acm.org/10.1145/2562059.2562116},\n  mywebpage = {timed},\n  show = {},\n  keywords = {hybrid, timed automata, games},\n  abstract = {In this paper, we study energy and mean-payoff timed games.\n  The decision problems that consist in determining the existence of winning strategies in those games are undecidable,\n  and we thus provide semi-algorithms for solving these strategy synthesis problems.\n  We then identify a large class of timed games for which our semi-algorithms terminate and are thus complete.\n  We also study in detail the relation between mean-payoff and energy timed games. Finally,\n  we provide a symbolic algorithm to solve energy timed games and demonstrate its use on small examples using HyTech.},\n  Type = {B - International Conferences},\n\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper, we study energy and mean-payoff timed games. The decision problems that consist in determining the existence of winning strategies in those games are undecidable, and we thus provide semi-algorithms for solving these strategy synthesis problems. We then identify a large class of timed games for which our semi-algorithms terminate and are thus complete. We also study in detail the relation between mean-payoff and energy timed games. Finally, we provide a symbolic algorithm to solve energy timed games and demonstrate its use on small examples using HyTech.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-vandermeyden-zhang-thecomplexityofsynchronousnotionsofinformationflowsecurity-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://arxiv.org/abs/1402.0601\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-vandermeyden-zhang-thecomplexityofsynchronousnotionsofinformationflowsecurity-2014', 'http://arxiv.org/abs/1402.0601', event);\">\n    The Complexity of Synchronous Notions of Information Flow Security.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; van der Meyden, R.;  and Zhang, C.\n</span>\n\n  \n\n</span>\n\n  <i>CoRR</i>, abs/1402.0601.  2014.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://arxiv.org/abs/1402.0601\"\n     onclick=\"log_download('cassez-vandermeyden-zhang-thecomplexityofsynchronousnotionsofinformationflowsecurity-2014', 'http://arxiv.org/abs/1402.0601', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"The Complexity of Synchronous Notions of Information Flow Security [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-vandermeyden-zhang-thecomplexityofsynchronousnotionsofinformationflowsecurity-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-vandermeyden-zhang-thecomplexityofsynchronousnotionsofinformationflowsecurity-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/corr/CassezMZ14,\n  author    = {Franck Cassez and\n               Ron van der Meyden and\n               Chenyi Zhang},\n  title     = {The Complexity of Synchronous Notions of Information Flow Security},\n  journal   = {CoRR},\n  Type = {E - Reports},\n  volume    = {abs/1402.0601},\n  year      = {2014},\n  url       = {http://arxiv.org/abs/1402.0601},\n  timestamp = {Wed, 05 Mar 2014 14:43:44 +0100},\n  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/CassezMZ14},\n  bibsource = {dblp computer science bibliography, http://dblp.org},\n  keywords = {security, non-interference, complexity},\n  show = {},\n  category = {Non-interference},\n  abstract = {The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one in which agents operate synchronously with awareness of the global clock. This enables timing based attacks to be captured, whereas previous work on this topic has dealt primarily with asynchronous systems. Versions of the notions of nondeducibility on inputs, nondeducibility on strategies, and an unwinding based notion are formulated for this model. All three notions are shown to be decidable, and their computational complexity is characterised.\n  }\n}\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n%%% 2013\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one in which agents operate synchronously with awareness of the global clock. This enables timing based attacks to be captured, whereas previous work on this topic has dealt primarily with asynchronous systems. Versions of the notions of nondeducibility on inputs, nondeducibility on strategies, and an unwinding based notion are formulated for this model. All three notions are shown to be decidable, and their computational complexity is characterised. \n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2013\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2013')\"\n      onkeypress=\"toggleGroup('group_2013')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2013</span>\n      <span class=\"bibbase_group_count\">\n        \n        (7)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"cassez-markey-communicatingembeddedsystems-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://onlinelibrary.wiley.com/book/10.1002/9781118558188\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-markey-communicatingembeddedsystems-2013', 'http://onlinelibrary.wiley.com/book/10.1002/9781118558188', event);\">\n    Communicating Embedded Systems.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Markey, N.\n</span>\n\n  \n\n</span>\n\n  Communicating Embedded Systems, pages 67–105. Jard, C.;  and Roux, O. H., editor(s). ISTE Ltd. – John Wiley &amp; Sons, Ltd, February 2013.\n  <span class=\"note\">New edition, 2013</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://onlinelibrary.wiley.com/book/10.1002/9781118558188\"\n     onclick=\"log_download('cassez-markey-communicatingembeddedsystems-2013', 'http://onlinelibrary.wiley.com/book/10.1002/9781118558188', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Communicating Embedded Systems [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1002/9781118558188\"\n     onclick=\"log_download('cassez-markey-communicatingembeddedsystems-2013', 'http://doi.org/10.1002/9781118558188', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-markey-communicatingembeddedsystems-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-markey-communicatingembeddedsystems-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inbook{cassez-control-iste-2013,\n   author = {Franck Cassez and Markey, Nicolas},\n   title = {Communicating Embedded Systems},\n   editor = {Jard, Claude and Roux, Olivier H.},\n   month = feb,\n   pages = {67--105},\n   publisher = {ISTE Ltd. -- John Wiley \\&amp;amp; Sons, Ltd},\n   chapter = {Control of Timed Systems},\n  url = {http://onlinelibrary.wiley.com/book/10.1002/9781118558188},\n   year = {2013},\n   note = {New edition, 2013},\n   doi = {10.1002/9781118558188},\n   isbn = {9781848211438},\n   keywords = {control, timed automata},\n  mywbepage = {timed},\nabstract={In this book Chapter we address the problem of controller synthesis for timed systems. By\ntimed systems we refer to systems which are subject to quantitative (hard) real-time\nconstraints. We assume the reader is familiar with the basics of Timed Automata\ntheory, or has read Chapter 1 and Chapter 2 in this book. },\n  Type = {C - Book Chapters},\n\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this book Chapter we address the problem of controller synthesis for timed systems. By timed systems we refer to systems which are subject to quantitative (hard) real-time constraints. We assume the reader is familiar with the basics of Timed Automata theory, or has read Chapter 1 and Chapter 2 in this book. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-tripakis-communicatingembeddedsystems-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://onlinelibrary.wiley.com/book/10.1002/9781118558188\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-tripakis-communicatingembeddedsystems-2013', 'http://onlinelibrary.wiley.com/book/10.1002/9781118558188', event);\">\n    Communicating Embedded Systems.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Tripakis, S.\n</span>\n\n  \n\n</span>\n\n  Communicating Embedded Systems, pages 107–138. Jard, C.;  and Roux, O. H., editor(s). ISTE Ltd. – John Wiley &amp; Sons, Ltd, February 2013.\n  <span class=\"note\">New edition, 2013</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://onlinelibrary.wiley.com/book/10.1002/9781118558188\"\n     onclick=\"log_download('cassez-tripakis-communicatingembeddedsystems-2013', 'http://onlinelibrary.wiley.com/book/10.1002/9781118558188', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Communicating Embedded Systems [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1002/9781118558188\"\n     onclick=\"log_download('cassez-tripakis-communicatingembeddedsystems-2013', 'http://doi.org/10.1002/9781118558188', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-tripakis-communicatingembeddedsystems-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-tripakis-communicatingembeddedsystems-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inbook{cassez-diag-iste-2013,\n   author = {Franck Cassez and Tripakis, Stavros},\n   title = {Communicating Embedded Systems},\n   editor = {Jard, Claude and Roux, Olivier H.},\n   month = feb,\n   pages = {107--138},\n   publisher = {ISTE Ltd. -- John Wiley \\&amp;amp; Sons, Ltd},\n   chapter = {Fault Diagnosis of Timed Systems},\n   keywords = {diagnosis, timed automata},\n  mywbepage = {timed},\n  url = {http://onlinelibrary.wiley.com/book/10.1002/9781118558188},\n   year = {2013},\n      note = {New edition, 2013},\n    doi = {10.1002/9781118558188},\n   isbn = {9781848211438},\nabstract={In this book Chapter, we review the main results pertaining\n                  to the problem of fault diagnosis of timed\n                  automata. Timed automata are introduced in Chapter 1\n                  and Chapter 2 in this book, and the reader not\n                  familiar with this model is invited to read them\n                  first.},\n                    Type = {C - Book Chapters},\n\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this book Chapter, we review the main results pertaining to the problem of fault diagnosis of timed automata. Timed automata are introduced in Chapter 1 and Chapter 2 in this book, and the reader not familiar with this model is invited to read them first.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-grastien-predictabilityofeventoccurrencesintimedsystems-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/formats-2013.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-grastien-predictabilityofeventoccurrencesintimedsystems-2013', 'https://franck44.github.io/publications/papers/formats-2013.pdf', event);\">\n    Predictability of Event Occurrences in Timed Systems.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Grastien, A.\n</span>\n\n  \n\n</span>\n\n  In <i>Formal Modeling and Analysis of Timed Systems - 11th International Conference, FORMATS 2013, Buenos Aires, Argentina, August 29-31, 2013. Proceedings</i>, volume 8053, of <i>Lecture Notes in Computer Science</i>, pages 62–76,  2013. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/formats-2013.pdf\"\n     onclick=\"log_download('cassez-grastien-predictabilityofeventoccurrencesintimedsystems-2013', 'https://franck44.github.io/publications/papers/formats-2013.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Predictability of Event Occurrences in Timed Systems [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://franck44.github.io/publications/papers/slides-formats-2013.pdf\"\n     onclick=\"log_download('cassez-grastien-predictabilityofeventoccurrencesintimedsystems-2013', 'https://franck44.github.io/publications/papers/slides-formats-2013.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Predictability of Event Occurrences in Timed Systems [pdf]\"\n       title=\"Slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Slides</span></a>\n  &nbsp;\n  \n  <a href=\"http://dx.doi.org/10.1007/978-3-642-40229-6_5\"\n     onclick=\"log_download('cassez-grastien-predictabilityofeventoccurrencesintimedsystems-2013', 'http://dx.doi.org/10.1007/978-3-642-40229-6_5', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Predictability of Event Occurrences in Timed Systems [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-642-40229-6_5\"\n     onclick=\"log_download('cassez-grastien-predictabilityofeventoccurrencesintimedsystems-2013', 'http://doi.org/10.1007/978-3-642-40229-6_5', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-grastien-predictabilityofeventoccurrencesintimedsystems-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-grastien-predictabilityofeventoccurrencesintimedsystems-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{cassez-formats-2013,\n  author    = {Franck Cassez and\n               Alban Grastien},\n  title     = {Predictability of Event Occurrences in Timed Systems},\n  booktitle = {Formal Modeling and Analysis of Timed Systems - 11th International\n               Conference, {FORMATS} 2013, Buenos Aires, Argentina, August 29-31,\n               2013. Proceedings},\n  pages     = {62--76},\n  year      = {2013},\n  urlpaper = {papers/formats-2013.pdf},\n  urlslides = {papers/slides-formats-2013.pdf},\n   url_link       = {http://dx.doi.org/10.1007/978-3-642-40229-6_5},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {8053},\n  publisher = {Springer},\n  doi       = {10.1007/978-3-642-40229-6_5},\n  show = {},\n  keywords = {predictability, diagnosis, timed automata},\n  mywbepage = {timed},\n  category = {Fault diagnosis},\n  abstract = {\n    We address the problem of predicting events&#x27; occurrences in partially observable timed systems modelled by timed automata. Our contribution is many-fold: 1) we give a definition of bounded predictability, namely k-predictability, that takes into account the minimum delay between the prediction and the actual event&#x27;s occurrence; 2) we show that 0-predictability is equivalent to the original notion of predictability of S. Genc and S. Lafortune; 3) we provide a necessary and sufficient condition for k-predictability (which is very similar to k-diagnosability) and give a simple algorithm to check k-predictability; 4) we address the problem of predictability of events&#x27; occurrences in timed automata and show that the problem is PSPACE-complete.\n  },\n   Type = {B - International Conferences},\n\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We address the problem of predicting events' occurrences in partially observable timed systems modelled by timed automata. Our contribution is many-fold: 1) we give a definition of bounded predictability, namely k-predictability, that takes into account the minimum delay between the prediction and the actual event's occurrence; 2) we show that 0-predictability is equivalent to the original notion of predictability of S. Genc and S. Lafortune; 3) we provide a necessary and sufficient condition for k-predictability (which is very similar to k-diagnosability) and give a simple algorithm to check k-predictability; 4) we address the problem of predictability of events' occurrences in timed automata and show that the problem is PSPACE-complete. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"biallas-olesen-cassez-huuck-ptrtrackerpragmaticpointeranalysis-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/scam-2013.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'biallas-olesen-cassez-huuck-ptrtrackerpragmaticpointeranalysis-2013', 'https://franck44.github.io/publications/papers/scam-2013.pdf', event);\">\n    PtrTracker: Pragmatic pointer analysis.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Biallas, S.; Olesen, M. C.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Huuck, R.\n</span>\n\n  \n\n</span>\n\n  In <i>13th IEEE International Working Conference on Source Code Analysis and Manipulation, SCAM 2013, Eindhoven, Netherlands, September 22-23, 2013</i>, pages 69–73,  2013. IEEE Computer Society\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/scam-2013.pdf\"\n     onclick=\"log_download('biallas-olesen-cassez-huuck-ptrtrackerpragmaticpointeranalysis-2013', 'https://franck44.github.io/publications/papers/scam-2013.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"PtrTracker: Pragmatic pointer analysis [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"http://dx.doi.org/10.1109/SCAM.2013.6648186\"\n     onclick=\"log_download('biallas-olesen-cassez-huuck-ptrtrackerpragmaticpointeranalysis-2013', 'http://dx.doi.org/10.1109/SCAM.2013.6648186', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"PtrTracker: Pragmatic pointer analysis [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/SCAM.2013.6648186\"\n     onclick=\"log_download('biallas-olesen-cassez-huuck-ptrtrackerpragmaticpointeranalysis-2013', 'http://doi.org/10.1109/SCAM.2013.6648186', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/biallas-olesen-cassez-huuck-ptrtrackerpragmaticpointeranalysis-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('biallas-olesen-cassez-huuck-ptrtrackerpragmaticpointeranalysis-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{scam-2013,\n  author    = {Sebastian Biallas and\n               Mads Chr. Olesen and\n               Franck Cassez and\n               Ralf Huuck},\n  title     = {PtrTracker: Pragmatic pointer analysis},\n  booktitle = {13th {IEEE} International Working Conference on Source Code Analysis\n               and Manipulation, {SCAM} 2013, Eindhoven, Netherlands, September 22-23,\n               2013},\n  pages     = {69--73},\n  year      = {2013},\n  publisher = {{IEEE} Computer Society},\n  urlpaper = {papers/scam-2013.pdf},\n  url_link       = {http://dx.doi.org/10.1109/SCAM.2013.6648186},\n  doi       = {10.1109/SCAM.2013.6648186},\n  keywords = {Software verification, pointers, static analysis},\n  mywebpage = {soft-verif},\n  category = {Software verification},\n  abstract = {\n  Static program analysis for bug detection in industrial C/C++ code has many challenges. One of them is to analyze pointer and pointer structures efficiently. While there has been much research into various aspects of pointer analysis either for compiler optimization or for verification tasks, both classical categories are not optimized for bug detection, where speed and precision are important, but soundness (no missed bugs) and completeness (no false positives) do not necessarily need to be guaranteed.\n  },\n    Type = {B - International Conferences},\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Static program analysis for bug detection in industrial C/C++ code has many challenges. One of them is to analyze pointer and pointer structures efficiently. While there has been much research into various aspects of pointer analysis either for compiler optimization or for verification tasks, both classical categories are not optimized for bug detection, where speed and precision are important, but soundness (no missed bugs) and completeness (no false positives) do not necessarily need to be guaranteed. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-grastien-predictabilityofeventoccurrencesintimedsystems-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://arxiv.org/abs/1306.0662\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-grastien-predictabilityofeventoccurrencesintimedsystems-2013', 'http://arxiv.org/abs/1306.0662', event);\">\n    Predictability of Event Occurrences in Timed Systems.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Grastien, A.\n</span>\n\n  \n\n</span>\n\n  <i>CoRR</i>, abs/1306.0662.  2013.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://arxiv.org/abs/1306.0662\"\n     onclick=\"log_download('cassez-grastien-predictabilityofeventoccurrencesintimedsystems-2013', 'http://arxiv.org/abs/1306.0662', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Predictability of Event Occurrences in Timed Systems [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-grastien-predictabilityofeventoccurrencesintimedsystems-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-grastien-predictabilityofeventoccurrencesintimedsystems-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/corr/CassezG13,\n  author    = {Franck Cassez and\n               Alban Grastien},\n  title     = {Predictability of Event Occurrences in Timed Systems},\n  journal   = {CoRR},\n  Type = {E - Reports},\n  volume    = {abs/1306.0662},\n  year      = {2013},\n  url       = {http://arxiv.org/abs/1306.0662},\n  timestamp = {Mon, 01 Jul 2013 20:31:24 +0200},\n  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/CassezG13},\n  bibsource = {dblp computer science bibliography, http://dblp.org},\n  category = {Fault diagnosis},\n  abstract = {\n  We address the problem of predicting events&#x27; occurrences in partially observable timed systems modelled by timed automata. Our contribution is many-fold: 1) we give a definition of bounded predictability, namely k-predictability, that takes into account the minimum delay between the prediction and the actual event&#x27;s occurrence; 2) we show that 0-predictability is equivalent to the original notion of predictability of S. Genc and S. Lafortune; 3) we provide a necessary and sufficient condition for k-predictability (which is very similar to k-diagnosability) and give a simple algorithm to check k-predictability; 4) we address the problem of predictability of events&#x27; occurrences in timed automata and show that the problem is PSPACE-complete.\n  },\n  mywebpage = {}\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We address the problem of predicting events' occurrences in partially observable timed systems modelled by timed automata. Our contribution is many-fold: 1) we give a definition of bounded predictability, namely k-predictability, that takes into account the minimum delay between the prediction and the actual event's occurrence; 2) we show that 0-predictability is equivalent to the original notion of predictability of S. Genc and S. Lafortune; 3) we provide a necessary and sufficient condition for k-predictability (which is very similar to k-diagnosability) and give a simple algorithm to check k-predictability; 4) we address the problem of predictability of events' occurrences in timed automata and show that the problem is PSPACE-complete. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"brard-cassez-haddad-lime-roux-theexpressivepoweroftimepetrinets-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/tcs-2013.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'brard-cassez-haddad-lime-roux-theexpressivepoweroftimepetrinets-2013', 'https://franck44.github.io/publications/papers/tcs-2013.pdf', event);\">\n    The expressive power of time Petri nets.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bérard, B.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Haddad, S.; Lime, D.;  and Roux, O. H.\n</span>\n\n  \n\n</span>\n\n  <i>Theoretical Computer Science</i>, 474: 1-20.  2013.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/tcs-2013.pdf\"\n     onclick=\"log_download('brard-cassez-haddad-lime-roux-theexpressivepoweroftimepetrinets-2013', 'https://franck44.github.io/publications/papers/tcs-2013.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"The expressive power of time Petri nets [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/http://dx.doi.org/10.1016/j.tcs.2012.12.005\"\n     onclick=\"log_download('brard-cassez-haddad-lime-roux-theexpressivepoweroftimepetrinets-2013', 'http://doi.org/http://dx.doi.org/10.1016/j.tcs.2012.12.005', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/brard-cassez-haddad-lime-roux-theexpressivepoweroftimepetrinets-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('brard-cassez-haddad-lime-roux-theexpressivepoweroftimepetrinets-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{tpn-13,\n  author    = {Béatrice Bérard and\n               Franck Cassez and\n               Serge Haddad and\n               Didier Lime and\n               Olivier H. Roux},\n  title     = {The expressive power of time {Petri} nets},\n  journal   =  {Theoretical Computer Science},\n  Type = {A - Journal},\n  volume    = {474},\n  year      = {2013},\n  pages     = {1-20},\n  doi        = {http://dx.doi.org/10.1016/j.tcs.2012.12.005},\n  bibsource = {DBLP, http://dblp.uni-trier.de},\n  category= {Timed Petri nets},\n  mywebpage = {timed},\n  keywords = {time petri nets, timed automata},\n  urlpaper = {papers/tcs-2013.pdf},\n  abstract = {We investigate expressiveness questions for time Petri nets (TPNs)\n  and some of their most useful extensions. We first introduce generalised time Petri nets (GTPNs)\n  as an abstract model that encompasses variants of TPNs such as self modifications and read, reset and inhibitor arcs.\nWe give a syntactical translation from bounded GTPNs to timed automata (TA)\nthat generates isomorphic transition systems. We prove that the class of bounded GTPNs is strictly l\ness expressive than TA w.r.t. weak timed bisimilarity.\nWe prove that bounded GTPNs, bounded TPNs and TA are equally expressive w.r.t. timed language acceptance.\nFinally, we characterise a syntactical subclass of TA that is equally expressive to bounded GTPNs &quot;á la Merlin&quot; w.r.t.\nweak timed bisimilarity. These results provide a unified comparison of the expressiveness of\nmany variants of timed models often used in practice. It leads to new important results for TPNs.\nAmong them are: 1-safe TPNs and bounded-TPNs are equally expressive; $\\epsilon$-transitions strictly\nincrease the expressive power of TPNs; self modifying nets as well as read,\ninhibitor and reset arcs do not add expressiveness to bounded TPNs.\n}\n}\n\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We investigate expressiveness questions for time Petri nets (TPNs) and some of their most useful extensions. We first introduce generalised time Petri nets (GTPNs) as an abstract model that encompasses variants of TPNs such as self modifications and read, reset and inhibitor arcs. We give a syntactical translation from bounded GTPNs to timed automata (TA) that generates isomorphic transition systems. We prove that the class of bounded GTPNs is strictly l ess expressive than TA w.r.t. weak timed bisimilarity. We prove that bounded GTPNs, bounded TPNs and TA are equally expressive w.r.t. timed language acceptance. Finally, we characterise a syntactical subclass of TA that is equally expressive to bounded GTPNs \"á la Merlin\" w.r.t. weak timed bisimilarity. These results provide a unified comparison of the expressiveness of many variants of timed models often used in practice. It leads to new important results for TPNs. Among them are: 1-safe TPNs and bounded-TPNs are equally expressive; $ε$-transitions strictly increase the expressive power of TPNs; self modifying nets as well as read, inhibitor and reset arcs do not add expressiveness to bounded TPNs. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-bchennec-timinganalysisofbinaryprogramswithuppaal-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/acsd-2013.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-bchennec-timinganalysisofbinaryprogramswithuppaal-2013', 'https://franck44.github.io/publications/papers/acsd-2013.pdf', event);\">\n    Timing Analysis of Binary Programs with UPPAAL.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Béchennec, J.\n</span>\n\n  \n\n</span>\n\n  In <i>13th International Conference on Application of Concurrency to System Design, ACSD 2013</i>, pages 41-50, July 2013. IEEE Computer Society\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/acsd-2013.pdf\"\n     onclick=\"log_download('cassez-bchennec-timinganalysisofbinaryprogramswithuppaal-2013', 'https://franck44.github.io/publications/papers/acsd-2013.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Timing Analysis of Binary Programs with UPPAAL [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://franck44.github.io/publications/papers/slides-acsd-wcet-2013.pdf\"\n     onclick=\"log_download('cassez-bchennec-timinganalysisofbinaryprogramswithuppaal-2013', 'https://franck44.github.io/publications/papers/slides-acsd-wcet-2013.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Timing Analysis of Binary Programs with UPPAAL [pdf]\"\n       title=\"Slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Slides</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/http://dx.doi.org/10.1109/ACSD.2013.7\"\n     onclick=\"log_download('cassez-bchennec-timinganalysisofbinaryprogramswithuppaal-2013', 'http://doi.org/http://dx.doi.org/10.1109/ACSD.2013.7', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-bchennec-timinganalysisofbinaryprogramswithuppaal-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>3 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-bchennec-timinganalysisofbinaryprogramswithuppaal-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{cassez-acsd-13,\n  author    = {Franck Cassez and\n               {Jean-Luc} Béchennec},\n  title     = {Timing Analysis of Binary Programs with {UPPAAL}},\n  booktitle = {13th International Conference on Application of Concurrency\n               to System Design, ACSD 2013},\n  year      = {2013},\n  month = jul,\n  pages     = {41-50},\n    PUBLISHER = {IEEE Computer Society},\n  urlpaper = {papers/acsd-2013.pdf},\n  urlslides = {papers/slides-acsd-wcet-2013.pdf},\n  doi       = {http://dx.doi.org/10.1109/ACSD.2013.7},\n  mywebpage = {wcet},\n  show = {},\n  keywords = {wcet, timed automata},\n  abstract = {\n  We address the problem of computing accurate Worst-Case Execution Time (WCET). We propose a fully automatic and modular methodology based on program slicing and real-time model-checking. We have implemented our methodology and applied it to standard benchmarks. To further validate the approach, we also compare our results to the real execution times of the programs measured on a real board.\n  },\n      Type = {B - International Conferences},\n\n}\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n%%% 2012\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We address the problem of computing accurate Worst-Case Execution Time (WCET). We propose a fully automatic and modular methodology based on program slicing and real-time model-checking. We have implemented our methodology and applied it to standard benchmarks. To further validate the approach, we also compare our results to the real execution times of the programs measured on a real board. \n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2012\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2012')\"\n      onkeypress=\"toggleGroup('group_2012')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2012</span>\n      <span class=\"bibbase_group_count\">\n        \n        (8)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"cassez-huuck-klein-schlich-proceedingsseventhconferenceonsystemssoftwareverificationssv2012sydneyaustralia2830november2012-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://dx.doi.org/10.4204/EPTCS.102\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-huuck-klein-schlich-proceedingsseventhconferenceonsystemssoftwareverificationssv2012sydneyaustralia2830november2012-2012', 'http://dx.doi.org/10.4204/EPTCS.102', event);\">\n    Proceedings Seventh Conference on Systems Software Verification, SSV 2012, Sydney, Australia, 28-30 November 2012.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Huuck, R.; Klein, G.;  and Schlich, B.,\n  editors.\n  \n</span>\n\n  \n\n</span>\n\n  Volume 102, of EPTCS. 2012.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://dx.doi.org/10.4204/EPTCS.102\"\n     onclick=\"log_download('cassez-huuck-klein-schlich-proceedingsseventhconferenceonsystemssoftwareverificationssv2012sydneyaustralia2830november2012-2012', 'http://dx.doi.org/10.4204/EPTCS.102', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Proceedings Seventh Conference on Systems Software Verification, SSV 2012, Sydney, Australia, 28-30 November 2012 [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.4204/EPTCS.102\"\n     onclick=\"log_download('cassez-huuck-klein-schlich-proceedingsseventhconferenceonsystemssoftwareverificationssv2012sydneyaustralia2830november2012-2012', 'http://doi.org/10.4204/EPTCS.102', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-huuck-klein-schlich-proceedingsseventhconferenceonsystemssoftwareverificationssv2012sydneyaustralia2830november2012-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-huuck-klein-schlich-proceedingsseventhconferenceonsystemssoftwareverificationssv2012sydneyaustralia2830november2012-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@proceedings{ssv-12,\n  editor    = {Franck Cassez and\n               Ralf Huuck and\n               Gerwin Klein and\n               Bastian Schlich},\n  title     = {Proceedings Seventh Conference on Systems Software Verification, {SSV}\n               2012, Sydney, Australia, 28-30 November 2012},\n  series    = {{EPTCS}},\n  volume    = {102},\n  year      = {2012},\n  url       = {http://dx.doi.org/10.4204/EPTCS.102},\n  doi       = {10.4204/EPTCS.102},\n  category= {Proceedings (Editor)},\n  mywebpage = {},\n  show = {},\n  keywords = {Proceedings},\n      Type = {D - Conference Proceedings},\n}\n\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-hansen-olesen-whatisatiminganomaly-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/wcet-2012.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-hansen-olesen-whatisatiminganomaly-2012', 'https://franck44.github.io/publications/papers/wcet-2012.pdf', event);\">\n    What is a Timing Anomaly?.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Hansen, R. R.;  and Olesen, M. C.\n</span>\n\n  \n\n</span>\n\n  In <i>12th International Workshop on Worst-Case Execution Time Analysis, WCET 2012, July 10, 2012, Pisa, Italy</i>, volume 23, of <i>OASICS</i>, pages 1-12,  2012. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/wcet-2012.pdf\"\n     onclick=\"log_download('cassez-hansen-olesen-whatisatiminganomaly-2012', 'https://franck44.github.io/publications/papers/wcet-2012.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"What is a Timing Anomaly? [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"http://dx.doi.org/10.4230/OASIcs.WCET.2012.1\"\n     onclick=\"log_download('cassez-hansen-olesen-whatisatiminganomaly-2012', 'http://dx.doi.org/10.4230/OASIcs.WCET.2012.1', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"What is a Timing Anomaly? [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-hansen-olesen-whatisatiminganomaly-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-hansen-olesen-whatisatiminganomaly-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{wcet-12,\n  author    = {Franck Cassez and\n               René Rydhof Hansen and\n               Mads Chr. Olesen},\n  title     = {What is a Timing Anomaly?},\n  booktitle = {12th International Workshop on Worst-Case Execution Time\n               Analysis, WCET 2012, July 10, 2012, Pisa, Italy},\n  year      = {2012},\n  pages     = {1-12},\n  urlpaper = {papers/wcet-2012.pdf},\n  url_link        = {http://dx.doi.org/10.4230/OASIcs.WCET.2012.1},\n  abstract = {Timing anomalies make worst-case execution time analysis much harder, because the analysis will have to consider all local choices. It has been widely recognised that certain hardware features are timing anomalous, while others are not. However, defining formally what a timing anomaly is, has been difficult. We examine previous definitions of timing anomalies, and identify examples where they do not align with common observations. We then provide a definition for consistently slower hardware traces that can be used to define timing anomalies and aligns with common observations.},\n  category= {wcet},\n  mywebpage = {soft-verif,wcet},\n  keywords = {wcet},\n   publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},\n  series    = {OASICS},\n  volume    = {23},\n        Type = {B - International Conferences},\n\n}\n\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Timing anomalies make worst-case execution time analysis much harder, because the analysis will have to consider all local choices. It has been widely recognised that certain hardware features are timing anomalous, while others are not. However, defining formally what a timing anomaly is, has been difficult. We examine previous definitions of timing anomalies, and identify examples where they do not align with common observations. We then provide a definition for consistently slower hardware traces that can be used to define timing anomalies and aligns with common observations.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"bulychev-cassez-david-larsen-raskin-reynier-controllerswithminimalobservationpowerapplicationtotimedsystems-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/atva-2012.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bulychev-cassez-david-larsen-raskin-reynier-controllerswithminimalobservationpowerapplicationtotimedsystems-2012', 'https://franck44.github.io/publications/papers/atva-2012.pdf', event);\">\n    Controllers with Minimal Observation Power (Application to Timed Systems).\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bulychev, P. E.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; David, A.; Larsen, K. G.; Raskin, J.;  and Reynier, P.\n</span>\n\n  \n\n</span>\n\n  In <i>Automated Technology for Verification and Analysis - 10th International Symposium, ATVA 2012</i>, pages 223-237,  2012. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/atva-2012.pdf\"\n     onclick=\"log_download('bulychev-cassez-david-larsen-raskin-reynier-controllerswithminimalobservationpowerapplicationtotimedsystems-2012', 'https://franck44.github.io/publications/papers/atva-2012.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Controllers with Minimal Observation Power (Application to Timed Systems) [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"http://dx.doi.org/10.1007/978-3-642-33386-6_19\"\n     onclick=\"log_download('bulychev-cassez-david-larsen-raskin-reynier-controllerswithminimalobservationpowerapplicationtotimedsystems-2012', 'http://dx.doi.org/10.1007/978-3-642-33386-6_19', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Controllers with Minimal Observation Power (Application to Timed Systems) [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bulychev-cassez-david-larsen-raskin-reynier-controllerswithminimalobservationpowerapplicationtotimedsystems-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bulychev-cassez-david-larsen-raskin-reynier-controllerswithminimalobservationpowerapplicationtotimedsystems-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{atva-12,\n  author    = {Peter E. Bulychev and\n               Franck Cassez and\n               Alexandre David and\n               Kim Guldstrand Larsen and\n               Jean-François Raskin and\n               Pierre-Alain Reynier},\n  title     = {Controllers with Minimal Observation Power (Application\n               to Timed Systems)},\n  booktitle = {Automated Technology for Verification and Analysis - 10th\n               International Symposium, ATVA 2012},\n  year      = {2012},\n  pages     = {223-237},\n  urlpaper = {papers/atva-2012.pdf},\n  url_link  = {http://dx.doi.org/10.1007/978-3-642-33386-6_19},\n  mywebpage = {timed},\n  keywords = {timed automata, timed games, control},\n  abstract = {\n  We consider the problem of controller synthesis under imperfect information in a setting where there is a set of available observable predicates equipped with a cost function. The problem that we address is the computation of a subset of predicates sufficient for control and whose cost is minimal. Our solution avoids a full exploration of all possible subsets of predicates and reuses some information between different iterations. We apply our approach to timed systems. We have developed a tool prototype and analyze the performance of our optimization algorithm on two case studies.\n  },\n        Type = {B - International Conferences},\n\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider the problem of controller synthesis under imperfect information in a setting where there is a set of available observable predicates equipped with a cost function. The problem that we address is the computation of a subset of predicates sufficient for control and whose cost is minimal. Our solution avoids a full exploration of all possible subsets of predicates and reuses some information between different iterations. We apply our approach to timed systems. We have developed a tool prototype and analyze the performance of our optimization algorithm on two case studies. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"bulychev-cassez-david-larsen-raskin-reynier-controllerswithminimalobservationpowerapplicationtotimedsystems-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://arxiv.org/abs/1207.1276\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bulychev-cassez-david-larsen-raskin-reynier-controllerswithminimalobservationpowerapplicationtotimedsystems-2012', 'http://arxiv.org/abs/1207.1276', event);\">\n    Controllers with Minimal Observation Power (Application to Timed Systems).\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bulychev, P. E.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; David, A.; Larsen, K. G.; Raskin, J.;  and Reynier, P.\n</span>\n\n  \n\n</span>\n\n  <i>CoRR</i>, abs/1207.1276.  2012.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://arxiv.org/abs/1207.1276\"\n     onclick=\"log_download('bulychev-cassez-david-larsen-raskin-reynier-controllerswithminimalobservationpowerapplicationtotimedsystems-2012', 'http://arxiv.org/abs/1207.1276', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Controllers with Minimal Observation Power (Application to Timed Systems) [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bulychev-cassez-david-larsen-raskin-reynier-controllerswithminimalobservationpowerapplicationtotimedsystems-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bulychev-cassez-david-larsen-raskin-reynier-controllerswithminimalobservationpowerapplicationtotimedsystems-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{bulychev-2012,\n  author    = {Peter E. Bulychev and\n               Franck Cassez and\n               Alexandre David and\n               Kim G. Larsen and\n               Jean{-}Fran{\\c{c}}ois Raskin and\n               Pierre{-}Alain Reynier},\n  title     = {Controllers with Minimal Observation Power (Application to Timed Systems)},\n  journal   = {CoRR},\n  Type = {E - Reports},\n  volume    = {abs/1207.1276},\n  year      = {2012},\n  urlpaper       = {http://arxiv.org/abs/1207.1276},\n  timestamp = {Wed, 10 Oct 2012 21:28:54 +0200},\n  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1207-1276},\n  bibsource = {dblp computer science bibliography, http://dblp.org},\n  abstract = {\n  We consider the problem of controller synthesis under imperfect information in a setting where there is a set of available observable predicates equipped with a cost function. The problem that we address is the computation of a subset of predicates sufficient for control and whose cost is minimal. Our solution avoids a full exploration of all possible subsets of predicates and reuses some information between different iterations. We apply our approach to timed systems. We have developed a tool prototype and analyze the performance of our optimization algorithm on two case studies.\n  },\n   mywebpage = {timed},\n  keywords = {timed automata, timed games, control},\n\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider the problem of controller synthesis under imperfect information in a setting where there is a set of available observable predicates equipped with a cost function. The problem that we address is the computation of a subset of predicates sufficient for control and whose cost is minimal. Our solution avoids a full exploration of all possible subsets of predicates and reuses some information between different iterations. We apply our approach to timed systems. We have developed a tool prototype and analyze the performance of our optimization algorithm on two case studies. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystems-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/tac-2012.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystems-2012', 'https://franck44.github.io/publications/papers/tac-2012.pdf', event);\">\n    The Complexity of Codiagnosability for Discrete Event and Timed Systems.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>\n</span>\n\n  \n\n</span>\n\n  <i>IEEE Trans. Automat. Contr.</i>, 57(7): 1752-1764.  2012.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/tac-2012.pdf\"\n     onclick=\"log_download('cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystems-2012', 'https://franck44.github.io/publications/papers/tac-2012.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"The Complexity of Codiagnosability for Discrete Event and Timed Systems [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"http://dx.doi.org/10.1109/TAC.2012.2183169\"\n     onclick=\"log_download('cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystems-2012', 'http://dx.doi.org/10.1109/TAC.2012.2183169', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"The Complexity of Codiagnosability for Discrete Event and Timed Systems [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/http://dx.doi.org/10.1109/TAC.2012.2183169\"\n     onclick=\"log_download('cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystems-2012', 'http://doi.org/http://dx.doi.org/10.1109/TAC.2012.2183169', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystems-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystems-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{tac-12,\n  author    = {Franck Cassez},\n  title     = {The Complexity of Codiagnosability for Discrete Event and\n               Timed Systems},\n  journal   = {IEEE Trans. Automat. Contr.},\n  volume    = {57},\n  number    = {7},\n  year      = {2012},\n  type = {A - Journal},\n  pages     = {1752-1764},\n  urlpaper = {papers/tac-2012.pdf},\n  url_link       = {http://dx.doi.org/10.1109/TAC.2012.2183169},\n  doi = {http://dx.doi.org/10.1109/TAC.2012.2183169},\n  mywebpage = {timed},\n  keywords = {timed automata, Fault diagnosis, Complexity},\n  abstract = {\n  In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform characterisation of codiagnosability for FA and TA which extends the necessary and sufficient condition that characterises diagosability. We also settle the complexity of the codiagnosability problems both for FA and TA and show that codiagnosability is PSPACE-complete in both cases. For FA this improves on the previously known bound (EXPTIME) and for TA it is a new result. We then generalise the previous results to the case of dynamic observers. Finally we show that the codiagnosis problem for TA under bounded resources is 2EXPTIME-complete.\n  }\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform characterisation of codiagnosability for FA and TA which extends the necessary and sufficient condition that characterises diagosability. We also settle the complexity of the codiagnosability problems both for FA and TA and show that codiagnosability is PSPACE-complete in both cases. For FA this improves on the previously known bound (EXPTIME) and for TA it is a new result. We then generalise the previous results to the case of dynamic observers. Finally we show that the codiagnosis problem for TA under bounded resources is 2EXPTIME-complete. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-dubreil-marchand-synthesisofopaquesystemswithstaticanddynamicmasks-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/fmsd-2012.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-dubreil-marchand-synthesisofopaquesystemswithstaticanddynamicmasks-2012', 'https://franck44.github.io/publications/papers/fmsd-2012.pdf', event);\">\n    Synthesis of opaque systems with static and dynamic masks.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Dubreil, J.;  and Marchand, H.\n</span>\n\n  \n\n</span>\n\n  <i>Formal Methods in System Design</i>, 40(1): 88-115.  2012.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/fmsd-2012.pdf\"\n     onclick=\"log_download('cassez-dubreil-marchand-synthesisofopaquesystemswithstaticanddynamicmasks-2012', 'https://franck44.github.io/publications/papers/fmsd-2012.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Synthesis of opaque systems with static and dynamic masks [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"http://dx.doi.org/10.1007/s10703-012-0141-9\"\n     onclick=\"log_download('cassez-dubreil-marchand-synthesisofopaquesystemswithstaticanddynamicmasks-2012', 'http://dx.doi.org/10.1007/s10703-012-0141-9', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Synthesis of opaque systems with static and dynamic masks [link]\"\n       title=\"Link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Link</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-dubreil-marchand-synthesisofopaquesystemswithstaticanddynamicmasks-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-dubreil-marchand-synthesisofopaquesystemswithstaticanddynamicmasks-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{fmsd-12,\n  author    = {Franck Cassez and\n               Jérémy Dubreil and\n               Hervé Marchand},\n  title     = {Synthesis of opaque systems with static and dynamic masks},\n  journal   = {Formal Methods in System Design},\n  volume    = {40},\n  number    = {1},\n  year      = {2012},\n  pages     = {88-115},\n    type = {A - Journal},\n\n  urlpaper = {papers/fmsd-2012.pdf},\n  ee        = {http://dx.doi.org/10.1007/s10703-012-0141-9},\n  bibsource = {DBLP, http://dblp.uni-trier.de},\n  mywebpage = {},\n  keywords = {security, opacity, diagnosis},\n  abstract = {\nOpacity is a security property formalizing the absence of secret information leakage and we address in this paper the problem of synthesizing opaque systems. A secret predicate S over the runs of a system G is opaque to an external user having partial observ- ability over G, if s/he can never infer from the observation of a run of G that the run belongs to S. We choose to control the observability of events by adding a device, called a mask, between the system G and the users. We first investigate the case of static partial observability where the set of events the user can observe is fixed a priori by a static mask. In this context, we show that checking whether a system is opaque is PSPACE-complete, which implies that computing an optimal static mask ensuring opacity is also a PSPACE-complete problem. Next, we introduce dynamic partial observability where the set of events the user can observe changes over time and is chosen by a dynamic mask. We show how to check that a system is opaque w.r.t. to a dynamic mask and also address the corresponding synthesis problem: given a system G and secret states S, compute the set of dynamic masks under which S is opaque. Our main result is that the set of such masks can be finitely represented and can be computed in EXPTIME and this is a lower bound. Finally we also address the problem of computing an optimal mask.\n\n  },\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Opacity is a security property formalizing the absence of secret information leakage and we address in this paper the problem of synthesizing opaque systems. A secret predicate S over the runs of a system G is opaque to an external user having partial observ- ability over G, if s/he can never infer from the observation of a run of G that the run belongs to S. We choose to control the observability of events by adding a device, called a mask, between the system G and the users. We first investigate the case of static partial observability where the set of events the user can observe is fixed a priori by a static mask. In this context, we show that checking whether a system is opaque is PSPACE-complete, which implies that computing an optimal static mask ensuring opacity is also a PSPACE-complete problem. Next, we introduce dynamic partial observability where the set of events the user can observe changes over time and is chosen by a dynamic mask. We show how to check that a system is opaque w.r.t. to a dynamic mask and also address the corresponding synthesis problem: given a system G and secret states S, compute the set of dynamic masks under which S is opaque. Our main result is that the set of such masks can be finitely represented and can be computed in EXPTIME and this is a lower bound. Finally we also address the problem of computing an optimal mask. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"bradley-cassez-fehnker-givenwilson-huuck-highperformancestaticanalysisforindustry-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/tapas-2012.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bradley-cassez-fehnker-givenwilson-huuck-highperformancestaticanalysisforindustry-2012', 'https://franck44.github.io/publications/papers/tapas-2012.pdf', event);\">\n    High Performance Static Analysis for Industry.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bradley, M.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Fehnker, A.; Given-Wilson, T.;  and Huuck, R.\n</span>\n\n  \n\n</span>\n\n  <i>Electr. Notes Theor. Comput. Sci.</i>, 289: 3-14.  2012.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/tapas-2012.pdf\"\n     onclick=\"log_download('bradley-cassez-fehnker-givenwilson-huuck-highperformancestaticanalysisforindustry-2012', 'https://franck44.github.io/publications/papers/tapas-2012.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"High Performance Static Analysis for Industry [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"http://dx.doi.org/10.1016/j.entcs.2012.11.002\"\n     onclick=\"log_download('bradley-cassez-fehnker-givenwilson-huuck-highperformancestaticanalysisforindustry-2012', 'http://dx.doi.org/10.1016/j.entcs.2012.11.002', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"High Performance Static Analysis for Industry [link]\"\n       title=\"Link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Link</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bradley-cassez-fehnker-givenwilson-huuck-highperformancestaticanalysisforindustry-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bradley-cassez-fehnker-givenwilson-huuck-highperformancestaticanalysisforindustry-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{tapas-12,\n  author    = {Mark Bradley and\n               Franck Cassez and\n               Ansgar Fehnker and\n               Thomas Given-Wilson and\n               Ralf Huuck},\n  title     = {High Performance Static Analysis for Industry},\n  journal   = {Electr. Notes Theor. Comput. Sci.},\n  volume    = {289},\n  year      = {2012},\n  pages     = {3-14},\n  urlpaper = {papers/tapas-2012.pdf},\n  ee        = {http://dx.doi.org/10.1016/j.entcs.2012.11.002},\n  bibsource = {DBLP, http://dblp.uni-trier.de},\n  mywebpage = {soft-verif},\n  keywords = {software verification},\n  abstract = {\n  Static source code analysis for software bug detection has come a long way since its early beginnings as a compiler technology. However, with the introduction of more sophisticated algorithmic techniques, such as model checking and constraint solving, questions about performance are a major concern. In this work we present an empirical study of our industrial strength source code analysis tool Goanna that uses a model checking core for static analysis of C/C++ code. We present the core technology and abstraction mechanism with a focus on performance, as guided by experience from having analyzed millions of lines of code. In particular, we present results from our recent study within the NIST/DHS SAMATE program. The results show that, maybe surprisingly, formal verification techniques can be used successfully in practical industry applications scaling roughly linearly, even for millions of lines of code.\n  },\n        Type = {B - International Conferences},\n\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Static source code analysis for software bug detection has come a long way since its early beginnings as a compiler technology. However, with the introduction of more sophisticated algorithmic techniques, such as model checking and constraint solving, questions about performance are a major concern. In this work we present an empirical study of our industrial strength source code analysis tool Goanna that uses a model checking core for static analysis of C/C++ code. We present the core technology and abstraction mechanism with a focus on performance, as guided by experience from having analyzed millions of lines of code. In particular, we present results from our recent study within the NIST/DHS SAMATE program. The results show that, maybe surprisingly, formal verification techniques can be used successfully in practical industry applications scaling roughly linearly, even for millions of lines of code. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"benattar-cassez-lime-roux-controlandsynthesisofnoninterferenttimedsystems-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://arxiv.org/abs/1207.4984\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'benattar-cassez-lime-roux-controlandsynthesisofnoninterferenttimedsystems-2012', 'http://arxiv.org/abs/1207.4984', event);\">\n    Control and Synthesis of Non-Interferent Timed Systems.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Benattar, G.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Lime, D.;  and Roux, O. H.\n</span>\n\n  \n\n</span>\n\n  <i>CoRR</i>, abs/1207.4984.  2012.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://arxiv.org/abs/1207.4984\"\n     onclick=\"log_download('benattar-cassez-lime-roux-controlandsynthesisofnoninterferenttimedsystems-2012', 'http://arxiv.org/abs/1207.4984', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Control and Synthesis of Non-Interferent Timed Systems [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/benattar-cassez-lime-roux-controlandsynthesisofnoninterferenttimedsystems-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('benattar-cassez-lime-roux-controlandsynthesisofnoninterferenttimedsystems-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{benattar-2012,\n  author    = {Gilles Benattar and\n               Franck Cassez and\n               Didier Lime and\n               Olivier H. Roux},\n  title     = {Control and Synthesis of Non-Interferent Timed Systems},\n  journal   = {CoRR},\n  Type = {E - Reports},\n  volume    = {abs/1207.4984},\n  year      = {2012},\n  url       = {http://arxiv.org/abs/1207.4984},\n  timestamp = {Wed, 10 Oct 2012 21:28:54 +0200},\n  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1207-4984},\n  bibsource = {dblp computer science bibliography, http://dblp.org},\n  keywords = {sceurity, non-interference},\n  abstract = {\nIn this paper, we focus on the synthesis of secure timed systems which are modelled as timed automata. The security property that the system must satisfy is a non-interference property. Intuitively, non-interference ensures the absence of any causal dependency from a high-level domain to a lower-level domain. Various notions of non-interference have been defined in the literature, and in this paper we focus on Strong Non-deterministic Non-Interference (SNNI) and two (bi)simulation based variants thereof (CSNNI and BSNNI). We consider timed non-interference properties for timed systems specified by timed automata and we study the two following problems: (1) check whether it is possible to find a sub-system so that it is non-interferent; if yes (2) compute a (largest) sub-system which is non-interferent.\n  }\n}\n\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n%%% 2011\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper, we focus on the synthesis of secure timed systems which are modelled as timed automata. The security property that the system must satisfy is a non-interference property. Intuitively, non-interference ensures the absence of any causal dependency from a high-level domain to a lower-level domain. Various notions of non-interference have been defined in the literature, and in this paper we focus on Strong Non-deterministic Non-Interference (SNNI) and two (bi)simulation based variants thereof (CSNNI and BSNNI). We consider timed non-interference properties for timed systems specified by timed automata and we study the two following problems: (1) check whether it is possible to find a sub-system so that it is non-interferent; if yes (2) compute a (largest) sub-system which is non-interferent. \n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2011\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2011')\"\n      onkeypress=\"toggleGroup('group_2011')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2011</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"cassez-timedgamesforcomputingwcetforpipelinedprocessorswithcaches-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/acsd-2011.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-timedgamesforcomputingwcetforpipelinedprocessorswithcaches-2011', 'https://franck44.github.io/publications/papers/acsd-2011.pdf', event);\">\n    Timed Games for Computing WCET for Pipelined Processors with Caches.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>11th International Conference on Application of Concurrency to System Design, ACSD 2011, Newcastle Upon Tyne, UK, 20-24 June, 2011</i>, pages 195–204,  2011. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/acsd-2011.pdf\"\n     onclick=\"log_download('cassez-timedgamesforcomputingwcetforpipelinedprocessorswithcaches-2011', 'https://franck44.github.io/publications/papers/acsd-2011.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Timed Games for Computing WCET for Pipelined Processors with Caches [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://franck44.github.io/publications/papers/slides-acsd-2011.pdf\"\n     onclick=\"log_download('cassez-timedgamesforcomputingwcetforpipelinedprocessorswithcaches-2011', 'https://franck44.github.io/publications/papers/slides-acsd-2011.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Timed Games for Computing WCET for Pipelined Processors with Caches [pdf]\"\n       title=\"Slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Slides</span></a>\n  &nbsp;\n  \n  <a href=\"http://dx.doi.org/10.1109/ACSD.2011.15\"\n     onclick=\"log_download('cassez-timedgamesforcomputingwcetforpipelinedprocessorswithcaches-2011', 'http://dx.doi.org/10.1109/ACSD.2011.15', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Timed Games for Computing WCET for Pipelined Processors with Caches [link]\"\n       title=\"Link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ACSD.2011.15\"\n     onclick=\"log_download('cassez-timedgamesforcomputingwcetforpipelinedprocessorswithcaches-2011', 'http://doi.org/10.1109/ACSD.2011.15', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-timedgamesforcomputingwcetforpipelinedprocessorswithcaches-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-timedgamesforcomputingwcetforpipelinedprocessorswithcaches-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{cassez-acsd-2011,\n  author    = {Franck Cassez},\n  title     = {Timed Games for Computing {WCET} for Pipelined Processors with Caches},\n  booktitle = {11th International Conference on Application of Concurrency to System\n               Design, {ACSD} 2011, Newcastle Upon Tyne, UK, 20-24 June, 2011},\n  pages     = {195--204},\n  year      = {2011},\n  publisher = {{IEEE}},\n  url       = {http://doi.ieeecomputersociety.org/10.1109/ACSD.2011.15},\n  doi       = {10.1109/ACSD.2011.15},\n  timestamp = {Wed, 15 Feb 2012 09:59:43 +0100},\n  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/acsd/Cassez11},\n  bibsource = {dblp computer science bibliography, http://dblp.org},\n   urlpaper = {papers/acsd-2011.pdf},\n  urlslides = {papers/slides-acsd-2011.pdf},\n  ABSTRACT = {In this paper we introduce a framework for computing upper bounds yet\naccurate WCET for hardware platforms with caches and pipelines. The methodology\nwe propose consists of 3 steps: 1) given a program to analyse, compute an\nequivalent (WCET-wise) abstract program; 2) build a timed game by composing\nthis abstract program with a network of timed automata modeling the\narchitecture; and 3) compute the WCET as the optimal time to reach a winning\nstate in this game. We demonstrate the applicability of our framework on\nstandard benchmarks for an ARM9 processor with instruction and data caches, and\ncompute the WCET with UPPAAL-TiGA. We also show that this framework can easily\nbe extended to take into account dynamic changes in the speed of the processor\nduring program execution.\n},\nee       = {http://dx.doi.org/10.1109/ACSD.2011.15},\n  keywords = {wcet, timed automata},\n  category = {wcet},\n  show = {},\n  category= {wcet},\n  mywebpage = {wcet},\n        Type = {B - International Conferences},\n\n}\n\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper we introduce a framework for computing upper bounds yet accurate WCET for hardware platforms with caches and pipelines. The methodology we propose consists of 3 steps: 1) given a program to analyse, compute an equivalent (WCET-wise) abstract program; 2) build a timed game by composing this abstract program with a network of timed automata modeling the architecture; and 3) compute the WCET as the optimal time to reach a winning state in this game. We demonstrate the applicability of our framework on standard benchmarks for an ARM9 processor with instruction and data caches, and compute the WCET with UPPAAL-TiGA. We also show that this framework can easily be extended to take into account dynamic changes in the speed of the processor during program execution. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"bchennec-cassez-computationofwcetusingprogramslicingandrealtimemodelchecking-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://arxiv.org/abs/1105.1633\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bchennec-cassez-computationofwcetusingprogramslicingandrealtimemodelchecking-2011', 'http://arxiv.org/abs/1105.1633', event);\">\n    Computation of WCET using Program Slicing and Real-Time Model-Checking.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Béchennec, J.;  and <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>\n</span>\n\n  \n\n</span>\n\n  <i>CoRR</i>, abs/1105.1633.  2011.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://arxiv.org/abs/1105.1633\"\n     onclick=\"log_download('bchennec-cassez-computationofwcetusingprogramslicingandrealtimemodelchecking-2011', 'http://arxiv.org/abs/1105.1633', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Computation of WCET using Program Slicing and Real-Time Model-Checking [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bchennec-cassez-computationofwcetusingprogramslicingandrealtimemodelchecking-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bchennec-cassez-computationofwcetusingprogramslicingandrealtimemodelchecking-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{bech-wcet-2011,\n  author    = {Jean{-}Luc B{\\&#x27;{e}}chennec and\n               Franck Cassez},\n  title     = {Computation of {WCET} using Program Slicing and Real-Time Model-Checking},\n  journal   = {CoRR},\n  Type = {E - Reports},\n  volume    = {abs/1105.1633},\n  year      = {2011},\n  urlpaper       = {http://arxiv.org/abs/1105.1633},\n  timestamp = {Mon, 05 Dec 2011 18:05:32 +0100},\n  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1105-1633},\n  bibsource = {dblp computer science bibliography, http://dblp.org},\n  ABSTRACT = { Computing accurate WCET on modern complex architectures is a challenging task. This problem has been devoted a lot of attention in the last decade but there are still some open issues. First, the control flow graph (CFG) of a binary program is needed to compute the WCET and this CFG is built using some internal knowledge of the compiler that generated the binary code; moreover once constructed the CFG has to be manually annotated with loop bounds. Second, the algorithms to compute the WCET (combining Abstract Interpretation and Integer Linear Programming) are tailored for specific architectures: changing the architecture (e.g. replacing an ARM7 by an ARM9) requires the design of a new ad hoc algorithm. Third, the tightness of the computed results (obtained using the available tools) are not compared to actual execution times measured on the real hardware. In this paper we address the above mentioned problems. We first describe a fully automatic method to compute a CFG based solely on the binary program to analyse. Second, we describe the model of the hardware as a product of timed automata, and this model is independent from the program description. The model of a program running on a hardware is obtained by synchronizing (the automaton of) the program with the (timed automata) model of the hardware. Computing the WCET is reduced to a reachability problem on the synchronised model and solved using the model-checker UPPAAL. Finally, we present a rigorous methodology that enables us to compare our computed results to actual execution times measured on a real platform, the ARM920T.},\n    category= {wcet},\n  keywords = {wcet, timed automata},\n  show = {},\n  mywebpage = {wcet}\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Computing accurate WCET on modern complex architectures is a challenging task. This problem has been devoted a lot of attention in the last decade but there are still some open issues. First, the control flow graph (CFG) of a binary program is needed to compute the WCET and this CFG is built using some internal knowledge of the compiler that generated the binary code; moreover once constructed the CFG has to be manually annotated with loop bounds. Second, the algorithms to compute the WCET (combining Abstract Interpretation and Integer Linear Programming) are tailored for specific architectures: changing the architecture (e.g. replacing an ARM7 by an ARM9) requires the design of a new ad hoc algorithm. Third, the tightness of the computed results (obtained using the available tools) are not compared to actual execution times measured on the real hardware. In this paper we address the above mentioned problems. We first describe a fully automatic method to compute a CFG based solely on the binary program to analyse. Second, we describe the model of the hardware as a product of timed automata, and this model is independent from the program description. The model of a program running on a hardware is obtained by synchronizing (the automaton of) the program with the (timed automata) model of the hardware. Computing the WCET is reduced to a reachability problem on the synchronised model and solved using the model-checker UPPAAL. Finally, we present a rigorous methodology that enables us to compare our computed results to actual execution times measured on a real platform, the ARM920T.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"bouyer-cassez-laroussinie-timedmodallogicsforrealtimesystemsspecificationverificationandcontrol-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/jlli-2011.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bouyer-cassez-laroussinie-timedmodallogicsforrealtimesystemsspecificationverificationandcontrol-2011', 'https://franck44.github.io/publications/papers/jlli-2011.pdf', event);\">\n    Timed Modal Logics for Real-Time Systems - Specification, Verification and Control.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bouyer, P.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Laroussinie, F.\n</span>\n\n  \n\n</span>\n\n  <i>Journal of Logic, Language and Information</i>, 20(2): 169–203.  2011.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/jlli-2011.pdf\"\n     onclick=\"log_download('bouyer-cassez-laroussinie-timedmodallogicsforrealtimesystemsspecificationverificationandcontrol-2011', 'https://franck44.github.io/publications/papers/jlli-2011.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Timed Modal Logics for Real-Time Systems - Specification, Verification and Control [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/s10849-010-9127-4\"\n     onclick=\"log_download('bouyer-cassez-laroussinie-timedmodallogicsforrealtimesystemsspecificationverificationandcontrol-2011', 'http://doi.org/10.1007/s10849-010-9127-4', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bouyer-cassez-laroussinie-timedmodallogicsforrealtimesystemsspecificationverificationandcontrol-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bouyer-cassez-laroussinie-timedmodallogicsforrealtimesystemsspecificationverificationandcontrol-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{bouyer-jlli-2011,\n  author    = {Patricia Bouyer and\n               Franck Cassez and\n               Fran{\\c{c}}ois Laroussinie},\n  title     = {Timed Modal Logics for Real-Time Systems - Specification, Verification\n               and Control},\n  journal   = {Journal of Logic, Language and Information},\n  volume    = {20},\n  number    = {2},\n  pages     = {169--203},\n  year      = {2011},\n  Type = {A - Journal},\n  url       = {http://dx.doi.org/10.1007/s10849-010-9127-4},\n  doi       = {10.1007/s10849-010-9127-4},\n  timestamp = {Tue, 12 Apr 2011 09:14:59 +0200},\n  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/jolli/BouyerCL11},\n  bibsource = {dblp computer science bibliography, http://dblp.org},\n  urlpaper = {papers/jlli-2011.pdf},\n  category= {games},\n  mywebpage = {timed},\n  show = {},\n  keywords = {logics, real-time, timed automata, timed games},\n  abstract = {\n  In this paper, a timed modal logic Lc is presented for the specification\nand verification of real-time systems. Several important results for Lc are discussed.\nFirst we address the model checking problem and we show that it is an EXPTIME-complete problem.\nSecondly we consider expressiveness and we explain how to\nexpress strong timed bisimilarity and how to build characteristic formulas for timed\nautomata. We also propose a compositional algorithm for Lc model checking. Finally\nwe consider several control problems for which Lc can be used to check controllability.\n  }\n}\n\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n%%% 2010\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper, a timed modal logic Lc is presented for the specification and verification of real-time systems. Several important results for Lc are discussed. First we address the model checking problem and we show that it is an EXPTIME-complete problem. Secondly we consider expressiveness and we explain how to express strong timed bisimilarity and how to build characteristic formulas for timed automata. We also propose a compositional algorithm for Lc model checking. Finally we consider several control problems for which Lc can be used to check controllability. \n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2010\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2010')\"\n      onkeypress=\"toggleGroup('group_2010')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2010</span>\n      <span class=\"bibbase_group_count\">\n        \n        (7)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystemsextendedabstract-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/atva-10.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystemsextendedabstract-2010', 'https://franck44.github.io/publications/papers/atva-10.pdf', event);\">\n    The Complexity of Codiagnosability for Discrete Event and Timed Systems (Extended abstract).\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>\n</span>\n\n  \n\n</span>\n\n  In Bouajjani, A.;  and Chin, W., editor(s), <i>Automated Technology for Verification and Analysis - 8th International Symposium, ATVA 2010, Singapore, September 21-24, 2010. Proceedings</i>, volume 6252, of <i>Lecture Notes in Computer Science</i>, pages 82–96,  2010. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/atva-10.pdf\"\n     onclick=\"log_download('cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystemsextendedabstract-2010', 'https://franck44.github.io/publications/papers/atva-10.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"The Complexity of Codiagnosability for Discrete Event and Timed Systems (Extended abstract) [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-642-15643-4_8\"\n     onclick=\"log_download('cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystemsextendedabstract-2010', 'http://doi.org/10.1007/978-3-642-15643-4_8', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystemsextendedabstract-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystemsextendedabstract-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/atva/Cassez10,\n  author    = {Franck Cassez},\n  title     = {The Complexity of Codiagnosability for Discrete Event and Timed Systems (Extended abstract)},\n  booktitle = {Automated Technology for Verification and Analysis - 8th International\n               Symposium, {ATVA} 2010, Singapore, September 21-24, 2010. Proceedings},\n  pages     = {82--96},\n  year      = {2010},\n  editor    = {Ahmed Bouajjani and\n               Wei{-}Ngan Chin},\n  urlpaper = {papers/atva-10.pdf},\n  xxee = {http://arxiv.org/abs/1004.2550},\n  xxurl       = {http://dx.doi.org/10.1007/978-3-642-15643-4_8},\n  doi       = {10.1007/978-3-642-15643-4_8},\n series    = {Lecture Notes in Computer Science},\n  volume    = {6252},\n   mywebpage = {diagnosis},\n  show = {},\n  publisher = {Springer},\n  keywords = {diagnosis, complexity, timed automata},\n  abstract = {In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform characterization of codiagnosability for FA and TA which extends the necessary and sufficient condition that characterizes diagnosability. We also settle the complexity of the codiagnosability problems both for FA and TA and show that codiagnosability is PSPACE-complete in both cases. For FA this improves on the previously known bound (EXPTIME) and for TA it is a new result. Finally we address the codiagnosis problem for TA under bounded resources and show it is 2EXPTIME-complete.},\n        Type = {B - International Conferences},\n\n  }\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform characterization of codiagnosability for FA and TA which extends the necessary and sufficient condition that characterizes diagnosability. We also settle the complexity of the codiagnosability problems both for FA and TA and show that codiagnosability is PSPACE-complete in both cases. For FA this improves on the previously known bound (EXPTIME) and for TA it is a new result. Finally we address the codiagnosis problem for TA under bounded resources and show it is 2EXPTIME-complete.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-dynamicobserversforfaultdiagnosisoftimedsystems-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/cdc-2010.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-dynamicobserversforfaultdiagnosisoftimedsystems-2010', 'https://franck44.github.io/publications/papers/cdc-2010.pdf', event);\">\n    Dynamic Observers for Fault Diagnosis of Timed Systems.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>49th IEEE Conference on Decision and Control and 28th Chinese Control Conference</i>, Atlanta, December 2010. IEEE Computer Society\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/cdc-2010.pdf\"\n     onclick=\"log_download('cassez-dynamicobserversforfaultdiagnosisoftimedsystems-2010', 'https://franck44.github.io/publications/papers/cdc-2010.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Dynamic Observers for Fault Diagnosis of Timed Systems [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"http://arxiv.org/abs/1004.2764\"\n     onclick=\"log_download('cassez-dynamicobserversforfaultdiagnosisoftimedsystems-2010', 'http://arxiv.org/abs/1004.2764', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Dynamic Observers for Fault Diagnosis of Timed Systems [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-dynamicobserversforfaultdiagnosisoftimedsystems-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-dynamicobserversforfaultdiagnosisoftimedsystems-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@INPROCEEDINGS{cassez-cdc-2010,\n  AUTHOR = {Franck Cassez},\n  TITLE = {{Dynamic Observers for Fault Diagnosis of Timed Systems}},\n  BOOKTITLE = {49th IEEE Conference on Decision and Control and 28th Chinese Control Conference},\n  YEAR = {2010},\n  ADDRESS = {Atlanta},\n  MONTH = DEC,\n  PUBLISHER = {IEEE Computer Society},\n  urlpaper = {papers/cdc-2010.pdf},\n  url_link = {http://arxiv.org/abs/1004.2764},\n  ABSTRACT = { In this paper we extend the work on dynamic observers for\nfault diagnosis  to timed automata. We\nstudy sensor minimization problems with static observers and\nthen address the problem of computing the most permissive\ndynamic observer for a system given by a timed automaton. },\n  mywebpage = {diagnosis},\n  show = {},\n  keywords = {diagnosis, timed automata},\n        Type = {B - International Conferences},\n\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper we extend the work on dynamic observers for fault diagnosis to timed automata. We study sensor minimization problems with static observers and then address the problem of computing the most permissive dynamic observer for a system given by a timed automaton. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-vandermeyden-zhang-thecomplexityofsynchronousnotionsofinformationflowsecurity-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/fossacs-2010.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-vandermeyden-zhang-thecomplexityofsynchronousnotionsofinformationflowsecurity-2010', 'https://franck44.github.io/publications/papers/fossacs-2010.pdf', event);\">\n    The Complexity of Synchronous Notions of Information Flow Security.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; van der Meyden, R.;  and Zhang, C.\n</span>\n\n  \n\n</span>\n\n  In Ong, C. L., editor(s), <i>Foundations of Software Science and Computational Structures, 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings</i>, volume 6014, of <i>Lecture Notes in Computer Science</i>, pages 282–296,  2010. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/fossacs-2010.pdf\"\n     onclick=\"log_download('cassez-vandermeyden-zhang-thecomplexityofsynchronousnotionsofinformationflowsecurity-2010', 'https://franck44.github.io/publications/papers/fossacs-2010.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"The Complexity of Synchronous Notions of Information Flow Security [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-642-12032-9_20\"\n     onclick=\"log_download('cassez-vandermeyden-zhang-thecomplexityofsynchronousnotionsofinformationflowsecurity-2010', 'http://doi.org/10.1007/978-3-642-12032-9_20', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-vandermeyden-zhang-thecomplexityofsynchronousnotionsofinformationflowsecurity-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-vandermeyden-zhang-thecomplexityofsynchronousnotionsofinformationflowsecurity-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{cassez-fossacs-2010,\n  author    = {Franck Cassez and\n               Ron van der Meyden and\n               Chenyi Zhang},\n               editor    = {C.{-}H. Luke Ong},\n  title     = {The Complexity of Synchronous Notions of Information Flow Security},\n  booktitle = {Foundations of Software Science and Computational Structures, 13th\n               International Conference, {FOSSACS} 2010, Held as Part of the Joint\n               European Conferences on Theory and Practice of Software, {ETAPS} 2010,\n               Paphos, Cyprus, March 20-28, 2010. Proceedings},\n  pages     = {282--296},\n  year      = {2010},\n  volume    = {6014},\n  urlpaper = {papers/fossacs-2010.pdf},\n  publisher = {Springer},\n  series    = {Lecture Notes in Computer Science},\n  doi       = {10.1007/978-3-642-12032-9_20},\n      keywords = {security, interference},\n      Type = {B - International Conferences},\n\n  abstract = {The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one in which agents operate synchronously with awareness of the global clock. This enables timing based attacks to be captured, whereas previous work on this topic has dealt primarily with asynchronous systems. Versions of the notions of nondeducibility on inputs, nondeducibility on strategies, and an unwinding based notion are formulated for this model. All three notions are shown to be decidable, and their computational complexity is characterised.}\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one in which agents operate synchronously with awareness of the global clock. This enables timing based attacks to be captured, whereas previous work on this topic has dealt primarily with asynchronous systems. Versions of the notions of nondeducibility on inputs, nondeducibility on strategies, and an unwinding based notion are formulated for this model. All three notions are shown to be decidable, and their computational complexity is characterised.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystems-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://arxiv.org/abs/1004.2550\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystems-2010', 'http://arxiv.org/abs/1004.2550', event);\">\n    The Complexity of Codiagnosability for Discrete Event and Timed Systems.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>\n</span>\n\n  \n\n</span>\n\n  <i>CoRR</i>, abs/1004.2550.  2010.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://arxiv.org/abs/1004.2550\"\n     onclick=\"log_download('cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystems-2010', 'http://arxiv.org/abs/1004.2550', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"The Complexity of Codiagnosability for Discrete Event and Timed Systems [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystems-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-thecomplexityofcodiagnosabilityfordiscreteeventandtimedsystems-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/corr/abs-1004-2550,\n  author    = {Franck Cassez},\n  title     = {The Complexity of Codiagnosability for Discrete Event and Timed Systems},\n  journal   = {CoRR},\n  Type = {E - Reports},\n  volume    = {abs/1004.2550},\n  year      = {2010},\n  url       = {http://arxiv.org/abs/1004.2550},\n  timestamp = {Mon, 05 Dec 2011 18:05:32 +0100},\n  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1004-2550},\n  bibsource = {dblp computer science bibliography, http://dblp.org},\n      keywords = {fault diagnosis, timed automata},\n\n  abstract = {In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform characterization of codiagnosability for FA and TA which extends the necessary and sufficient condition that characterizes diagnosability. We also settle the complexity of the codiagnosability problems both for FA and TA and show that codiagnosability is PSPACE-complete in both cases. For FA this improves on the previously known bound (EXPTIME) and for TA it is a new result. Finally we address the codiagnosis problem for TA under bounded resources and show it is 2EXPTIME-complete.}\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform characterization of codiagnosability for FA and TA which extends the necessary and sufficient condition that characterizes diagnosability. We also settle the complexity of the codiagnosability problems both for FA and TA and show that codiagnosability is PSPACE-complete in both cases. For FA this improves on the previously known bound (EXPTIME) and for TA it is a new result. Finally we address the codiagnosis problem for TA under bounded resources and show it is 2EXPTIME-complete.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-anoteonfaultdiagnosisalgorithms-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://arxiv.org/abs/1004.2764\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-anoteonfaultdiagnosisalgorithms-2010', 'http://arxiv.org/abs/1004.2764', event);\">\n    A Note on Fault Diagnosis Algorithms.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>\n</span>\n\n  \n\n</span>\n\n  <i>CoRR</i>, abs/1004.2764.  2010.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://arxiv.org/abs/1004.2764\"\n     onclick=\"log_download('cassez-anoteonfaultdiagnosisalgorithms-2010', 'http://arxiv.org/abs/1004.2764', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"A Note on Fault Diagnosis Algorithms [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-anoteonfaultdiagnosisalgorithms-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-anoteonfaultdiagnosisalgorithms-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/corr/abs-1004-2764,\n  author    = {Franck Cassez},\n  title     = {A Note on Fault Diagnosis Algorithms},\n  journal   = {CoRR},\n  Type = {E - Reports},\n  volume    = {abs/1004.2764},\n  year      = {2010},\n  url       = {http://arxiv.org/abs/1004.2764},\n  timestamp = {Mon, 05 Dec 2011 18:04:58 +0100},\n  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1004-2764},\n  bibsource = {dblp computer science bibliography, http://dblp.org},\n      keywords = {fault diagnosis, timed automata},\n\n  abstract = {In this paper we review algorithms for checking diagnosability of discrete-event systems and timed automata. We point out that the diagnosability problems in both cases reduce to the emptiness problem for (timed) B\\&quot;uchi automata. Moreover, it is known that, checking whether a discrete-event system is diagnosable, can also be reduced to checking bounded diagnosability. We establish a similar result for timed automata. We also provide a synthesis of the complexity results for the different fault diagnosis problems.}\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper we review algorithms for checking diagnosability of discrete-event systems and timed automata. We point out that the diagnosability problems in both cases reduce to the emptiness problem for (timed) Büchi automata. Moreover, it is known that, checking whether a discrete-event system is diagnosable, can also be reduced to checking bounded diagnosability. We establish a similar result for timed automata. We also provide a synthesis of the complexity results for the different fault diagnosis problems.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-tripakis-faultdiagnosiswithdynamicobservers-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://arxiv.org/abs/1004.2810\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-tripakis-faultdiagnosiswithdynamicobservers-2010', 'http://arxiv.org/abs/1004.2810', event);\">\n    Fault Diagnosis with Dynamic Observers.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Tripakis, S.\n</span>\n\n  \n\n</span>\n\n  <i>CoRR</i>, abs/1004.2810.  2010.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://arxiv.org/abs/1004.2810\"\n     onclick=\"log_download('cassez-tripakis-faultdiagnosiswithdynamicobservers-2010', 'http://arxiv.org/abs/1004.2810', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Fault Diagnosis with Dynamic Observers [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-tripakis-faultdiagnosiswithdynamicobservers-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-tripakis-faultdiagnosiswithdynamicobservers-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/corr/abs-1004-2810,\n  author    = {Franck Cassez and\n               Stavros Tripakis},\n  title     = {Fault Diagnosis with Dynamic Observers},\n  journal   = {CoRR},\n  Type = {E - Reports},\n  volume    = {abs/1004.2810},\n  year      = {2010},\n  url       = {http://arxiv.org/abs/1004.2810},\n  timestamp = {Mon, 05 Dec 2011 18:05:22 +0100},\n  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1004-2810},\n  bibsource = {dblp computer science bibliography, http://dblp.org},\n    keywords = {fault diagnosis, timed automata},\n\n  abstract = {In this paper, we review some recent results about the use of dynamic observers for fault diagnosis of discrete event systems. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in the plant as soon as possible after their occurrence. Existing literature on this problem has considered the case of fixed static observers, where the set of observable events is fixed and does not change during execution of the system. In this paper, we consider dynamic observers: an observer can &quot;switch&quot; sensors on or off, thus dynamically changing the set of events it wishes to observe. It is known that checking diagnosability (i.e., whether a given observer is capable of identifying faults) can be solved in polynomial time for static observers, and we show that the same is true for dynamic ones. We also solve the problem of dynamic observers&#x27; synthesis and prove that a most permissive observer can be computed in doubly exponential time, using a game-theoretic approach. We further investigate optimization problems for dynamic observers and define a notion of cost of an observer.}\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper, we review some recent results about the use of dynamic observers for fault diagnosis of discrete event systems. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in the plant as soon as possible after their occurrence. Existing literature on this problem has considered the case of fixed static observers, where the set of observable events is fixed and does not change during execution of the system. In this paper, we consider dynamic observers: an observer can \"switch\" sensors on or off, thus dynamically changing the set of events it wishes to observe. It is known that checking diagnosability (i.e., whether a given observer is capable of identifying faults) can be solved in polynomial time for static observers, and we show that the same is true for dynamic ones. We also solve the problem of dynamic observers' synthesis and prove that a most permissive observer can be computed in doubly exponential time, using a game-theoretic approach. We further investigate optimization problems for dynamic observers and define a notion of cost of an observer.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-timedgamesforcomputingworstcaseexecutiontimes-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://arxiv.org/abs/1006.1951\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-timedgamesforcomputingworstcaseexecutiontimes-2010', 'http://arxiv.org/abs/1006.1951', event);\">\n    Timed Games for Computing Worst-Case Execution-Times.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>\n</span>\n\n  \n\n</span>\n\n  <i>CoRR</i>, abs/1006.1951.  2010.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://arxiv.org/abs/1006.1951\"\n     onclick=\"log_download('cassez-timedgamesforcomputingworstcaseexecutiontimes-2010', 'http://arxiv.org/abs/1006.1951', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Timed Games for Computing Worst-Case Execution-Times [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-timedgamesforcomputingworstcaseexecutiontimes-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-timedgamesforcomputingworstcaseexecutiontimes-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/corr/abs-1006-1951,\n  author    = {Franck Cassez},\n  title     = {Timed Games for Computing Worst-Case Execution-Times},\n  journal   = {CoRR},\n  Type = {E - Reports},\n  volume    = {abs/1006.1951},\n  year      = {2010},\n  url       = {http://arxiv.org/abs/1006.1951},\n  timestamp = {Mon, 05 Dec 2011 18:04:54 +0100},\n  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1006-1951},\n  bibsource = {dblp computer science bibliography, http://dblp.org},\n    keywords = {wcet, timed automata},\n\n  abstract= {In this paper we introduce a framework for computing upper bounds yet accurate WCET for hardware platforms with caches and pipelines. The methodology we propose consists of 3 steps: 1) given a program to analyse, compute an equivalent (WCET-wise) abstract program; 2) build a timed game by composing this abstract program with a network of timed automata modeling the architecture; and 3) compute the WCET as the optimal time to reach a winning state in this game. We demonstrate the applicability of our framework on standard benchmarks for an ARM9 processor with instruction and data caches, and compute the WCET with UPPAAL-TiGA. We also show that this framework can easily be extended to take into account dynamic changes in the speed of the processor during program execution.}\n}\n\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n%%% 2009\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper we introduce a framework for computing upper bounds yet accurate WCET for hardware platforms with caches and pipelines. The methodology we propose consists of 3 steps: 1) given a program to analyse, compute an equivalent (WCET-wise) abstract program; 2) build a timed game by composing this abstract program with a network of timed automata modeling the architecture; and 3) compute the WCET as the optimal time to reach a winning state in this game. We demonstrate the applicability of our framework on standard benchmarks for an ARM9 processor with instruction and data caches, and compute the WCET with UPPAAL-TiGA. We also show that this framework can easily be extended to take into account dynamic changes in the speed of the processor during program execution.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2009\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2009')\"\n      onkeypress=\"toggleGroup('group_2009')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2009</span>\n      <span class=\"bibbase_group_count\">\n        \n        (8)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"cassez-dubreil-marchand-dynamicobserversforthesynthesisofopaquesystems-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/atva-09.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-dubreil-marchand-dynamicobserversforthesynthesisofopaquesystems-2009', 'https://franck44.github.io/publications/papers/atva-09.pdf', event);\">\n    Dynamic Observers for the Synthesis of Opaque Systems.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Dubreil, J.;  and Marchand, H.\n</span>\n\n  \n\n</span>\n\n  In Liu, Z.;  and Ravn, A. P., editor(s), <i>Automated Technology for Verification and Analysis, 7th International Symposium, ATVA 2009, Macao, China, October 14-16, 2009. Proceedings</i>, volume 5799, of <i>Lecture Notes in Computer Science</i>, pages 352–367,  2009. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/atva-09.pdf\"\n     onclick=\"log_download('cassez-dubreil-marchand-dynamicobserversforthesynthesisofopaquesystems-2009', 'https://franck44.github.io/publications/papers/atva-09.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Dynamic Observers for the Synthesis of Opaque Systems [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://franck44.github.io/publications/papers/slides-atva-09.pdf\"\n     onclick=\"log_download('cassez-dubreil-marchand-dynamicobserversforthesynthesisofopaquesystems-2009', 'https://franck44.github.io/publications/papers/slides-atva-09.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Dynamic Observers for the Synthesis of Opaque Systems [pdf]\"\n       title=\"Slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Slides</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-642-04761-9_26\"\n     onclick=\"log_download('cassez-dubreil-marchand-dynamicobserversforthesynthesisofopaquesystems-2009', 'http://doi.org/10.1007/978-3-642-04761-9_26', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-dubreil-marchand-dynamicobserversforthesynthesisofopaquesystems-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-dubreil-marchand-dynamicobserversforthesynthesisofopaquesystems-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/atva/CassezDM09,\n  author    = {Franck Cassez and\n               J{\\&#x27;{e}}r{\\&#x27;{e}}my Dubreil and\n               Herv{\\&#x27;{e}} Marchand},\n                 editor    = {Zhiming Liu and\n               Anders P. Ravn},\n  title     = {Dynamic Observers for the Synthesis of Opaque Systems},\n  booktitle = {Automated Technology for Verification and Analysis, 7th International\n               Symposium, {ATVA} 2009, Macao, China, October 14-16, 2009. Proceedings},\n  pages     = {352--367},\n  year      = {2009},\n    series    = {Lecture Notes in Computer Science},\n  volume    = {5799},\n  publisher = {Springer},\n  url       = {http://dx.doi.org/10.1007/978-3-642-04761-9_26},\n  doi       = {10.1007/978-3-642-04761-9_26},\n    urlpaper = {papers/atva-09.pdf},\n  urlslides = {papers/slides-atva-09.pdf},\n        Type = {B - International Conferences},\n\n  ABSTRACT = {   In this paper, we address the problem of synthesizing \\emph{opaque}\n  systems by selecting the set of observable\n  events.\n  We first investigate the case of \\emph{static}  observability\n  where the set of observable events\n  is fixed a priori.  In this context, we show that checking whether a\n  system is opaque and computing an optimal static observer ensuring\n  opacity are both PSPACE-complete problems.\n  Next, we introduce \\emph{dynamic} partial observability where the\n  set of observable events\n  can\n  change over time.\n  We show how to check that a system is opaque \\wrt a dynamic observer\n  and also address the corresponding synthesis problem: given a system\n  $G$ and secret states $S$, compute the set of dynamic observers\n  under which $S$ is opaque. Our main result is that the synthesis\n  problem can be solved in EXPTIME.},\n}\n\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper, we address the problem of synthesizing \\emphopaque systems by selecting the set of observable events. We first investigate the case of \\emphstatic observability where the set of observable events is fixed a priori. In this context, we show that checking whether a system is opaque and computing an optimal static observer ensuring opacity are both PSPACE-complete problems. Next, we introduce \\emphdynamic partial observability where the set of observable events can change over time. We show how to check that a system is opaque ≀t a dynamic observer and also address the corresponding synthesis problem: given a system $G$ and secret states $S$, compute the set of dynamic observers under which $S$ is opaque. Our main result is that the synthesis problem can be solved in EXPTIME.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-anoteonfaultdiagnosisalgorithms-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/cdc-09.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-anoteonfaultdiagnosisalgorithms-2009', 'https://franck44.github.io/publications/papers/cdc-09.pdf', event);\">\n    A note on fault diagnosis algorithms.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>\n</span>\n\n  \n\n</span>\n\n  In Ouaknine, J.;  and Vaandrager, F. W., editor(s), <i>Proceedings of the 48th IEEE Conference on Decision and Control, CDC 2009, combined withe the 28th Chinese Control Conference, December 16-18, 2009, Shanghai, China</i>, pages 6941–6946,  2009. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/cdc-09.pdf\"\n     onclick=\"log_download('cassez-anoteonfaultdiagnosisalgorithms-2009', 'https://franck44.github.io/publications/papers/cdc-09.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"A note on fault diagnosis algorithms [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://franck44.github.io/publications/papers/slides-cdc-09.pdf\"\n     onclick=\"log_download('cassez-anoteonfaultdiagnosisalgorithms-2009', 'https://franck44.github.io/publications/papers/slides-cdc-09.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"A note on fault diagnosis algorithms [pdf]\"\n       title=\"Slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Slides</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/CDC.2009.5399968\"\n     onclick=\"log_download('cassez-anoteonfaultdiagnosisalgorithms-2009', 'http://doi.org/10.1109/CDC.2009.5399968', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-anoteonfaultdiagnosisalgorithms-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-anoteonfaultdiagnosisalgorithms-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/cdc/Cassez09,\n  author    = {Franck Cassez},\n  title     = {A note on fault diagnosis algorithms},\n  booktitle = {Proceedings of the 48th {IEEE} Conference on Decision and Control,\n               {CDC} 2009, combined withe the 28th Chinese Control Conference, December\n               16-18, 2009, Shanghai, China},\n  editor    = {Jo{\\&quot;{e}}l Ouaknine and\n               Frits W. Vaandrager},\n  pages     = {6941--6946},\n  year      = {2009},\n   publisher = {{IEEE}},\n  year      = {2009},\n  url       = {http://dx.doi.org/10.1109/CDC.2009.5399968},\n  doi       = {10.1109/CDC.2009.5399968},\n  ABSTRACT = {   In this paper we review algorithms for checking diagnosability of\n  discrete-event systems and timed automata. We point out that the\n  diagnosability problems in both cases reduce to the emptiness\n  problem for (timed) B\\&quot;uchi automata. Moreover, it is known that,\n  checking whether a discrete-event system is diagnosable, can also be\n  reduced to checking bounded diagnosability. We establish a similar\n  result for timed automata.  We also provide a synthesis of the\n  complexity results for the different fault diagnosis problems.},\n  urlpaper = {papers/cdc-09.pdf},\n  urlslides = {papers/slides-cdc-09.pdf},\n        Type = {B - International Conferences},\n\n  keywords = {diagnosis, timed automata},\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper we review algorithms for checking diagnosability of discrete-event systems and timed automata. We point out that the diagnosability problems in both cases reduce to the emptiness problem for (timed) Büchi automata. Moreover, it is known that, checking whether a discrete-event system is diagnosable, can also be reduced to checking bounded diagnosability. We establish a similar result for timed automata. We also provide a synthesis of the complexity results for the different fault diagnosis problems.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"benattar-cassez-lime-roux-synthesisofnoninterferenttimedsystems-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/formats-09.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'benattar-cassez-lime-roux-synthesisofnoninterferenttimedsystems-2009', 'https://franck44.github.io/publications/papers/formats-09.pdf', event);\">\n    Synthesis of Non-Interferent Timed Systems.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Benattar, G.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Lime, D.;  and Roux, O. H.\n</span>\n\n  \n\n</span>\n\n  In <i>Formal Modeling and Analysis of Timed Systems, 7th International Conference, FORMATS 2009, Budapest, Hungary, September 14-16, 2009. Proceedings</i>, volume 5813, of <i>Lecture Notes in Computer Science</i>, pages 28–42,  2009. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/formats-09.pdf\"\n     onclick=\"log_download('benattar-cassez-lime-roux-synthesisofnoninterferenttimedsystems-2009', 'https://franck44.github.io/publications/papers/formats-09.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Synthesis of Non-Interferent Timed Systems [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://franck44.github.io/publications/papers/slides-formats-09.pdf\"\n     onclick=\"log_download('benattar-cassez-lime-roux-synthesisofnoninterferenttimedsystems-2009', 'https://franck44.github.io/publications/papers/slides-formats-09.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Synthesis of Non-Interferent Timed Systems [pdf]\"\n       title=\"Slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Slides</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-642-04368-0_5\"\n     onclick=\"log_download('benattar-cassez-lime-roux-synthesisofnoninterferenttimedsystems-2009', 'http://doi.org/10.1007/978-3-642-04368-0_5', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/benattar-cassez-lime-roux-synthesisofnoninterferenttimedsystems-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('benattar-cassez-lime-roux-synthesisofnoninterferenttimedsystems-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/formats/BenattarCLR09,\n  author    = {Gilles Benattar and\n               Franck Cassez and\n               Didier Lime and\n               Olivier H. Roux},\n  title     = {Synthesis of Non-Interferent Timed Systems},\n  booktitle = {Formal Modeling and Analysis of Timed Systems, 7th International Conference,\n               {FORMATS} 2009, Budapest, Hungary, September 14-16, 2009. Proceedings},\n  pages     = {28--42},\n  year      = {2009},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {5813},\n  publisher = {Springer},\n  url       = {http://dx.doi.org/10.1007/978-3-642-04368-0_5},\n  doi       = {10.1007/978-3-642-04368-0_5},\n  urlpaper = {papers/formats-09.pdf},\n  urlslides = {papers/slides-formats-09.pdf},\n   ABSTRACT = {  In this paper, we focus on the synthesis of secure timed systems\n  which are given by timed automata.\n  The security property that the system must satisfy is a\n  \\emph{non-interference} property.\n  Various notions of non-interference have been defined in the\n  literature, and in this paper we focus on \\emph{Strong\n    Non-deterministic Non-Interference} (SNNI)\n  and we study the two following problems: ($1$) check whether it is\n  possible to enforce a system to be SNNI; if yes ($2$) compute a\n  sub-system which is SNNI.},\n        Type = {B - International Conferences},\n\n  keywords = {security, timed automata}\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper, we focus on the synthesis of secure timed systems which are given by timed automata. The security property that the system must satisfy is a \\emphnon-interference property. Various notions of non-interference have been defined in the literature, and in this paper we focus on \\emphStrong Non-deterministic Non-Interference (SNNI) and we study the two following problems: ($1$) check whether it is possible to enforce a system to be SNNI; if yes ($2$) compute a sub-system which is SNNI.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-jessen-larsen-raskin-reynier-automaticsynthesisofrobustandoptimalcontrollersanindustrialcasestudy-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/hscc-09.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-jessen-larsen-raskin-reynier-automaticsynthesisofrobustandoptimalcontrollersanindustrialcasestudy-2009', 'https://franck44.github.io/publications/papers/hscc-09.pdf', event);\">\n    Automatic Synthesis of Robust and Optimal Controllers - An Industrial Case Study.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Jessen, J. J.; Larsen, K. G.; Raskin, J.;  and Reynier, P.\n</span>\n\n  \n\n</span>\n\n  In Majumdar, R.;  and Tabuada, P., editor(s), <i>Hybrid Systems: Computation and Control, 12th International Conference, HSCC 2009, San Francisco, CA, USA, April 13-15, 2009. Proceedings</i>, volume 5469, of <i>Lecture Notes in Computer Science</i>, pages 90–104,  2009. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/hscc-09.pdf\"\n     onclick=\"log_download('cassez-jessen-larsen-raskin-reynier-automaticsynthesisofrobustandoptimalcontrollersanindustrialcasestudy-2009', 'https://franck44.github.io/publications/papers/hscc-09.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Automatic Synthesis of Robust and Optimal Controllers - An Industrial Case Study [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-642-00602-9_7\"\n     onclick=\"log_download('cassez-jessen-larsen-raskin-reynier-automaticsynthesisofrobustandoptimalcontrollersanindustrialcasestudy-2009', 'http://doi.org/10.1007/978-3-642-00602-9_7', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-jessen-larsen-raskin-reynier-automaticsynthesisofrobustandoptimalcontrollersanindustrialcasestudy-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-jessen-larsen-raskin-reynier-automaticsynthesisofrobustandoptimalcontrollersanindustrialcasestudy-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/hybrid/CassezJLRR09,\n  author    = {Franck Cassez and\n               Jan Jakob Jessen and\n               Kim Guldstrand Larsen and\n               Jean{-}Fran{\\c{c}}ois Raskin and\n               Pierre{-}Alain Reynier},\n  editor    = {Rupak Majumdar and\n               Paulo Tabuada},\n  title     = {Automatic Synthesis of Robust and Optimal Controllers - An Industrial\n               Case Study},\n  booktitle = {Hybrid Systems: Computation and Control, 12th International Conference,\n               {HSCC} 2009, San Francisco, CA, USA, April 13-15, 2009. Proceedings},\n  pages     = {90--104},\n  year      = {2009},\n  crossref  = {DBLP:conf/hybrid/2009},\n  url       = {http://dx.doi.org/10.1007/978-3-642-00602-9_7},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {5469},\n  publisher = {Springer},\n  doi       = {10.1007/978-3-642-00602-9_7},\n  urlpaper = {papers/hscc-09.pdf},\n  keywords = {control, synthesis, hybrid automata},\n        Type = {B - International Conferences},\n\n  abstract = { Int his paper,we show how to apply recent tools for the automatic synthesis of robust and near-optimal controllers for a real industrial case study. We show how to use three different classes of models and their supporting existing tools, UPPAAL-TIGA for synthesis, PHAVER for verification, and SIMULINK for simulation, in a complementary way. We believe that this case study shows that our tools have reached a level of maturity that allows us to tackle interesting and relevant industrial control problems.}\n }\n\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Int his paper,we show how to apply recent tools for the automatic synthesis of robust and near-optimal controllers for a real industrial case study. We show how to use three different classes of models and their supporting existing tools, UPPAAL-TIGA for synthesis, PHAVER for verification, and SIMULINK for simulation, in a complementary way. We believe that this case study shows that our tools have reached a level of maturity that allows us to tackle interesting and relevant industrial control problems.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-thedarksideoftimedopacity-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/isa-09.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-thedarksideoftimedopacity-2009', 'https://franck44.github.io/publications/papers/isa-09.pdf', event);\">\n    The Dark Side of Timed Opacity.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>\n</span>\n\n  \n\n</span>\n\n  In Park, J. H.; Chen, H.; Atiquzzaman, M.; Lee, C.; Kim, T.;  and Yeo, S., editor(s), <i>Advances in Information Security and Assurance, Third International Conference and Workshops, ISA 2009, Seoul, Korea, June 25-27, 2009. Proceedings</i>, volume 5576, of <i>Lecture Notes in Computer Science</i>, pages 21–30,  2009. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/isa-09.pdf\"\n     onclick=\"log_download('cassez-thedarksideoftimedopacity-2009', 'https://franck44.github.io/publications/papers/isa-09.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"The Dark Side of Timed Opacity [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://franck44.github.io/publications/papers/slides-isa-09.pdf\"\n     onclick=\"log_download('cassez-thedarksideoftimedopacity-2009', 'https://franck44.github.io/publications/papers/slides-isa-09.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"The Dark Side of Timed Opacity [pdf]\"\n       title=\"Slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Slides</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-642-02617-1_3\"\n     onclick=\"log_download('cassez-thedarksideoftimedopacity-2009', 'http://doi.org/10.1007/978-3-642-02617-1_3', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-thedarksideoftimedopacity-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-thedarksideoftimedopacity-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/sersc-isa/Cassez09,\n  author    = {Franck Cassez},\n  title     = {The Dark Side of Timed Opacity},\n  editor    = {Jong Hyuk Park and\n               Hsiao{-}Hwa Chen and\n               Mohammed Atiquzzaman and\n               Changhoon Lee and\n               Tai{-}Hoon Kim and\n               Sang{-}Soo Yeo},\n  booktitle = {Advances in Information Security and Assurance, Third International\n               Conference and Workshops, {ISA} 2009, Seoul, Korea, June 25-27, 2009.\n               Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {5576},\n  publisher = {Springer},\n  pages     = {21--30},\n  year      = {2009},\n  crossref  = {DBLP:conf/sersc-isa/2009},\n  urlpaper       = {papers/isa-09.pdf},\n  urlslides = {papers/slides-isa-09.pdf},\n        Type = {B - International Conferences},\n\n  doi       = {10.1007/978-3-642-02617-1_3},\n}\n\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-markey-communicatingembeddedsystems-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/iste-wiley-book-control.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-markey-communicatingembeddedsystems-2009', 'https://franck44.github.io/publications/papers/iste-wiley-book-control.pdf', event);\">\n    Communicating Embedded Systems.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Markey, N.\n</span>\n\n  \n\n</span>\n\n  Communicating Embedded Systems, pages 83–120. Jard, C.;  and Roux, O. H., editor(s). ISTE Ltd. – John Wiley &amp; Sons, Ltd, October 2009.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/iste-wiley-book-control.pdf\"\n     onclick=\"log_download('cassez-markey-communicatingembeddedsystems-2009', 'https://franck44.github.io/publications/papers/iste-wiley-book-control.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Communicating Embedded Systems [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-markey-communicatingembeddedsystems-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-markey-communicatingembeddedsystems-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inbook{cassez-control-iste-2009,\n   author = {Franck Cassez and Markey, Nicolas},\n   title = {Communicating Embedded Systems},\n   editor = {Jard, Claude and Roux, Olivier H.},\n   month = oct,\n   pages = {83--120},\n   publisher = {ISTE Ltd. -- John Wiley \\&amp;amp; Sons, Ltd},\n   chapter = {Control of Timed Systems},\n  xxurl = {http://www.iste.co.uk/index.php?ACTION=Browse&amp;amp;CatParent=FUB2},\n   year = {2009},\n  urlpaper = {papers/iste-wiley-book-control.pdf},\nabstract={In this book Chapter we address the problem of controller synthesis for timed systems. By\ntimed systems we refer to systems which are subject to quantitative (hard) real-time\nconstraints. We assume the reader is familiar with the basics of Timed Automata\ntheory, or has read Chapter 1 and Chapter 2 in this book. },\nXXnote={Draft version may differ from published one.},\n      Type = {C - Book Chapters},\n\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this book Chapter we address the problem of controller synthesis for timed systems. By timed systems we refer to systems which are subject to quantitative (hard) real-time constraints. We assume the reader is familiar with the basics of Timed Automata theory, or has read Chapter 1 and Chapter 2 in this book. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-tripakis-communicatingembeddedsystems-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/iste-wiley-book-diag.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-tripakis-communicatingembeddedsystems-2009', 'https://franck44.github.io/publications/papers/iste-wiley-book-diag.pdf', event);\">\n    Communicating Embedded Systems.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Tripakis, S.\n</span>\n\n  \n\n</span>\n\n  Communicating Embedded Systems, pages 120–151. Jard, C.;  and Roux, O. H., editor(s). ISTE Ltd. – John Wiley &amp; Sons, Ltd, October 2009.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/iste-wiley-book-diag.pdf\"\n     onclick=\"log_download('cassez-tripakis-communicatingembeddedsystems-2009', 'https://franck44.github.io/publications/papers/iste-wiley-book-diag.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Communicating Embedded Systems [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-tripakis-communicatingembeddedsystems-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-tripakis-communicatingembeddedsystems-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inbook{cassez-diag-iste-2009,\n   author = {Franck Cassez and Tripakis, Stavros},\n   title = {Communicating Embedded Systems},\n   editor = {Jard, Claude and Roux, Olivier H.},\n   month = oct,\n   pages = {120--151},\n   publisher = {ISTE Ltd. -- John Wiley \\&amp;amp; Sons, Ltd},\n   chapter = {Fault Diagnosis of Timed Systems},\n  xxurl = {http://www.iste.co.uk/index.php?ACTION=Browse&amp;amp;CatParent=FUB2},\n   year = {2009},\n      Type = {C - Book Chapters},\n\n  urlpaper = {papers/iste-wiley-book-diag.pdf},\nabstract={In this book Chapter, we review the main results pertaining\n                  to the problem of fault diagnosis of timed\n                  automata. Timed automata are introduced in Chapter 1\n                  and Chapter 2 in this book, and the reader not\n                  familiar with this model is invited to read them\n                  first.},\nXXnote={Draft version  may differ from published one.}\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this book Chapter, we review the main results pertaining to the problem of fault diagnosis of timed automata. Timed automata are introduced in Chapter 1 and Chapter 2 in this book, and the reader not familiar with this model is invited to read them first.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-howtoinstallphaveronmacosx-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/install-phaver-09.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-howtoinstallphaveronmacosx-2009', 'https://franck44.github.io/publications/papers/install-phaver-09.pdf', event);\">\n    How to Install PHAVer on Mac OS X.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>\n</span>\n\n  \n\n</span>\n\n  Short Note, NICTA, Sydney, Australia,  2009.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/install-phaver-09.pdf\"\n     onclick=\"log_download('cassez-howtoinstallphaveronmacosx-2009', 'https://franck44.github.io/publications/papers/install-phaver-09.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"How to Install PHAVer on Mac OS X [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"http://www-verimag.imag.fr/~frehse/phaver_web/index.html\"\n     onclick=\"log_download('cassez-howtoinstallphaveronmacosx-2009', 'http://www-verimag.imag.fr/~frehse/phaver_web/index.html', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"How to Install PHAVer on Mac OS X [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-howtoinstallphaveronmacosx-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-howtoinstallphaveronmacosx-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@MISC{cassez-compile-phaver-09,\n  AUTHOR = {Franck Cassez},\n HOWPUBLISHED = {Short Note, NICTA, Sydney, Australia},\n  KEYWORDS = {PHAVer, OS X},\n  TITLE = {{How to Install PHAVer on Mac OS X}},\n  urlpaper = {papers/install-phaver-09.pdf},\n  YEAR = {2009},\nURL_link={http://www-verimag.imag.fr/~frehse/phaver_web/index.html},\nabstract={This short note explains how to install PHAVer (and the\n                  needed libraries) for a single user on Mac OS X\n                  running Leopard (10.5.6). It might also work for\n                  earlier versions (you can report to me in case of a\n                  successful install on earlier version).},\n Type = {E - Reports},\n}\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n%%% 2008\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This short note explains how to install PHAVer (and the needed libraries) for a single user on Mac OS X running Leopard (10.5.6). It might also work for earlier versions (you can report to me in case of a successful install on earlier version).\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2008\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2008')\"\n      onkeypress=\"toggleGroup('group_2008')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2008</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"cassez-jard-formalmodelingandanalysisoftimedsystems6thinternationalconferenceformats2008saintmalofranceseptember15172008proceedings-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Formal Modeling and Analysis of Timed Systems, 6th International Conference, FORMATS 2008, Saint Malo, France, September 15-17, 2008. Proceedings.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Jard, C.,\n  editors.\n  \n</span>\n\n  \n\n</span>\n\n  Volume 5215, of Lecture Notes in Computer Science.springv.  2008.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-jard-formalmodelingandanalysisoftimedsystems6thinternationalconferenceformats2008saintmalofranceseptember15172008proceedings-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-jard-formalmodelingandanalysisoftimedsystems6thinternationalconferenceformats2008saintmalofranceseptember15172008proceedings-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@proceedings{cassez-formats-2008,\n  editor    = {Franck Cassez and\n               Claude Jard},\n  title     = {Formal Modeling and Analysis of Timed Systems, 6th International Conference,\n               {FORMATS} 2008, Saint Malo, France, September 15-17, 2008. Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {5215},\n  publisher = springv,\n  year      = {2008},\n  isbn      = {978-3-540-85777-8},\n          Type = {D - Conference Proceedings},\n\n  timestamp = {Fri, 05 Sep 2008 08:05:45 +0200},\n  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/formats/2008},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-tripakis-faultdiagnosiswithstaticanddynamicdiagnosers-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/diag-fi-08.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-tripakis-faultdiagnosiswithstaticanddynamicdiagnosers-2008', 'https://franck44.github.io/publications/papers/diag-fi-08.pdf', event);\">\n    Fault Diagnosis with Static and Dynamic Diagnosers.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Tripakis, S.\n</span>\n\n  \n\n</span>\n\n  <i>Fundamenta Informaticae</i>, 88(4): 497–540. November 2008.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/diag-fi-08.pdf\"\n     onclick=\"log_download('cassez-tripakis-faultdiagnosiswithstaticanddynamicdiagnosers-2008', 'https://franck44.github.io/publications/papers/diag-fi-08.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Fault Diagnosis with Static and Dynamic Diagnosers [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-tripakis-faultdiagnosiswithstaticanddynamicdiagnosers-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-tripakis-faultdiagnosiswithstaticanddynamicdiagnosers-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{cassez-fi-08,\n  AUTHOR = {Franck Cassez and Tripakis, Stavros},\n  TITLE = {Fault Diagnosis with Static and Dynamic Diagnosers},\n  JOURNAL = {Fundamenta Informaticae},\n  YEAR = {2008},\n    Type = {A - Journal},\n\n  VOLUME = {88},\n  NUMBER = {4},\n  PAGES = {497--540},\n  keywords = {fault diagnosis, automata},\n  MONTH = NOV,\n  ABSTRACT = {We study sensor minimization problems in the context of\n                  fault diagnosis. Fault diagnosis consists in\n                  synthesizing a diagnoser that observes a given plant\n                  and identifies faults in the plant as soon as\n                  possible after their occurrence. Existing literature\n                  on this problem has considered the case of fixed\n                  static observers, where the set of observable events\n                  is fixed and does not change during execution of the\n                  system. In this paper, we consider static observers\n                  where the set of observable events is not fixed, but\n                  needs to be optimized (e.g., minimized in size). We\n                  also consider dynamic observers, where the observer\n                  can &#x60;&#x60;switc&#x27;&#x27; sensors on or off, thus dynamically\n                  changing the set of events it wishes to observe. It\n                  is known that checking diagnosability (i.e., whether\n                  a given observer is capable of identifying faults)\n                  can be solved in polynomial time for static\n                  observers, and we show that the same is true for\n                  dynamic ones. On the other hand, minimizing the\n                  number of (static) observable events required to\n                  achieve diagnosability is NP-complete. We show that\n                  this is true also in the case of mask-based\n                  observation, where some events are observable but\n                  not distinguishable. For dynamic observers&#x27;\n                  synthesis, we prove that a most permissive\n                  finite-state observer can be computed in doubly\n                  exponential time, using a game-theoretic\n                  approach. We further investigate optimization\n                  problems for dynamic observers and define a notion of\n                  cost of an observer. We show how to compute an\n                  optimal observer using results on mean-payoff games\n                  by Zwick and Paterson.  },\n  urlpaper = {papers/diag-fi-08.pdf},\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We study sensor minimization problems in the context of fault diagnosis. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in the plant as soon as possible after their occurrence. Existing literature on this problem has considered the case of fixed static observers, where the set of observable events is fixed and does not change during execution of the system. In this paper, we consider static observers where the set of observable events is not fixed, but needs to be optimized (e.g., minimized in size). We also consider dynamic observers, where the observer can ``switc'' sensors on or off, thus dynamically changing the set of events it wishes to observe. It is known that checking diagnosability (i.e., whether a given observer is capable of identifying faults) can be solved in polynomial time for static observers, and we show that the same is true for dynamic ones. On the other hand, minimizing the number of (static) observable events required to achieve diagnosability is NP-complete. We show that this is true also in the case of mask-based observation, where some events are observable but not distinguishable. For dynamic observers' synthesis, we prove that a most permissive finite-state observer can be computed in doubly exponential time, using a game-theoretic approach. We further investigate optimization problems for dynamic observers and define a notion of cost of an observer. We show how to compute an optimal observer using results on mean-payoff games by Zwick and Paterson. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"brard-cassez-haddad-lime-roux-whenaretimedautomataweaklytimedbisimilartotimepetrinets-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/tcs-2008.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'brard-cassez-haddad-lime-roux-whenaretimedautomataweaklytimedbisimilartotimepetrinets-2008', 'https://franck44.github.io/publications/papers/tcs-2008.pdf', event);\">\n    When are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bérard, B.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Haddad, S.; Lime, D.;  and Roux, O. H.\n</span>\n\n  \n\n</span>\n\n  <i>Theoretical Computer Science</i>, 403(2–3): 202–220.  2008.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/tcs-2008.pdf\"\n     onclick=\"log_download('brard-cassez-haddad-lime-roux-whenaretimedautomataweaklytimedbisimilartotimepetrinets-2008', 'https://franck44.github.io/publications/papers/tcs-2008.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"When are Timed Automata Weakly Timed Bisimilar to Time Petri Nets? [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/brard-cassez-haddad-lime-roux-whenaretimedautomataweaklytimedbisimilartotimepetrinets-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('brard-cassez-haddad-lime-roux-whenaretimedautomataweaklytimedbisimilartotimepetrinets-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{BCHLR08-tcs,\n  AUTHOR = {B{\\&#x27;e}rard, B{\\&#x27;e}atrice and Franck Cassez and Haddad, Serge and Lime, Didier and Roux, Olivier H.},\n  JOURNAL = {Theoretical Computer Science},\n  PUBLISHER = {Elsevier},\n  VOLUME = 403,\n  NUMBER = {2--3},\n  PAGES = {202--220},\n    Type = {A - Journal},\n\n  TITLE = {When are Timed Automata Weakly Timed Bisimilar to Time {P}etri Nets?},\n  YEAR = {2008},\n  urlpaper = {papers/tcs-2008.pdf},\n  abstract = {In this paper, we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly included in the class of TA. It is thus natural to try and identify the subclass of TA equivalent to some TPN for the weak timed bisimulation relation. We give a characterization of this subclass and we show that the membership problem and the reachability problem  are PSPACE-complete. Furthermore we show that for a TA in this class with integer constants, an equivalent TPN can be built with integer bounds but with a size exponential w.r.t. the original model. Surprisingly, using rational bounds yields a TPN whose size is linear.}\n}\n\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper, we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly included in the class of TA. It is thus natural to try and identify the subclass of TA equivalent to some TPN for the weak timed bisimulation relation. We give a characterization of this subclass and we show that the membership problem and the reachability problem are PSPACE-complete. Furthermore we show that for a TA in this class with integer constants, an equivalent TPN can be built with integer bounds but with a size exponential w.r.t. the original model. Surprisingly, using rational bounds yields a TPN whose size is linear.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-roux-petrinetstheoryandapplications-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://intechweb.org/books.php\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-roux-petrinetstheoryandapplications-2008', 'http://intechweb.org/books.php', event);\">\n    Petri Nets – Theory and Applications.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Roux, O. H.\n</span>\n\n  \n\n</span>\n\n   of I-Tech Education Online. Petri Nets – Theory and Applications, pages 225–252. Kordic, V., editor(s). ARS-VIENNA,  2008.\n  <span class=\"note\">Free download from ˘rlhttp://intechweb.org/books.php.</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://intechweb.org/books.php\"\n     onclick=\"log_download('cassez-roux-petrinetstheoryandapplications-2008', 'http://intechweb.org/books.php', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Petri Nets – Theory and Applications [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-roux-petrinetstheoryandapplications-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-roux-petrinetstheoryandapplications-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@INBOOK{ars-petri-nets,\n  AUTHOR = {Cassez, Franck and Roux, Olivier H.},\n  EDITOR = {Kordic, Vedran},\n  TITLE = {Petri Nets -- Theory and Applications},\n  CHAPTER = {From Time Petri Nets to Timed Automata},\n  PUBLISHER = ARS-VIENNA,\n  YEAR = {2008},\n  SERIES = {{I}-Tech {E}ducation {O}nline},\n URL= {http://intechweb.org/books.php},\n  PAGES = {225--252},\n  PDF = {papers/tpn-book-08.pdf},\n  ISBN = {ISBN 978-3-902613-12-7},\nNOTE={Free download from \\url{http://intechweb.org/books.php}.},\n  ABSTRACT = {In this chapter we introduce a formalism, \\emph{Time\n                  Petri Nets (TPNs)}, to model real-time systems. We\n                  compare it with another well-known formalism,\n                  \\emph{Timed Automata (TA)}, used for specifying\n                  timed systems.  We precisely define the semantics of\n                  TPNs and TA and compare them according to two\n                  criteria: the \\emph{languages} (or set of\n                  behaviours) then can generate, and the \\emph{trees}\n                  (or branching behaviours) they can generate.  We\n                  show that every TPN can be translated into an\n                  equivalent TA.  Then, we introduce a real-time logic\n                  to specify properties of real-time systems. We show\n                  how to check that a given TPN satisfies a property\n                  written in this logic. For this we use our\n                  translation\\footnote{This translation preserves the\n                  properties of this logic.} from TPNs to TA and check\n                  the property on the equivalent TA. Finally we\n                  briefly report on experiments for checking real-time\n                  properties of TPNs using this framework. },\n    Type = {C - Book Chapters},\n}\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n%%% 2007\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this chapter we introduce a formalism, \\emphTime Petri Nets (TPNs), to model real-time systems. We compare it with another well-known formalism, \\emphTimed Automata (TA), used for specifying timed systems. We precisely define the semantics of TPNs and TA and compare them according to two criteria: the \\emphlanguages (or set of behaviours) then can generate, and the \\emphtrees (or branching behaviours) they can generate. We show that every TPN can be translated into an equivalent TA. Then, we introduce a real-time logic to specify properties of real-time systems. We show how to check that a given TPN satisfies a property written in this logic. For this we use our translation\\footnoteThis translation preserves the properties of this logic. from TPNs to TA and check the property on the equivalent TA. Finally we briefly report on experiments for checking real-time properties of TPNs using this framework. \n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2007\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2007')\"\n      onkeypress=\"toggleGroup('group_2007')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2007</span>\n      <span class=\"bibbase_group_count\">\n        \n        (5)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"bernot-cassez-comet-delaplace-mller-roux-roux-semanticsofbiologicalregulatorynetworks-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://dx.doi.org/10.1016/j.entcs.2004.01.038\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bernot-cassez-comet-delaplace-mller-roux-roux-semanticsofbiologicalregulatorynetworks-2007', 'http://dx.doi.org/10.1016/j.entcs.2004.01.038', event);\">\n    Semantics of Biological Regulatory Networks.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bernot, G.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Comet, J.; Delaplace, F.; Müller, C.; Roux, O.;  and Roux, O.\n</span>\n\n  \n\n</span>\n\n  <i>Electr. Notes Theor. Comput. Sci. (Proceedings of FORMATS 2003)</i>, 180(3): 3–14.  2007.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://dx.doi.org/10.1016/j.entcs.2004.01.038\"\n     onclick=\"log_download('bernot-cassez-comet-delaplace-mller-roux-roux-semanticsofbiologicalregulatorynetworks-2007', 'http://dx.doi.org/10.1016/j.entcs.2004.01.038', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Semantics of Biological Regulatory Networks [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1016/j.entcs.2004.01.038\"\n     onclick=\"log_download('bernot-cassez-comet-delaplace-mller-roux-roux-semanticsofbiologicalregulatorynetworks-2007', 'http://doi.org/10.1016/j.entcs.2004.01.038', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bernot-cassez-comet-delaplace-mller-roux-roux-semanticsofbiologicalregulatorynetworks-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bernot-cassez-comet-delaplace-mller-roux-roux-semanticsofbiologicalregulatorynetworks-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/entcs/BernotCCDMR07,\n  author    = {Gilles Bernot and\n               Franck Cassez and\n               Jean{-}Paul Comet and\n               Franck Delaplace and\n               C{\\&#x27;{e}}line M{\\&quot;{u}}ller and\n               {Olivier F.} Roux and {Olivier H.} Roux},\n  title     = {Semantics of Biological Regulatory Networks},\n  journal   = {Electr. Notes Theor. Comput. Sci. (Proceedings of FORMATS 2003)},\n  volume    = {180},\n  number    = {3},\n  pages     = {3--14},\n  year      = {2007},\n  url       = {http://dx.doi.org/10.1016/j.entcs.2004.01.038},\n  doi       = {10.1016/j.entcs.2004.01.038},\n  keywords = {bioinformatics, regulatory networks, hybrid systems},\n  abstract ={The aim of the paper is to revisit the model of Biological Regulatory Networks (BRN) which was proposed by René Thomas to model the interactions between a set of genes. We give a formal semantics for BRN in terms of transition systems which formalizes the evolution rules given by René Thomas. Then we show how to use this model to find interesting properties of a BRN like the set of stable states, cycles etc using tools for analyzing transition systems.},\n          Type = {B - International Conferences},\n\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The aim of the paper is to revisit the model of Biological Regulatory Networks (BRN) which was proposed by René Thomas to model the interactions between a set of genes. We give a formal semantics for BRN in terms of transition systems which formalizes the evolution rules given by René Thomas. Then we show how to use this model to find interesting properties of a BRN like the set of stable states, cycles etc using tools for analyzing transition systems.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-tripakis-altisen-sensorminimizationproblemswithstaticordynamicobserversforfaultdiagnosis-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/acsd07.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-tripakis-altisen-sensorminimizationproblemswithstaticordynamicobserversforfaultdiagnosis-2007', 'https://franck44.github.io/publications/papers/acsd07.pdf', event);\">\n    Sensor Minimization Problems with Static or Dynamic Observers for Fault Diagnosis.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Tripakis, S.;  and Altisen, K.\n</span>\n\n  \n\n</span>\n\n  In Basten, T.; Juhás, G.;  and Shukla, S. K., editor(s), <i>Seventh International Conference on Application of Concurrency to System Design (ACSD 2007), 10-13 July 2007, Bratislava, Slovak Republic</i>, pages 90–99,  2007. IEEE Computer Society\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/acsd07.pdf\"\n     onclick=\"log_download('cassez-tripakis-altisen-sensorminimizationproblemswithstaticordynamicobserversforfaultdiagnosis-2007', 'https://franck44.github.io/publications/papers/acsd07.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Sensor Minimization Problems with Static or Dynamic Observers for Fault Diagnosis [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://franck44.github.io/publications/papers/slides-acsd-07.pdf\"\n     onclick=\"log_download('cassez-tripakis-altisen-sensorminimizationproblemswithstaticordynamicobserversforfaultdiagnosis-2007', 'https://franck44.github.io/publications/papers/slides-acsd-07.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Sensor Minimization Problems with Static or Dynamic Observers for Fault Diagnosis [pdf]\"\n       title=\"Slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Slides</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ACSD.2007.65\"\n     onclick=\"log_download('cassez-tripakis-altisen-sensorminimizationproblemswithstaticordynamicobserversforfaultdiagnosis-2007', 'http://doi.org/10.1109/ACSD.2007.65', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-tripakis-altisen-sensorminimizationproblemswithstaticordynamicobserversforfaultdiagnosis-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-tripakis-altisen-sensorminimizationproblemswithstaticordynamicobserversforfaultdiagnosis-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{CassezTA07,\n  author    = {Franck Cassez and\n               Stavros Tripakis and\n               Karine Altisen},\n  title     = {Sensor Minimization Problems with Static or Dynamic Observers for\n               Fault Diagnosis},\n  booktitle = {Seventh International Conference on Application of Concurrency to\n               System Design {(ACSD} 2007), 10-13 July 2007, Bratislava, Slovak Republic},\n  pages     = {90--99},\n  year      = {2007},\n  editor    = {Twan Basten and\n               Gabriel Juh{\\&#x27;{a}}s and\n               Sandeep K. Shukla},\n  crossref  = {DBLP:conf/acsd/2007},\n  url       = {http://doi.ieeecomputersociety.org/10.1109/ACSD.2007.65},\n  doi       = {10.1109/ACSD.2007.65},\n  publisher = {{IEEE} Computer Society},\n  year      = {2007},\n  keyworfs = {fault diagnosis, automata},\n  urlpaper = {papers/acsd07.pdf},\n          Type = {B - International Conferences},\n\n  urlslides = {papers/slides-acsd-07.pdf},\n  abstract = {We study sensor minimization problems in the context of fault diagnosis. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in the plant as soon as possible after their occurrence. Existing literature on this problem has considered the case of static observers, where the set of observable events does not change during execution of the system. In this paper, we consider static as well as dynamic observers, where the observer can switch sensors on or off, thus dynamically changing the set of events it wishes to observe.}\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We study sensor minimization problems in the context of fault diagnosis. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in the plant as soon as possible after their occurrence. Existing literature on this problem has considered the case of static observers, where the set of observable events does not change during execution of the system. In this paper, we consider static as well as dynamic observers, where the observer can switch sensors on or off, thus dynamically changing the set of events it wishes to observe.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-david-larsen-lime-raskin-timedcontrolwithobservationbasedandstutteringinvariantstrategies-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/atva-07.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-david-larsen-lime-raskin-timedcontrolwithobservationbasedandstutteringinvariantstrategies-2007', 'https://franck44.github.io/publications/papers/atva-07.pdf', event);\">\n    Timed Control with Observation Based and Stuttering Invariant Strategies.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; David, A.; Larsen, K. G.; Lime, D.;  and Raskin, J.\n</span>\n\n  \n\n</span>\n\n  In Namjoshi, K. S.; Yoneda, T.; Higashino, T.;  and Okamura, Y., editor(s), <i>Automated Technology for Verification and Analysis, 5th International Symposium, ATVA 2007, Tokyo, Japan, October 22-25, 2007, Proceedings</i>, volume 4762, of <i>Lecture Notes in Computer Science</i>, pages 192–206,  2007. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/atva-07.pdf\"\n     onclick=\"log_download('cassez-david-larsen-lime-raskin-timedcontrolwithobservationbasedandstutteringinvariantstrategies-2007', 'https://franck44.github.io/publications/papers/atva-07.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Timed Control with Observation Based and Stuttering Invariant Strategies [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"http://dx.doi.org/10.1007/978-3-540-75596-8_15\"\n     onclick=\"log_download('cassez-david-larsen-lime-raskin-timedcontrolwithobservationbasedandstutteringinvariantstrategies-2007', 'http://dx.doi.org/10.1007/978-3-540-75596-8_15', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Timed Control with Observation Based and Stuttering Invariant Strategies [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-540-75596-8_15\"\n     onclick=\"log_download('cassez-david-larsen-lime-raskin-timedcontrolwithobservationbasedandstutteringinvariantstrategies-2007', 'http://doi.org/10.1007/978-3-540-75596-8_15', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-david-larsen-lime-raskin-timedcontrolwithobservationbasedandstutteringinvariantstrategies-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-david-larsen-lime-raskin-timedcontrolwithobservationbasedandstutteringinvariantstrategies-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{CassezDLLR07,\n  author    = {Franck Cassez and\n               Alexandre David and\n               Kim Guldstrand Larsen and\n               Didier Lime and\n               Jean{-}Fran{\\c{c}}ois Raskin},\n  title     = {Timed Control with Observation Based and Stuttering Invariant Strategies},\n  booktitle = {Automated Technology for Verification and Analysis, 5th International\n               Symposium, {ATVA} 2007, Tokyo, Japan, October 22-25, 2007, Proceedings},\n  pages     = {192--206},\n  year      = {2007},\n          Type = {B - International Conferences},\n\n  editor    = {Kedar S. Namjoshi and\n               Tomohiro Yoneda and\n               Teruo Higashino and\n               Yoshio Okamura},\n   series    = {Lecture Notes in Computer Science},\n  volume    = {4762},\n  publisher = {Springer},\n  urlpaper  = {papers/atva-07.pdf},\n  url_link       = {http://dx.doi.org/10.1007/978-3-540-75596-8_15},\n  doi       = {10.1007/978-3-540-75596-8_15},\n  abstract = {In this paper we consider the problem of controller synthesis for timed games under imperfect information. Novel to our approach is the requirements to strategies: they should be based on a finite collection of observations and must be stuttering invariant in the sense that repeated identical observations will not change the strategy. We provide a constructive transformation to equivalent finite games with perfect infor- mation, giving decidability as well as allowing for an efficient on-the-fly forward algorithm. We report on application of an initial experimental implementation.},\n  keywords = {control, timed automata, partial observation}\n}\n\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper we consider the problem of controller synthesis for timed games under imperfect information. Novel to our approach is the requirements to strategies: they should be based on a finite collection of observations and must be stuttering invariant in the sense that repeated identical observations will not change the strategy. We provide a constructive transformation to equivalent finite games with perfect infor- mation, giving decidability as well as allowing for an efficient on-the-fly forward algorithm. We report on application of an initial experimental implementation.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-efficientontheflyalgorithmsforpartiallyobservabletimedgames-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/formats-07.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-efficientontheflyalgorithmsforpartiallyobservabletimedgames-2007', 'https://franck44.github.io/publications/papers/formats-07.pdf', event);\">\n    Efficient On-the-Fly Algorithms for Partially Observable Timed Games.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>\n</span>\n\n  \n\n</span>\n\n  In Raskin, J.;  and Thiagarajan, P. S., editor(s), <i>Formal Modeling and Analysis of Timed Systems, 5th International Conference, FORMATS 2007, Salzburg, Austria, October 3-5, 2007, Proceedings</i>, volume 4763, of <i>Lecture Notes in Computer Science</i>, pages 5–24,  2007. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/formats-07.pdf\"\n     onclick=\"log_download('cassez-efficientontheflyalgorithmsforpartiallyobservabletimedgames-2007', 'https://franck44.github.io/publications/papers/formats-07.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Efficient On-the-Fly Algorithms for Partially Observable Timed Games [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://franck44.github.io/publications/papers/formats-07-slides.pdf\"\n     onclick=\"log_download('cassez-efficientontheflyalgorithmsforpartiallyobservabletimedgames-2007', 'https://franck44.github.io/publications/papers/formats-07-slides.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Efficient On-the-Fly Algorithms for Partially Observable Timed Games [pdf]\"\n       title=\"Slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Slides</span></a>\n  &nbsp;\n  \n  <a href=\"http://dx.doi.org/10.1007/978-3-540-75454-1_3\"\n     onclick=\"log_download('cassez-efficientontheflyalgorithmsforpartiallyobservabletimedgames-2007', 'http://dx.doi.org/10.1007/978-3-540-75454-1_3', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Efficient On-the-Fly Algorithms for Partially Observable Timed Games [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-540-75454-1_3\"\n     onclick=\"log_download('cassez-efficientontheflyalgorithmsforpartiallyobservabletimedgames-2007', 'http://doi.org/10.1007/978-3-540-75454-1_3', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-efficientontheflyalgorithmsforpartiallyobservabletimedgames-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-efficientontheflyalgorithmsforpartiallyobservabletimedgames-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{cassez-formats-07,\n  author    = {Franck Cassez},\n  title     = {Efficient On-the-Fly Algorithms for Partially Observable Timed Games},\n  booktitle = {Formal Modeling and Analysis of Timed Systems, 5th International Conference,\n               {FORMATS} 2007, Salzburg, Austria, October 3-5, 2007, Proceedings},\n  pages     = {5--24},\n  year      = {2007},\n  editor    = {Jean{-}Fran{\\c{c}}ois Raskin and\n               P. S. Thiagarajan},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {4763},\n          Type = {B - International Conferences},\n\n  publisher = {Springer},\n  urlpaper = {papers/formats-07.pdf},\n  urlslides = {papers/formats-07-slides.pdf},\n  url_link       = {http://dx.doi.org/10.1007/978-3-540-75454-1_3},\n  doi       = {10.1007/978-3-540-75454-1_3},\n  abstract = { In this paper, we review some recent results on the efficient synthesis of controllers for timed systems. We first recall the basics of controller synthesis for timed games and then present an efficient on-the-fly algorithm for reachability games and its extension to partially observable timed games.},\n  keywords = {control, timed automata}\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper, we review some recent results on the efficient synthesis of controllers for timed systems. We first recall the basics of controller synthesis for timed games and then present an efficient on-the-fly algorithm for reachability games and its extension to partially observable timed games.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-tripakis-altisen-synthesisofoptimalcostdynamicobserversforfaultdiagnosisofdiscreteeventsystems-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/tase-07.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-tripakis-altisen-synthesisofoptimalcostdynamicobserversforfaultdiagnosisofdiscreteeventsystems-2007', 'https://franck44.github.io/publications/papers/tase-07.pdf', event);\">\n    Synthesis Of Optimal-Cost Dynamic Observers for Fault Diagnosis of Discrete-Event Systems.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Tripakis, S.;  and Altisen, K.\n</span>\n\n  \n\n</span>\n\n  In <i>First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering, TASE 2007, June 5-8, 2007, Shanghai, China</i>, pages 316–325,  2007. IEEE Computer Society\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/tase-07.pdf\"\n     onclick=\"log_download('cassez-tripakis-altisen-synthesisofoptimalcostdynamicobserversforfaultdiagnosisofdiscreteeventsystems-2007', 'https://franck44.github.io/publications/papers/tase-07.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Synthesis Of Optimal-Cost Dynamic Observers for Fault Diagnosis of Discrete-Event Systems [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://franck44.github.io/publications/papers/slides-tase-07.pdf\"\n     onclick=\"log_download('cassez-tripakis-altisen-synthesisofoptimalcostdynamicobserversforfaultdiagnosisofdiscreteeventsystems-2007', 'https://franck44.github.io/publications/papers/slides-tase-07.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Synthesis Of Optimal-Cost Dynamic Observers for Fault Diagnosis of Discrete-Event Systems [pdf]\"\n       title=\"Slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Slides</span></a>\n  &nbsp;\n  \n  <a href=\"http://dx.doi.org/10.1109/TASE.2007.51\"\n     onclick=\"log_download('cassez-tripakis-altisen-synthesisofoptimalcostdynamicobserversforfaultdiagnosisofdiscreteeventsystems-2007', 'http://dx.doi.org/10.1109/TASE.2007.51', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Synthesis Of Optimal-Cost Dynamic Observers for Fault Diagnosis of Discrete-Event Systems [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TASE.2007.51\"\n     onclick=\"log_download('cassez-tripakis-altisen-synthesisofoptimalcostdynamicobserversforfaultdiagnosisofdiscreteeventsystems-2007', 'http://doi.org/10.1109/TASE.2007.51', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-tripakis-altisen-synthesisofoptimalcostdynamicobserversforfaultdiagnosisofdiscreteeventsystems-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-tripakis-altisen-synthesisofoptimalcostdynamicobserversforfaultdiagnosisofdiscreteeventsystems-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/tase/CassezTA07,\n  author    = {Franck Cassez and\n               Stavros Tripakis and\n               Karine Altisen},\n  title     = {Synthesis Of Optimal-Cost Dynamic Observers for Fault Diagnosis of\n               Discrete-Event Systems},\n  booktitle = {First Joint {IEEE/IFIP} Symposium on Theoretical Aspects of Software\n               Engineering, {TASE} 2007, June 5-8, 2007, Shanghai, China},\n  publisher = {{IEEE} Computer Society},\n   pages     = {316--325},\n  year      = {2007},\n          Type = {B - International Conferences},\n\n  urlpaper = {papers/tase-07.pdf},\n  urlslides = {papers/slides-tase-07.pdf},\n  url_link       = {http://dx.doi.org/10.1109/TASE.2007.51},\n  isbn      = {0-7695-2856-2},\n  doi       = {10.1109/TASE.2007.51},\n  abstract = {Fault diagnosis consists in synthesizing a diagnoser that observes a given plant through a set of observable events, and identifies faults which are not observable as soon as possible after their occurrence. Existing literature on this problem has considered the case of static observers, where the set of observable events does not change during execution of the system. In this paper, we consider dynamic observers, where the observer can switch sensors on or off, thus dynamically changing the set of events it wishes to observe. We define a notion of cost for such dynamic observers and show that (i) the cost of a given dynamic observer can be computed and (ii) an optimal dynamic observer can be synthesized.},\n}\n\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n%%% 2006\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Fault diagnosis consists in synthesizing a diagnoser that observes a given plant through a set of observable events, and identifies faults which are not observable as soon as possible after their occurrence. Existing literature on this problem has considered the case of static observers, where the set of observable events does not change during execution of the system. In this paper, we consider dynamic observers, where the observer can switch sensors on or off, thus dynamically changing the set of events it wishes to observe. We define a notion of cost for such dynamic observers and show that (i) the cost of a given dynamic observer can be computed and (ii) an optimal dynamic observer can be synthesized.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2006\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2006')\"\n      onkeypress=\"toggleGroup('group_2006')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2006</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"cassez-roux-structuraltranslationfromtimepetrinetstotimedautomata-2006\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/jss-06.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-roux-structuraltranslationfromtimepetrinetstotimedautomata-2006', 'https://franck44.github.io/publications/papers/jss-06.pdf', event);\">\n    Structural Translation from Time Petri Nets to Timed Automata.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Roux, O. H.\n</span>\n\n  \n\n</span>\n\n  <i>Journal of Software and Systems</i>, 79(10): 1456–1468. October 2006.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/jss-06.pdf\"\n     onclick=\"log_download('cassez-roux-structuraltranslationfromtimepetrinetstotimedautomata-2006', 'https://franck44.github.io/publications/papers/jss-06.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Structural Translation from Time Petri Nets to Timed Automata [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-roux-structuraltranslationfromtimepetrinetstotimedautomata-2006\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-roux-structuraltranslationfromtimepetrinetstotimedautomata-2006')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{cassez-jss-06,\n  ABSTRACT = {In this paper, we consider Time Petri Nets (TPN)\n                  where time is associated with transitions. We give a\n                  formal semantics for TPNs in terms of Timed\n                  Transition Systems. Then, we propose a translation\n                  from TPNs to Timed Automata (TA) that preserves the\n                  behavioral semantics (timed bisimilarity) of the\n                  TPNs. For the theory of TPNs this result is\n                  two-fold: i) reachability problems and more\n                  generally TCTL model-checking are decidable for\n                  bounded TPNs; ii) allowing strict time constraints\n                  on transitions for TPNs preserves the results\n                  described in i). The practical appli- cations of the\n                  translation are: i) one can specify a system using\n                  both TPNs and Timed Automata and a precise semantics\n                  is given to the composition; ii) one can use\n                  existing tools for analyzing timed automata (like\n                  Kronos, Uppaal or Cmc) to analyze TPNs. In this\n                  paper we describe the new feature of the tool Romeo\n                  that implements our translation of TPNs in the\n                  Uppaal input format. We also report on experiments\n                  carried out on various examples and compare the\n                  result of our method to state-of-the-art tool for\n                  analyzing TPNs.  },\n  AUTHOR = {Franck Cassez and Roux, Olivier Henri},\n  JOURNAL = {Journal of Software and Systems},\n  Type = {A - Journal},\n  PAGES = {1456--1468},\n  urlpaper = {papers/jss-06.pdf},\n  TITLE = {Structural Translation from Time Petri Nets to Timed Automata},\n  VOLUME = {79},\n  NUMBER = {10},\n  MONTH = OCT,\n  PUBLISHER = {Elsevier},\n  YEAR = {2006},\n  keywords = {Time Petri nets, timed automata, expressiveness}\n}\n\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper, we consider Time Petri Nets (TPN) where time is associated with transitions. We give a formal semantics for TPNs in terms of Timed Transition Systems. Then, we propose a translation from TPNs to Timed Automata (TA) that preserves the behavioral semantics (timed bisimilarity) of the TPNs. For the theory of TPNs this result is two-fold: i) reachability problems and more generally TCTL model-checking are decidable for bounded TPNs; ii) allowing strict time constraints on transitions for TPNs preserves the results described in i). The practical appli- cations of the translation are: i) one can specify a system using both TPNs and Timed Automata and a precise semantics is given to the composition; ii) one can use existing tools for analyzing timed automata (like Kronos, Uppaal or Cmc) to analyze TPNs. In this paper we describe the new feature of the tool Romeo that implements our translation of TPNs in the Uppaal input format. We also report on experiments carried out on various examples and compare the result of our method to state-of-the-art tool for analyzing TPNs. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"altisen-cassez-tripakis-monitoringandfaultdiagnosiswithdigitalclocks-2006\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/acsd06.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'altisen-cassez-tripakis-monitoringandfaultdiagnosiswithdigitalclocks-2006', 'https://franck44.github.io/publications/papers/acsd06.pdf', event);\">\n    Monitoring and fault-diagnosis with digital clocks.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Altisen, K.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Tripakis, S.\n</span>\n\n  \n\n</span>\n\n  In <i>Sixth International Conference on Application of Concurrency to System Design (ACSD 2006), 28-30 June 2006, Turku, Finland</i>, pages 101–110,  2006. IEEE Computer Society\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/acsd06.pdf\"\n     onclick=\"log_download('altisen-cassez-tripakis-monitoringandfaultdiagnosiswithdigitalclocks-2006', 'https://franck44.github.io/publications/papers/acsd06.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Monitoring and fault-diagnosis with digital clocks [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://franck44.github.io/publications/papers/slides-acsd-06.pdf\"\n     onclick=\"log_download('altisen-cassez-tripakis-monitoringandfaultdiagnosiswithdigitalclocks-2006', 'https://franck44.github.io/publications/papers/slides-acsd-06.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Monitoring and fault-diagnosis with digital clocks [pdf]\"\n       title=\"Slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Slides</span></a>\n  &nbsp;\n  \n  <a href=\"http://dx.doi.org/10.1109/ACSD.2006.10\"\n     onclick=\"log_download('altisen-cassez-tripakis-monitoringandfaultdiagnosiswithdigitalclocks-2006', 'http://dx.doi.org/10.1109/ACSD.2006.10', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Monitoring and fault-diagnosis with digital clocks [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ACSD.2006.10\"\n     onclick=\"log_download('altisen-cassez-tripakis-monitoringandfaultdiagnosiswithdigitalclocks-2006', 'http://doi.org/10.1109/ACSD.2006.10', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/altisen-cassez-tripakis-monitoringandfaultdiagnosiswithdigitalclocks-2006\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('altisen-cassez-tripakis-monitoringandfaultdiagnosiswithdigitalclocks-2006')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/acsd/AltisenCT06,\n  author    = {Karine Altisen and\n               Franck Cassez and\n               Stavros Tripakis},\n  title     = {Monitoring and fault-diagnosis with digital clocks},\n  booktitle = {Sixth International Conference on Application of Concurrency to System\n               Design {(ACSD} 2006), 28-30 June 2006, Turku, Finland},\n  pages     = {101--110},\n  year      = {2006},\n  publisher = {{IEEE} Computer Society},\n  urlpaper = {papers/acsd06.pdf},\n  urlslides = {papers/slides-acsd-06.pdf},\n  url_link       = {http://dx.doi.org/10.1109/ACSD.2006.10},\n  doi       = {10.1109/ACSD.2006.10},\n          Type = {B - International Conferences},\n\n  abstract = {\nWe study the monitoring and fault-diagnosis problems for dense-time real-time systems, where observers (monitors and diagnosers) have access to digital rather than analog clocks. Analog clocks are infinitely-precise, thus, not implementable. We show how, given a specification mod- eled as a timed automaton and a timed automaton model of the digital clock, a sound and optimal (i.e., as precise as possible) digital-clock monitor can be synthesized. We also show how, given plant and digital clock modeled as timed automata, we can check existence of a digital-clock diagnoser and, if one exists, how to synthesize it. Finally, we consider the problem of existence of digital-clock diag- nosers where the digital clock is unknown. We show that there are cases where a digital clock, no matter how precise, does not exist, even though the system is diagnosable with analog clocks. Finally, we provide a sufficient condition for digital-clock diagnosability.},\n  keywords = {fault diagnosis, timed automata, monitoring}\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We study the monitoring and fault-diagnosis problems for dense-time real-time systems, where observers (monitors and diagnosers) have access to digital rather than analog clocks. Analog clocks are infinitely-precise, thus, not implementable. We show how, given a specification mod- eled as a timed automaton and a timed automaton model of the digital clock, a sound and optimal (i.e., as precise as possible) digital-clock monitor can be synthesized. We also show how, given plant and digital clock modeled as timed automata, we can check existence of a digital-clock diagnoser and, if one exists, how to synthesize it. Finally, we consider the problem of existence of digital-clock diag- nosers where the digital clock is unknown. We show that there are cases where a digital clock, no matter how precise, does not exist, even though the system is diagnosable with analog clocks. Finally, we provide a sufficient condition for digital-clock diagnosability.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-chatain-jard-symbolicunfoldingsfornetworksoftimedautomata-2006\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/unfolding-rr-06.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-chatain-jard-symbolicunfoldingsfornetworksoftimedautomata-2006', 'https://franck44.github.io/publications/papers/unfolding-rr-06.pdf', event);\">\n    Symbolic Unfoldings for Networks of Timed Automata.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Chatain, T.;  and Jard, C.\n</span>\n\n  \n\n</span>\n\n  In Graf, S.;  and Zhang, W., editor(s), <i>Automated Technology for Verification and Analysis, 4th International Symposium, ATVA 2006, Beijing, China, October 23-26, 2006.</i>, volume 4218, of <i>Lecture Notes in Computer Science</i>, pages 307–321,  2006. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/unfolding-rr-06.pdf\"\n     onclick=\"log_download('cassez-chatain-jard-symbolicunfoldingsfornetworksoftimedautomata-2006', 'https://franck44.github.io/publications/papers/unfolding-rr-06.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Symbolic Unfoldings for Networks of Timed Automata [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://franck44.github.io/publications/papers/slides-atva-06.pdf\"\n     onclick=\"log_download('cassez-chatain-jard-symbolicunfoldingsfornetworksoftimedautomata-2006', 'https://franck44.github.io/publications/papers/slides-atva-06.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Symbolic Unfoldings for Networks of Timed Automata [pdf]\"\n       title=\"Slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Slides</span></a>\n  &nbsp;\n  \n  <a href=\"http://dx.doi.org/10.1007/11901914_24\"\n     onclick=\"log_download('cassez-chatain-jard-symbolicunfoldingsfornetworksoftimedautomata-2006', 'http://dx.doi.org/10.1007/11901914_24', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Symbolic Unfoldings for Networks of Timed Automata [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/11901914_24\"\n     onclick=\"log_download('cassez-chatain-jard-symbolicunfoldingsfornetworksoftimedautomata-2006', 'http://doi.org/10.1007/11901914_24', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-chatain-jard-symbolicunfoldingsfornetworksoftimedautomata-2006\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-chatain-jard-symbolicunfoldingsfornetworksoftimedautomata-2006')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/atva/CassezCJ06,\n  author    = {Franck Cassez and\n               Thomas Chatain and\n               Claude Jard},\n  editor    = {Susanne Graf and\n               Wenhui Zhang},\n  title     = {Symbolic Unfoldings for Networks of Timed Automata},\n  booktitle = {Automated Technology for Verification and Analysis, 4th International\n               Symposium, {ATVA} 2006, Beijing, China, October 23-26, 2006.},\n  pages     = {307--321},\n  year      = {2006},\n          Type = {B - International Conferences},\n\n  series    = {Lecture Notes in Computer Science},\n  volume    = {4218},\n  publisher = {Springer},\n  urlpaper = {papers/unfolding-rr-06.pdf},\n  urlslides = {papers/slides-atva-06.pdf},\n  url_link       = {http://dx.doi.org/10.1007/11901914_24},\n  doi       = {10.1007/11901914_24},\n  abstract = {In this paper we give a symbolic concurrent semantics for network of timed automata (NTA) in terms of extended symbolic nets. Symbolic nets are standard occurrence nets extended with read arcs and symbolic constraints on places and transitions. We prove that there is a complete finite prefix for any NTA that contains at least the information of the simulation graph of the NTA but keep explicit the notions of concurrency and causality of the network.},\n  keywords = {unfoldings, timed automata},\n}\n\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n%%% 2005\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper we give a symbolic concurrent semantics for network of timed automata (NTA) in terms of extended symbolic nets. Symbolic nets are standard occurrence nets extended with read arcs and symbolic constraints on places and transitions. We prove that there is a complete finite prefix for any NTA that contains at least the information of the simulation graph of the NTA but keep explicit the notions of concurrency and causality of the network.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2005\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2005')\"\n      onkeypress=\"toggleGroup('group_2005')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2005</span>\n      <span class=\"bibbase_group_count\">\n        \n        (7)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"cassez-roux-structuraltranslationfromtimepetrinetstotimedautomata-2005\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/slides-avocs-04.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-roux-structuraltranslationfromtimepetrinetstotimedautomata-2005', 'https://franck44.github.io/publications/papers/slides-avocs-04.pdf', event);\">\n    Structural Translation from Time Petri Nets to Timed Automata.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Roux, O. H.\n</span>\n\n  \n\n</span>\n\n  <i>Electr. Notes Theor. Comput. Sci. (Proceedings of AVOCS 2004)</i>, 128(6): 145–160.  2005.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://dx.doi.org/10.1016/j.entcs.2005.04.009\"\n     onclick=\"log_download('cassez-roux-structuraltranslationfromtimepetrinetstotimedautomata-2005', 'http://dx.doi.org/10.1016/j.entcs.2005.04.009', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Structural Translation from Time Petri Nets to Timed Automata [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://franck44.github.io/publications/papers/slides-avocs-04.pdf\"\n     onclick=\"log_download('cassez-roux-structuraltranslationfromtimepetrinetstotimedautomata-2005', 'https://franck44.github.io/publications/papers/slides-avocs-04.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Structural Translation from Time Petri Nets to Timed Automata [pdf]\"\n       title=\"Slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Slides</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1016/j.entcs.2005.04.009\"\n     onclick=\"log_download('cassez-roux-structuraltranslationfromtimepetrinetstotimedautomata-2005', 'http://doi.org/10.1016/j.entcs.2005.04.009', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-roux-structuraltranslationfromtimepetrinetstotimedautomata-2005\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-roux-structuraltranslationfromtimepetrinetstotimedautomata-2005')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/entcs/CassezR05,\n  author    = {Franck Cassez and\n               Olivier H. Roux},\n  title     = {Structural Translation from Time Petri Nets to Timed Automata},\n  journal   = {Electr. Notes Theor. Comput. Sci. (Proceedings of AVOCS 2004)},\n  volume    = {128},\n          Type = {B - International Conferences},\n  number    = {6},\n  pages     = {145--160},\n  year      = {2005},\n  url       = {http://dx.doi.org/10.1016/j.entcs.2005.04.009},\n  doi       = {10.1016/j.entcs.2005.04.009},\n  urlslides = {papers/slides-avocs-04.pdf},\n\n  abstract = {In this paper, we consider Time Petri Nets (TPN) where time is associated with transitions. We give a formal semantics for TPNs in terms of Timed Transition Systems. Then, we propose a translation from TPNs to Timed Automata (TA) that preserves the behavioural semantics (timed bisimilarity) of the TPNs. For the theory of TPNs this result is two-fold: i) reachability problems and more generally TCTL model-checking are decidable for bounded TPNs; ii) allowing strict time constraints on transitions for TPNs preserves the results described in i). The practical applications of the translation are: i) one can specify a system using both TPNs and Timed Automata and a precise semantics is given to the composition; ii) one can use existing tools for analysing timed automata (like Kronos, Uppaal or Cmc) to analyse TPNs.},\n  keywords = {Petri nets, timed, automata},\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper, we consider Time Petri Nets (TPN) where time is associated with transitions. We give a formal semantics for TPNs in terms of Timed Transition Systems. Then, we propose a translation from TPNs to Timed Automata (TA) that preserves the behavioural semantics (timed bisimilarity) of the TPNs. For the theory of TPNs this result is two-fold: i) reachability problems and more generally TCTL model-checking are decidable for bounded TPNs; ii) allowing strict time constraints on transitions for TPNs preserves the results described in i). The practical applications of the translation are: i) one can specify a system using both TPNs and Timed Automata and a precise semantics is given to the composition; ii) one can use existing tools for analysing timed automata (like Kronos, Uppaal or Cmc) to analyse TPNs.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"brard-cassez-haddad-lime-roux-comparisonofdifferentsemanticsfortimepetrinets-2005\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/petri-nets-atva05.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'brard-cassez-haddad-lime-roux-comparisonofdifferentsemanticsfortimepetrinets-2005', 'https://franck44.github.io/publications/papers/petri-nets-atva05.pdf', event);\">\n    Comparison of Different Semantics for Time Petri Nets.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bérard, B.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Haddad, S.; Lime, D.;  and Roux, O. H.\n</span>\n\n  \n\n</span>\n\n  In <i>Automated Technology for Verification and Analysis, Third International Symposium, ATVA 2005, Taipei, Taiwan, October 4-7, 2005, Proceedings</i>, volume 3707, of <i>Lecture Notes in Computer Science</i>, pages 293–307,  2005. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/petri-nets-atva05.pdf\"\n     onclick=\"log_download('brard-cassez-haddad-lime-roux-comparisonofdifferentsemanticsfortimepetrinets-2005', 'https://franck44.github.io/publications/papers/petri-nets-atva05.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Comparison of Different Semantics for Time Petri Nets [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"http://dx.doi.org/10.1007/11562948_23\"\n     onclick=\"log_download('brard-cassez-haddad-lime-roux-comparisonofdifferentsemanticsfortimepetrinets-2005', 'http://dx.doi.org/10.1007/11562948_23', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Comparison of Different Semantics for Time Petri Nets [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/11562948_23\"\n     onclick=\"log_download('brard-cassez-haddad-lime-roux-comparisonofdifferentsemanticsfortimepetrinets-2005', 'http://doi.org/10.1007/11562948_23', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/brard-cassez-haddad-lime-roux-comparisonofdifferentsemanticsfortimepetrinets-2005\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('brard-cassez-haddad-lime-roux-comparisonofdifferentsemanticsfortimepetrinets-2005')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/atva/BerardCHLR05,\n  author    = {B{\\&#x27;{e}}atrice B{\\&#x27;{e}}rard and\n               Franck Cassez and\n               Serge Haddad and\n               Didier Lime and\n               Olivier H. Roux},\n  title     = {Comparison of Different Semantics for Time Petri Nets},\n  booktitle = {Automated Technology for Verification and Analysis, Third International Symposium, {ATVA} 2005, Taipei, Taiwan, October 4-7, 2005, Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {3707},\n  publisher = {Springer},\n  pages     = {293--307},\n          Type = {B - International Conferences},\n\n  year      = {2005},\n  urlpaper = {papers/petri-nets-atva05.pdf},\n  url_link       = {http://dx.doi.org/10.1007/11562948_23},\n  doi       = {10.1007/11562948_23},\n  abstract = {In this paper we study the model of Time Petri Nets (TPNs) where a time interval is associated with the firing of a transition, but we extend it by considering general intervals rather than closed ones. A key feature of timed models is the memory policy, i.e. which timing informations are kept when a transition is fired. The original model selects an intermediate semantics where the transitions disabled after consuming the tokens, as well as the firing transition, are reinitialised. However this semantics is not appropriate for some applications. So we consider here two alternative semantics: the atomic and the persistent atomic ones. First we present relevant patterns of discrete event systems which show the interest of these semantics. Then we compare the expressiveness of the three semantics w.r.t. the weak time bisimilarity establishing inclusion results in the general case. Furthermore we show that some inclusions are strict with unrestricted intervals even when nets are bounded. Then we focus on bounded TPNs with upper-closed intervals and we prove that the semantics are equivalent. Finally taking into account both the practical and the theoretical issues, we conclude that persistent atomic semantics should be preferred.},\n  keywords = {Petri nets, semantics, expressiveness}\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper we study the model of Time Petri Nets (TPNs) where a time interval is associated with the firing of a transition, but we extend it by considering general intervals rather than closed ones. A key feature of timed models is the memory policy, i.e. which timing informations are kept when a transition is fired. The original model selects an intermediate semantics where the transitions disabled after consuming the tokens, as well as the firing transition, are reinitialised. However this semantics is not appropriate for some applications. So we consider here two alternative semantics: the atomic and the persistent atomic ones. First we present relevant patterns of discrete event systems which show the interest of these semantics. Then we compare the expressiveness of the three semantics w.r.t. the weak time bisimilarity establishing inclusion results in the general case. Furthermore we show that some inclusions are strict with unrestricted intervals even when nets are bounded. Then we focus on bounded TPNs with upper-closed intervals and we prove that the semantics are equivalent. Finally taking into account both the practical and the theoretical issues, we conclude that persistent atomic semantics should be preferred.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-david-fleury-larsen-lime-efficientontheflyalgorithmsfortheanalysisoftimedgames-2005\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/efficient-control-concur05.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-david-fleury-larsen-lime-efficientontheflyalgorithmsfortheanalysisoftimedgames-2005', 'https://franck44.github.io/publications/papers/efficient-control-concur05.pdf', event);\">\n    Efficient On-the-Fly Algorithms for the Analysis of Timed Games.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; David, A.; Fleury, E.; Larsen, K. G.;  and Lime, D.\n</span>\n\n  \n\n</span>\n\n  In <i>CONCUR 2005 - Concurrency Theory, 16th International Conference, CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005, Proceedings</i>, volume 3653, of <i>Lecture Notes in Computer Science</i>, pages 66–80,  2005. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/efficient-control-concur05.pdf\"\n     onclick=\"log_download('cassez-david-fleury-larsen-lime-efficientontheflyalgorithmsfortheanalysisoftimedgames-2005', 'https://franck44.github.io/publications/papers/efficient-control-concur05.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Efficient On-the-Fly Algorithms for the Analysis of Timed Games [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://franck44.github.io/publications/papers/efficient-control-concur05-slides.pdf\"\n     onclick=\"log_download('cassez-david-fleury-larsen-lime-efficientontheflyalgorithmsfortheanalysisoftimedgames-2005', 'https://franck44.github.io/publications/papers/efficient-control-concur05-slides.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Efficient On-the-Fly Algorithms for the Analysis of Timed Games [pdf]\"\n       title=\"Slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Slides</span></a>\n  &nbsp;\n  \n  <a href=\"http://dx.doi.org/10.1007/11539452_9\"\n     onclick=\"log_download('cassez-david-fleury-larsen-lime-efficientontheflyalgorithmsfortheanalysisoftimedgames-2005', 'http://dx.doi.org/10.1007/11539452_9', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Efficient On-the-Fly Algorithms for the Analysis of Timed Games [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/11539452_9\"\n     onclick=\"log_download('cassez-david-fleury-larsen-lime-efficientontheflyalgorithmsfortheanalysisoftimedgames-2005', 'http://doi.org/10.1007/11539452_9', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-david-fleury-larsen-lime-efficientontheflyalgorithmsfortheanalysisoftimedgames-2005\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-david-fleury-larsen-lime-efficientontheflyalgorithmsfortheanalysisoftimedgames-2005')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/concur/CassezDFLL05,\n  author    = {Franck Cassez and\n               Alexandre David and\n               Emmanuel Fleury and\n               Kim Guldstrand Larsen and\n               Didier Lime},\n  title     = {Efficient On-the-Fly Algorithms for the Analysis of Timed Games},\n  booktitle = {{CONCUR} 2005 - Concurrency Theory, 16th International Conference,\n               {CONCUR} 2005, San Francisco, CA, USA, August 23-26, 2005, Proceedings},\n  pages     = {66--80},\n  year      = {2005},\n          Type = {B - International Conferences},\n\n    series    = {Lecture Notes in Computer Science},\n  volume    = {3653},\n  publisher = {Springer},\n  urlpaper = {papers/efficient-control-concur05.pdf},\n  urlslides = {papers/efficient-control-concur05-slides.pdf},\n  url_link       = {http://dx.doi.org/10.1007/11539452_9},\n  doi       = {10.1007/11539452_9},\n  abstract = {In this paper, we propose a first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties.\nThe algorithm we propose is a symbolic extension of the on-the-fly algorithm suggested by Liu &amp;amp; Smolka [15] for linear-time model-checking of finite-state systems. Being on-the-fly, the symbolic algorithm may terminate long before having explored the entire state-space. Also the individual steps of the algorithm are carried out efficiently by the use of so-called zones as the underlying data structure.\nVarious optimizations of the basic symbolic algorithm are proposed as well as methods for obtaining time-optimal winning strategies (for reachability games). Extensive evaluation of an experimental implementation of the algorithm yields very encouraging performance results.},\n  keywords = {control, synthesis, timed games},\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper, we propose a first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties. The algorithm we propose is a symbolic extension of the on-the-fly algorithm suggested by Liu &amp; Smolka [15] for linear-time model-checking of finite-state systems. Being on-the-fly, the symbolic algorithm may terminate long before having explored the entire state-space. Also the individual steps of the algorithm are carried out efficiently by the use of so-called zones as the underlying data structure. Various optimizations of the basic symbolic algorithm are proposed as well as methods for obtaining time-optimal winning strategies (for reachability games). Extensive evaluation of an experimental implementation of the algorithm yields very encouraging performance results.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"bouyer-cassez-laroussinie-modallogicsfortimedcontrol-2005\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/modal-control-concur05.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bouyer-cassez-laroussinie-modallogicsfortimedcontrol-2005', 'https://franck44.github.io/publications/papers/modal-control-concur05.pdf', event);\">\n    Modal Logics for Timed Control.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bouyer, P.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Laroussinie, F.\n</span>\n\n  \n\n</span>\n\n  In <i>CONCUR 2005 - Concurrency Theory, 16th International Conference, CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005, Proceedings</i>, volume 3653, of <i>Lecture Notes in Computer Science</i>, pages 81–94,  2005. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/modal-control-concur05.pdf\"\n     onclick=\"log_download('bouyer-cassez-laroussinie-modallogicsfortimedcontrol-2005', 'https://franck44.github.io/publications/papers/modal-control-concur05.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Modal Logics for Timed Control [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://franck44.github.io/publications/papers/slides-concur-05.pdf\"\n     onclick=\"log_download('bouyer-cassez-laroussinie-modallogicsfortimedcontrol-2005', 'https://franck44.github.io/publications/papers/slides-concur-05.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Modal Logics for Timed Control [pdf]\"\n       title=\"Slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Slides</span></a>\n  &nbsp;\n  \n  <a href=\"http://dx.doi.org/10.1007/11539452_10\"\n     onclick=\"log_download('bouyer-cassez-laroussinie-modallogicsfortimedcontrol-2005', 'http://dx.doi.org/10.1007/11539452_10', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Modal Logics for Timed Control [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/11539452_10\"\n     onclick=\"log_download('bouyer-cassez-laroussinie-modallogicsfortimedcontrol-2005', 'http://doi.org/10.1007/11539452_10', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bouyer-cassez-laroussinie-modallogicsfortimedcontrol-2005\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bouyer-cassez-laroussinie-modallogicsfortimedcontrol-2005')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/concur/BouyerCL05,\n  author    = {Patricia Bouyer and\n               Franck Cassez and\n               Fran{\\c{c}}ois Laroussinie},\n  title     = {Modal Logics for Timed Control},\n  booktitle = {{CONCUR} 2005 - Concurrency Theory, 16th International Conference,\n               {CONCUR} 2005, San Francisco, CA, USA, August 23-26, 2005, Proceedings},\n  pages     = {81--94},\n  year      = {2005},\n  crossref  = {DBLP:conf/concur/2005},\n          Type = {B - International Conferences},\n\n  urlpaper = {papers/modal-control-concur05.pdf},\n  urlslides = {papers/slides-concur-05.pdf},\n    url_link       = {http://dx.doi.org/10.1007/11539452_10},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {3653},\n  publisher = {Springer},\n  doi       = {10.1007/11539452_10},\n  abstract = {\nAbstract. In this paper we use the timed modal logic Lnu to specify control objectives for timed plants. We show that the control problem for a large class of objectives can be reduced to a model-checking problem for an extension (Lcont) of the logic Lnu with a new modality.\nMore precisely we define a fragment of Lnu, namely Ldet, such that any\ncontrol objective of Lnudet can be translated into a Lcont formula that\nholds for the plant if and only if there is a controller that can enforce\nthe control objective.\nWe also show that the new modality of Lcont strictly increases the expressive power of Lnu\nwhile model-checking of Lcont remains EXPTIME-complete.},\n  keywords = {control, synthesis, logics},\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Abstract. In this paper we use the timed modal logic Lnu to specify control objectives for timed plants. We show that the control problem for a large class of objectives can be reduced to a model-checking problem for an extension (Lcont) of the logic Lnu with a new modality. More precisely we define a fragment of Lnu, namely Ldet, such that any control objective of Lnudet can be translated into a Lcont formula that holds for the plant if and only if there is a controller that can enforce the control objective. We also show that the new modality of Lcont strictly increases the expressive power of Lnu while model-checking of Lcont remains EXPTIME-complete.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"brard-cassez-haddad-lime-roux-comparisonoftheexpressivenessoftimedautomataandtimepetrinets-2005\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/petri-nets-formats05.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'brard-cassez-haddad-lime-roux-comparisonoftheexpressivenessoftimedautomataandtimepetrinets-2005', 'https://franck44.github.io/publications/papers/petri-nets-formats05.pdf', event);\">\n    Comparison of the Expressiveness of Timed Automata and Time Petri Nets.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bérard, B.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Haddad, S.; Lime, D.;  and Roux, O. H.\n</span>\n\n  \n\n</span>\n\n  In Pettersson, P.;  and Yi, W., editor(s), <i>Formal Modeling and Analysis of Timed Systems, Third International Conference, FORMATS 2005, Uppsala, Sweden, September 26-28, 2005, Proceedings</i>, volume 3829, of <i>Lecture Notes in Computer Science</i>, pages 211–225,  2005. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/petri-nets-formats05.pdf\"\n     onclick=\"log_download('brard-cassez-haddad-lime-roux-comparisonoftheexpressivenessoftimedautomataandtimepetrinets-2005', 'https://franck44.github.io/publications/papers/petri-nets-formats05.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Comparison of the Expressiveness of Timed Automata and Time Petri Nets [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://franck44.github.io/publications/papers/slides-formats-05.pdf\"\n     onclick=\"log_download('brard-cassez-haddad-lime-roux-comparisonoftheexpressivenessoftimedautomataandtimepetrinets-2005', 'https://franck44.github.io/publications/papers/slides-formats-05.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Comparison of the Expressiveness of Timed Automata and Time Petri Nets [pdf]\"\n       title=\"Slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Slides</span></a>\n  &nbsp;\n  \n  <a href=\"http://dx.doi.org/10.1007/11603009_17\"\n     onclick=\"log_download('brard-cassez-haddad-lime-roux-comparisonoftheexpressivenessoftimedautomataandtimepetrinets-2005', 'http://dx.doi.org/10.1007/11603009_17', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Comparison of the Expressiveness of Timed Automata and Time Petri Nets [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/11603009_17\"\n     onclick=\"log_download('brard-cassez-haddad-lime-roux-comparisonoftheexpressivenessoftimedautomataandtimepetrinets-2005', 'http://doi.org/10.1007/11603009_17', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/brard-cassez-haddad-lime-roux-comparisonoftheexpressivenessoftimedautomataandtimepetrinets-2005\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('brard-cassez-haddad-lime-roux-comparisonoftheexpressivenessoftimedautomataandtimepetrinets-2005')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/formats/BerardCHLR05,\n  author    = {B{\\&#x27;{e}}atrice B{\\&#x27;{e}}rard and\n               Franck Cassez and\n               Serge Haddad and\n               Didier Lime and\n               Olivier H. Roux},\n  title     = {Comparison of the Expressiveness of Timed Automata and Time Petri\n               Nets},\n  booktitle = {Formal Modeling and Analysis of Timed Systems, Third International\n               Conference, {FORMATS} 2005, Uppsala, Sweden, September 26-28, 2005,\n               Proceedings},\n  pages     = {211--225},\n  editor    = {Paul Pettersson and\n               Wang Yi},\n          Type = {B - International Conferences},\n\n series    = {Lecture Notes in Computer Science},\n  volume    = {3829},\n  publisher = {Springer},\n  year      = {2005},\n  urlpaper = {papers/petri-nets-formats05.pdf},\n  urlslides = {papers/slides-formats-05.pdf},\n  url_link       = {http://dx.doi.org/10.1007/11603009_17},\n  doi       = {10.1007/11603009_17},\n  abstract = { In this paper we consider the model of Time Petri Nets (TPN) where time is associated with transitions. We also consider Timed Automata (TA) as defined by Alur \\&amp;amp; Dill, and compare the expressiveness of the two models w.r.t. timed language acceptance and (weak) timed bisimilarity. We first prove that there exists a TA A s.t. there is no TPN (even unbounded) that is (weakly) timed bisimilar to A. We then propose a structural translation from TA to (1-safe) TPNs preserving timed language acceptance. Further on, we prove that the previous (slightly extended) translation also preserves weak timed bisimilarity for a syntactical subclass of TA. For the theory of TPNs, the consequences are: 1) TA, bounded TPNs and 1-safe TPNs are equally expressive w.r.t. timed language acceptance; 2) TA are strictly more expressive than bounded TPNs w.r.t. timed bisimilarity; 3) The subclass bounded and 1-safe TPNs “&#x60;a la Merlin” are equally expressive w.r.t. timed bisimilarity.},\n  keywords = {Petri nets, timed automata, expressiveness},\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper we consider the model of Time Petri Nets (TPN) where time is associated with transitions. We also consider Timed Automata (TA) as defined by Alur &amp; Dill, and compare the expressiveness of the two models w.r.t. timed language acceptance and (weak) timed bisimilarity. We first prove that there exists a TA A s.t. there is no TPN (even unbounded) that is (weakly) timed bisimilar to A. We then propose a structural translation from TA to (1-safe) TPNs preserving timed language acceptance. Further on, we prove that the previous (slightly extended) translation also preserves weak timed bisimilarity for a syntactical subclass of TA. For the theory of TPNs, the consequences are: 1) TA, bounded TPNs and 1-safe TPNs are equally expressive w.r.t. timed language acceptance; 2) TA are strictly more expressive than bounded TPNs w.r.t. timed bisimilarity; 3) The subclass bounded and 1-safe TPNs “`a la Merlin” are equally expressive w.r.t. timed bisimilarity.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"brard-cassez-haddad-lime-roux-whenaretimedautomataweaklytimedbisimilartotimepetrinets-2005\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/petri-nets-fsttcs05.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'brard-cassez-haddad-lime-roux-whenaretimedautomataweaklytimedbisimilartotimepetrinets-2005', 'https://franck44.github.io/publications/papers/petri-nets-fsttcs05.pdf', event);\">\n    When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bérard, B.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Haddad, S.; Lime, D.;  and Roux, O. H.\n</span>\n\n  \n\n</span>\n\n  In Ramanujam, R.;  and Sen, S., editor(s), <i>FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings</i>, volume 3821, of <i>Lecture Notes in Computer Science</i>, pages 273–284,  2005. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/petri-nets-fsttcs05.pdf\"\n     onclick=\"log_download('brard-cassez-haddad-lime-roux-whenaretimedautomataweaklytimedbisimilartotimepetrinets-2005', 'https://franck44.github.io/publications/papers/petri-nets-fsttcs05.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets? [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"http://dx.doi.org/10.1007/11590156_22\"\n     onclick=\"log_download('brard-cassez-haddad-lime-roux-whenaretimedautomataweaklytimedbisimilartotimepetrinets-2005', 'http://dx.doi.org/10.1007/11590156_22', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets? [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/11590156_22\"\n     onclick=\"log_download('brard-cassez-haddad-lime-roux-whenaretimedautomataweaklytimedbisimilartotimepetrinets-2005', 'http://doi.org/10.1007/11590156_22', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/brard-cassez-haddad-lime-roux-whenaretimedautomataweaklytimedbisimilartotimepetrinets-2005\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('brard-cassez-haddad-lime-roux-whenaretimedautomataweaklytimedbisimilartotimepetrinets-2005')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/fsttcs/BerardCHLR05,\n  author    = {B{\\&#x27;{e}}atrice B{\\&#x27;{e}}rard and\n               Franck Cassez and\n               Serge Haddad and\n               Didier Lime and\n               Olivier H. Roux},\n        Type = {B - International Conferences},\n\n  title     = {When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?},\n  booktitle = {{FSTTCS} 2005: Foundations of Software Technology and Theoretical\n               Computer Science, 25th International Conference, Hyderabad, India,\n               December 15-18, 2005, Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {3821},\n  publisher = {Springer},\n  editor    = {Ramaswamy Ramanujam and\n               Sandeep Sen},\n  pages     = {273--284},\n  year      = {2005},\n  urlpaper = {papers/petri-nets-fsttcs05.pdf},\n  url_link       = {http://dx.doi.org/10.1007/11590156_22},\n  doi       = {10.1007/11590156_22},\n  abstract = {In this paper, we compare Timed Automata (TA) with Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is included in the class of TA. It is thus natural to try and identify the (strict) subclass T  of TA that is equivalent to TPN for the weak time bisimulation relation. We give a characterisation of this subclass and we show that the membership problem and the reachability problem for T  are PSPACE-complete. Furthermore we show that for a TA in T  with integer constants, an equivalent TPN can be built with integer bounds but with a size exponential w.r.t. the original model. Surprisingly, using rational bounds yields a TPN whose size is linear.},\n  keywords = {Petri nets, timed automata, bisimulation},\n}\n\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper, we compare Timed Automata (TA) with Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is included in the class of TA. It is thus natural to try and identify the (strict) subclass T of TA that is equivalent to TPN for the weak time bisimulation relation. We give a characterisation of this subclass and we show that the membership problem and the reachability problem for T are PSPACE-complete. Furthermore we show that for a TA in T with integer constants, an equivalent TPN can be built with integer bounds but with a size exponential w.r.t. the original model. Surprisingly, using rational bounds yields a TPN whose size is linear.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"altisen-bouyer-cachat-cassez-gardey-introductionaucontrledessystmestempsrel-2005\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/intro-control-msr05.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'altisen-bouyer-cachat-cassez-gardey-introductionaucontrledessystmestempsrel-2005', 'https://franck44.github.io/publications/papers/intro-control-msr05.pdf', event);\">\n    Introduction au contrôle des systèmes temps-réel.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Altisen, K.; Bouyer, P.; Cachat, T.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Gardey, G.\n</span>\n\n  \n\n</span>\n\n  <i>European Journal of Automated Systems</i>, 39(1-2-3): 367-380.  2005.\n  <span class=\"note\">From Actes du 5ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'05)</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/intro-control-msr05.pdf\"\n     onclick=\"log_download('altisen-bouyer-cachat-cassez-gardey-introductionaucontrledessystmestempsrel-2005', 'https://franck44.github.io/publications/papers/intro-control-msr05.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Introduction au contrôle des systèmes temps-réel [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://franck44.github.io/publications/papers/slides-msr05.pdf\"\n     onclick=\"log_download('altisen-bouyer-cachat-cassez-gardey-introductionaucontrledessystmestempsrel-2005', 'https://franck44.github.io/publications/papers/slides-msr05.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Introduction au contrôle des systèmes temps-réel [pdf]\"\n       title=\"Slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Slides</span></a>\n  &nbsp;\n  \n  <a href=\"http://www.lsv.ens-cachan.fr/aci-cortos\"\n     onclick=\"log_download('altisen-bouyer-cachat-cassez-gardey-introductionaucontrledessystmestempsrel-2005', 'http://www.lsv.ens-cachan.fr/aci-cortos', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Introduction au contrôle des systèmes temps-réel [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/altisen-bouyer-cachat-cassez-gardey-introductionaucontrledessystmestempsrel-2005\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('altisen-bouyer-cachat-cassez-gardey-introductionaucontrledessystmestempsrel-2005')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@ARTICLE{Cortos-MSR05-control-journal,\n  AUTHOR = {Altisen, Karine and Bouyer, Patricia and Cachat, Thierry and Cassez, Franck and Gardey, Guillaume},\n  JOURNAL = {European Journal of Automated Systems},\n  PAGES = {367-380},\n  VOLUME = {39},\n  NUMBER = {1-2-3},\n  Type = {A - Journal},\n  PUBLISHER = {Herm{\\&#x60;e}s},\n  TITLE = {Introduction au contrôle des syst{\\&#x60;e}mes temps-r{\\&#x27;e}el},\n  urlpaper = {papers/intro-control-msr05.pdf},\n  urlslides ={papers/slides-msr05.pdf},\n  url_link = {http://www.lsv.ens-cachan.fr/aci-cortos},\n  YEAR = {2005},\n  note =  {From {A}ctes du 5{\\&#x60;e}me {C}olloque sur la {M}od{\\&#x27;e}lisation des {S}yst{\\&#x60;e}mes {R}{\\&#x27;e}actifs ({MSR}&#x27;05)},\n  abstract = { In this paper we give a quick overview of the area of control of real-time systems.},\n  keywords = {control, synthesis, timed games},\n}\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n%%% 2004\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper we give a quick overview of the area of control of real-time systems.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2004\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2004')\"\n      onkeypress=\"toggleGroup('group_2004')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2004</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"bouyer-cassez-fleury-larsen-synthesisofoptimalstrategiesusinghytech-2004\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/slides-gdv-04.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bouyer-cassez-fleury-larsen-synthesisofoptimalstrategiesusinghytech-2004', 'https://franck44.github.io/publications/papers/slides-gdv-04.pdf', event);\">\n    Synthesis of Optimal Strategies Using HyTech.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bouyer, P.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Fleury, E.;  and Larsen, K. G.\n</span>\n\n  \n\n</span>\n\n  <i>Electr. Notes Theor. Comput. Sci. (Proceedings of GDV)</i>, 119(1): 11–31.  2004.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://dx.doi.org/10.1016/j.entcs.2004.07.006\"\n     onclick=\"log_download('bouyer-cassez-fleury-larsen-synthesisofoptimalstrategiesusinghytech-2004', 'http://dx.doi.org/10.1016/j.entcs.2004.07.006', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Synthesis of Optimal Strategies Using HyTech [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://franck44.github.io/publications/papers/slides-gdv-04.pdf\"\n     onclick=\"log_download('bouyer-cassez-fleury-larsen-synthesisofoptimalstrategiesusinghytech-2004', 'https://franck44.github.io/publications/papers/slides-gdv-04.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Synthesis of Optimal Strategies Using HyTech [pdf]\"\n       title=\"Slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Slides</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1016/j.entcs.2004.07.006\"\n     onclick=\"log_download('bouyer-cassez-fleury-larsen-synthesisofoptimalstrategiesusinghytech-2004', 'http://doi.org/10.1016/j.entcs.2004.07.006', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bouyer-cassez-fleury-larsen-synthesisofoptimalstrategiesusinghytech-2004\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bouyer-cassez-fleury-larsen-synthesisofoptimalstrategiesusinghytech-2004')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/entcs/BouyerCFL05,\n  author    = {Patricia Bouyer and\n               Franck Cassez and\n               Emmanuel Fleury and\n               Kim Guldstrand Larsen},\n  title     = {Synthesis of Optimal Strategies Using HyTech},\n  journal   = {Electr. Notes Theor. Comput. Sci. (Proceedings of GDV)},\n  volume    = {119},\n  Type = {B - International Conferences},\n\n  number    = {1},\n  pages     = {11--31},\n  year      = {2004},\n  url       = {http://dx.doi.org/10.1016/j.entcs.2004.07.006},\n  urlslides = {papers/slides-gdv-04.pdf},\n  doi       = {10.1016/j.entcs.2004.07.006},\n  abstract = {Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. The problem of synthesizing an optimal winning strategy for a priced timed game under some hypotheses has been shown decidable in [P. Bouyer, F. Cassez, E. Fleury, and K.G. Larsen. Optimal strategies in priced timed game automata. Research Report BRICS RS-04-4, Denmark, Feb. 2004. Available at http://www.brics.dk/RS/04/4/]. In this paper, we present an algorithm for computing the optimal cost and for synthesizing an optimal strategy in case there exists one. We also describe the implementation of this algorithm with the tool HyTech and present an example.},\n  keywords = {control, synthesis, priced timed games, optimal},\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. The problem of synthesizing an optimal winning strategy for a priced timed game under some hypotheses has been shown decidable in [P. Bouyer, F. Cassez, E. Fleury, and K.G. Larsen. Optimal strategies in priced timed game automata. Research Report BRICS RS-04-4, Denmark, Feb. 2004. Available at http://www.brics.dk/RS/04/4/]. In this paper, we present an algorithm for computing the optimal cost and for synthesizing an optimal strategy in case there exists one. We also describe the implementation of this algorithm with the tool HyTech and present an example.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-pagetti-roux-atimedextensionforaltarica-2004\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/fi-2004.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-pagetti-roux-atimedextensionforaltarica-2004', 'https://franck44.github.io/publications/papers/fi-2004.pdf', event);\">\n    A Timed Extension for ALTARICA.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Pagetti, C.;  and Roux, O. H.\n</span>\n\n  \n\n</span>\n\n  <i>Fundam. Inform.</i>, 62(3-4): 291–332.  2004.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/fi-2004.pdf\"\n     onclick=\"log_download('cassez-pagetti-roux-atimedextensionforaltarica-2004', 'https://franck44.github.io/publications/papers/fi-2004.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"A Timed Extension for ALTARICA [pdf]\"\n       title=\"Papser\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Papser</span></a>\n  &nbsp;\n  \n  <a href=\"http://content.iospress.com/articles/fundamenta-informaticae/fi62-3-4-02\"\n     onclick=\"log_download('cassez-pagetti-roux-atimedextensionforaltarica-2004', 'http://content.iospress.com/articles/fundamenta-informaticae/fi62-3-4-02', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"A Timed Extension for ALTARICA [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-pagetti-roux-atimedextensionforaltarica-2004\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-pagetti-roux-atimedextensionforaltarica-2004')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DBLP:journals/fuin/CassezPR04,\n  author    = {Franck Cassez and\n               Claire Pagetti and\n               Olivier H. Roux},\n  title     = {A Timed Extension for {ALTARICA}},\n  journal   = {Fundam. Inform.},\n  volume    = {62},\n  number    = {3-4},\n  pages     = {291--332},\n  year      = {2004},\n  urlpapser = {papers/fi-2004.pdf},\n  url_link       = {http://content.iospress.com/articles/fundamenta-informaticae/fi62-3-4-02},\n  ABSTRACT = {  In this paper we present a \\emph{timed} extension of the AltaRica\n  formalism.  Following previous works, we first extend the semantics of\n  AltaRica with time and define \\emph{timed components} and \\emph{timed nodes}.\n  Moreover we lift the \\emph{priority features} of AltaRica to the timed\n  case.  We obtain a timed version of AltaRica, called Timed AltaRica. Finally we give\n  a translation of a Timed AltaRica specification into a usual timed automaton.\n  These are the semantic foundations of a high-level hierarchical\n  language for the specification of timed systems.\n},\n Type = {A - Journal},\n keywords = {timed automata, semantics},\n abstract = {},\n}\n\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"bouyer-cassez-fleury-larsen-optimalstrategiesinpricedtimedgameautomata-2004\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/fsttcs04.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bouyer-cassez-fleury-larsen-optimalstrategiesinpricedtimedgameautomata-2004', 'https://franck44.github.io/publications/papers/fsttcs04.pdf', event);\">\n    Optimal Strategies in Priced Timed Game Automata.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bouyer, P.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Fleury, E.;  and Larsen, K. G.\n</span>\n\n  \n\n</span>\n\n  In <i>FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings</i>, volume 3328, of <i>Lecture Notes in Computer Science</i>, pages 148–160,  2004. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/fsttcs04.pdf\"\n     onclick=\"log_download('bouyer-cassez-fleury-larsen-optimalstrategiesinpricedtimedgameautomata-2004', 'https://franck44.github.io/publications/papers/fsttcs04.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Optimal Strategies in Priced Timed Game Automata [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"http://dx.doi.org/10.1007/978-3-540-30538-5_13\"\n     onclick=\"log_download('bouyer-cassez-fleury-larsen-optimalstrategiesinpricedtimedgameautomata-2004', 'http://dx.doi.org/10.1007/978-3-540-30538-5_13', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Optimal Strategies in Priced Timed Game Automata [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-540-30538-5_13\"\n     onclick=\"log_download('bouyer-cassez-fleury-larsen-optimalstrategiesinpricedtimedgameautomata-2004', 'http://doi.org/10.1007/978-3-540-30538-5_13', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bouyer-cassez-fleury-larsen-optimalstrategiesinpricedtimedgameautomata-2004\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bouyer-cassez-fleury-larsen-optimalstrategiesinpricedtimedgameautomata-2004')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/fsttcs/BouyerCFL04,\n  author    = {Patricia Bouyer and\n               Franck Cassez and\n               Emmanuel Fleury and\n               Kim Guldstrand Larsen},\n  title     = {Optimal Strategies in Priced Timed Game Automata},\n  booktitle = {{FSTTCS} 2004: Foundations of Software Technology and Theoretical\n               Computer Science, 24th International Conference, Chennai, India, December   16-18, 2004, Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {3328},\n  publisher = {Springer},\n\n  pages     = {148--160},\n  year      = {2004},\n  urlpaper = {papers/fsttcs04.pdf},\n  url_link       = {http://dx.doi.org/10.1007/978-3-540-30538-5_13},\n  doi       = {10.1007/978-3-540-30538-5_13},\n  Type = {B - International Conferences},\n  keywords = {control, synthesis, timed games},\n  abstract = {Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability games for priced timed game automata and prove that the optimal cost for winning such a game is computable under conditions concerning the non-zenoness of cost and we prove that it is decidable. Under stronger conditions (strictness of constraints) we prove that in case an optimal strategy exists, we can compute a state-based winning optimal strategy.}\n}\n\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability games for priced timed game automata and prove that the optimal cost for winning such a game is computable under conditions concerning the non-zenoness of cost and we prove that it is decidable. Under stronger conditions (strictness of constraints) we prove that in case an optimal strategy exists, we can compute a state-based winning optimal strategy.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"bouyer-cassez-fleury-larsen-optimalstrategiesinpricedtimedgameautomata-2004\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.brics.dk/RS/04/4/\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bouyer-cassez-fleury-larsen-optimalstrategiesinpricedtimedgameautomata-2004', 'http://www.brics.dk/RS/04/4/', event);\">\n    Optimal Strategies in Priced Timed Game Automata.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bouyer, P.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>; Fleury, E.;  and Larsen, K. G.\n</span>\n\n  \n\n</span>\n\n  Technical Report RS-04-0, BRICS, Denmark,  2004.\n  <span class=\"note\">ISSN 0909-0878</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.brics.dk/RS/04/4/\"\n     onclick=\"log_download('bouyer-cassez-fleury-larsen-optimalstrategiesinpricedtimedgameautomata-2004', 'http://www.brics.dk/RS/04/4/', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Optimal Strategies in Priced Timed Game Automata [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bouyer-cassez-fleury-larsen-optimalstrategiesinpricedtimedgameautomata-2004\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bouyer-cassez-fleury-larsen-optimalstrategiesinpricedtimedgameautomata-2004')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@TECHREPORT{bouyer-brics-04,\n  ABSTRACT = {  Priced timed (game) automata extends timed (game) automata with costs on both locations and transitions. In this paper we focus on\n  reachability games for priced timed game automata and prove that the\n  optimal cost for winning such a game is computable under conditions\n  concerning the\n  non-zenoness of cost. Under stronger conditions (strictness of\n  constraints) we prove in addition that it is decidable whether there\n  is an optimal strategy in which case an optimal strategy can be\n  computed. Our results extend previous decidability result which\n  requires the underlying game automata to be acyclic. Finally, our\n  results are encoded in a first prototype in {\\em HyTech} which is applied\n  on a small case-study.},\n  AUTHOR = {Bouyer, Patricia and Cassez, Franck and Fleury, Emmanuel and Larsen, Kim Guldstrand},\n  INSTITUTION = {BRICS, Denmark},\n  LEX = {Da},\n  XXMONTH = FEB,\n  NOTE = {ISSN 0909-0878},\n  CATEGORY = {control},\n  NUMBER = {RS-04-0},\n  TITLE = {{Optimal Strategies in Priced Timed Game Automata}},\n  TYPE = {E - Reports},\n  URL = {http://www.brics.dk/RS/04/4/},\n  YEAR = {2004},\n\n}\n\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n%%% 2003\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Priced timed (game) automata extends timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability games for priced timed game automata and prove that the optimal cost for winning such a game is computable under conditions concerning the non-zenoness of cost. Under stronger conditions (strictness of constraints) we prove in addition that it is decidable whether there is an optimal strategy in which case an optimal strategy can be computed. Our results extend previous decidability result which requires the underlying game automata to be acyclic. Finally, our results are encoded in a first prototype in \\em HyTech which is applied on a small case-study.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2003\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2003')\"\n      onkeypress=\"toggleGroup('group_2003')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2003</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"pagetti-cassez-roux-hierarchicalmodelingandverificationoftimedsystemsintimedaltarica-2003\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/facs-03.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'pagetti-cassez-roux-hierarchicalmodelingandverificationoftimedsystemsintimedaltarica-2003', 'https://franck44.github.io/publications/papers/facs-03.pdf', event);\">\n    Hierarchical Modeling and Verification of Timed Systems in Timed AltaRica.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Pagetti, C.; <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Roux, O.\n</span>\n\n  \n\n</span>\n\n  In <i>Formal Aspects of Component Software (FACS'03)</i>, pages 63–80, September 2003. UNU/IIST, Macau\n  <span class=\"note\">Pisa, Italy, September 8–9, 2003</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/facs-03.pdf\"\n     onclick=\"log_download('pagetti-cassez-roux-hierarchicalmodelingandverificationoftimedsystemsintimedaltarica-2003', 'https://franck44.github.io/publications/papers/facs-03.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Hierarchical Modeling and Verification of Timed Systems in Timed AltaRica [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"http://www.iist.unu.edu/newrh/III/1/docs/techreports/report284.html\"\n     onclick=\"log_download('pagetti-cassez-roux-hierarchicalmodelingandverificationoftimedsystemsintimedaltarica-2003', 'http://www.iist.unu.edu/newrh/III/1/docs/techreports/report284.html', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Hierarchical Modeling and Verification of Timed Systems in Timed AltaRica [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/pagetti-cassez-roux-hierarchicalmodelingandverificationoftimedsystemsintimedaltarica-2003\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('pagetti-cassez-roux-hierarchicalmodelingandverificationoftimedsystemsintimedaltarica-2003')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@INPROCEEDINGS{pagetti-facs-2003,\n  ABSTRACT = { In this paper we present a timed extension of the AltaRica language,\n  Timed AltaRica, and describe the architecture of a compiler from Timed AltaRica to timed\n  automata. We present the features of the language, namely\n  modularity, hierarchical modeling and reuse of components during the\n  specification phase, on an  avionics example. Then, we use the\n  compiler from Timed AltaRica to Timed Automata to check some safety properties\n  on the system.},\n  AUTHOR = {Pagetti, Claire and Cassez, Franck and Roux, {Olivier F.}},\n  BOOKTITLE = {Formal Aspects of Component Software (FACS&#x27;03)},\n  MONTH = SEP,\n  NOTE = {Pisa, Italy, September 8--9, 2003},\n  PAGES = {63--80},\n  PDF = {papers/facs-03.pdf},\n  PUBLISHER = {UNU/IIST, Macau},\n  TITLE = {{Hierarchical Modeling and Verification of Timed Systems in Timed {AltaRica}}},\n  urlpaper = {papers/facs-03.pdf},\n  url_link = {http://www.iist.unu.edu/newrh/III/1/docs/techreports/report284.html},\n  YEAR = {2003},\n  Type = {B - International Conferences},\n  keywords = {timed automata, semantics, components},\n}\n\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper we present a timed extension of the AltaRica language, Timed AltaRica, and describe the architecture of a compiler from Timed AltaRica to timed automata. We present the features of the language, namely modularity, hierarchical modeling and reuse of components during the specification phase, on an avionics example. Then, we use the compiler from Timed AltaRica to Timed Automata to check some safety properties on the system.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-roux-fromtimepetrinetstotimedautomata-2003\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/ri-msr-03.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-roux-fromtimepetrinetstotimedautomata-2003', 'https://franck44.github.io/publications/papers/ri-msr-03.pdf', event);\">\n    From Time Petri Nets to Timed Automata.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Roux, O.\n</span>\n\n  \n\n</span>\n\n  In <i>4$<i>ème</i>}$ Colloque Francophone sur la Modélisation des Systèmes Réactifs, (MSR'03)</i>,  2003. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/ri-msr-03.pdf\"\n     onclick=\"log_download('cassez-roux-fromtimepetrinetstotimedautomata-2003', 'https://franck44.github.io/publications/papers/ri-msr-03.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"From Time Petri Nets to Timed Automata [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-roux-fromtimepetrinetstotimedautomata-2003\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-roux-fromtimepetrinetstotimedautomata-2003')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@INPROCEEDINGS{msr-03,\n  AUTHOR = {Cassez, Franck and Roux, {Olivier H.}},\n  BOOKTITLE = {4$\\textit{\\&#x60;eme}$ Colloque Francophone sur la Mod{\\&#x27;e}lisation des Syst{\\&#x60;e}mes R{\\&#x27;e}actifs, (MSR&#x27;03)},\n  urlpaper = {papers/ri-msr-03.pdf},\n  TITLE = {{From Time Petri Nets to Timed Automata}},\n  YEAR = {2003},\n  ABSTRACT = {\n In this paper, we consider Time Petri Nets (TPN) where time is\n  associated with transitions. We give a formal semantics for TPNs in\n  terms of Timed Transition Systems.  Then, we propose a translation\n  from TPNs to Timed Automata (TA) that preserves the behavioural\n  semantics (timed bisimilarity) of the TPNs.  For the theory of TPNs\n  this result is two-fold: i) reachability problems and more generally\n  TCTL model-checking are decidable for bounded TPNs; ii) allowing\n  strict time constraints on transitions for TPNs preserves the\n  results described in i).  The practical applications of the\n  translation are: i) one can specify a system using both TPNs and\n  Timed Automata and a precise semantics is given to the composition;\n  ii) one can use existing tools for analysing timed automata (like\n  KRONOS or UPPAAL or CMC) to analyse TPNs.\n},\n  Type = {B - International Conferences}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper, we consider Time Petri Nets (TPN) where time is associated with transitions. We give a formal semantics for TPNs in terms of Timed Transition Systems. Then, we propose a translation from TPNs to Timed Automata (TA) that preserves the behavioural semantics (timed bisimilarity) of the TPNs. For the theory of TPNs this result is two-fold: i) reachability problems and more generally TCTL model-checking are decidable for bounded TPNs; ii) allowing strict time constraints on transitions for TPNs preserves the results described in i). The practical applications of the translation are: i) one can specify a system using both TPNs and Timed Automata and a precise semantics is given to the composition; ii) one can use existing tools for analysing timed automata (like KRONOS or UPPAAL or CMC) to analyse TPNs. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cassez-vrificationqualitativemodelcheckingetlogiquestemporelles-2003\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/verif-qualit-etr-03.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-vrificationqualitativemodelcheckingetlogiquestemporelles-2003', 'https://franck44.github.io/publications/papers/verif-qualit-etr-03.pdf', event);\">\n    Vérification qualitative – Model-Checking et Logiques Temporelles.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>\n</span>\n\n  \n\n</span>\n\n  Actes de l'école d'été ETR'03,  2003.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/verif-qualit-etr-03.pdf\"\n     onclick=\"log_download('cassez-vrificationqualitativemodelcheckingetlogiquestemporelles-2003', 'https://franck44.github.io/publications/papers/verif-qualit-etr-03.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Vérification qualitative – Model-Checking et Logiques Temporelles [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://franck44.github.io/publications/papers/slides-etr-03.pdf\"\n     onclick=\"log_download('cassez-vrificationqualitativemodelcheckingetlogiquestemporelles-2003', 'https://franck44.github.io/publications/papers/slides-etr-03.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Vérification qualitative – Model-Checking et Logiques Temporelles [pdf]\"\n       title=\"Slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Slides</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-vrificationqualitativemodelcheckingetlogiquestemporelles-2003\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-vrificationqualitativemodelcheckingetlogiquestemporelles-2003')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@MISC{cassez-etr-03,\n  AUTHOR = {Cassez, Franck},\n  HOWPUBLISHED = {Actes de l&#x27;\\&#x27;ecole d&#x27;\\&#x27;et\\&#x27;e ETR&#x27;03},\n  XXMONTH = SEP,\n  urlpaper = {papers/verif-qualit-etr-03.pdf},\n  urlslides = {papers/slides-etr-03.pdf},\n  keywords = {verification, logics},\n  TITLE = {{V\\&#x27;erification qualitative -- {Model-Checking} et Logiques Temporelles}},\n  YEAR = {2003},\nabstract = {In this paper we give a quick overview of the area of modelling and verification of concurrent systems. We take transition systems as the basic model of concurrent systems, and introduce the temporal logics LTL and CTL. Moreover we give some hints for the model-checking algorithms for LTL and CTL.},\nType = {E - Reports},\n}\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n%%% 2002\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper we give a quick overview of the area of modelling and verification of concurrent systems. We take transition systems as the basic model of concurrent systems, and introduce the temporal logics LTL and CTL. Moreover we give some hints for the model-checking algorithms for LTL and CTL.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2000\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2000')\"\n      onkeypress=\"toggleGroup('group_2000')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2000</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"cassez-larsen-theimpressivepowerofstopwatches-2000\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://franck44.github.io/publications/papers/concur-00.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'cassez-larsen-theimpressivepowerofstopwatches-2000', 'https://franck44.github.io/publications/papers/concur-00.pdf', event);\">\n    The Impressive Power of Stopwatches.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>;  and Larsen, K. G.\n</span>\n\n  \n\n</span>\n\n  In Palamidessi, C., editor(s), <i>CONCUR 2000 - Concurrency Theory, 11th International Conference, University Park, PA, USA, August 22-25, 2000, Proceedings</i>, volume 1877, of <i>Lecture Notes in Computer Science</i>, pages 138–152,  2000. Springer\n  <span class=\"note\">CONCUR Test-Of-Time Award 2022</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://franck44.github.io/publications/papers/concur-00.pdf\"\n     onclick=\"log_download('cassez-larsen-theimpressivepowerofstopwatches-2000', 'https://franck44.github.io/publications/papers/concur-00.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"The Impressive Power of Stopwatches [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/3-540-44618-4_12\"\n     onclick=\"log_download('cassez-larsen-theimpressivepowerofstopwatches-2000', 'http://doi.org/10.1007/3-540-44618-4_12', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cassez-larsen-theimpressivepowerofstopwatches-2000\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cassez-larsen-theimpressivepowerofstopwatches-2000')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DBLP:conf/concur/CassezL00,\n  author    = {Franck Cassez and\n               Kim Guldstrand Larsen},\n  editor    = {Catuscia Palamidessi},\n  title     = {The Impressive Power of Stopwatches},\n  booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,\n               University Park, PA, USA, August 22-25, 2000, Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {1877},\n  pages     = {138--152},\n  publisher = {Springer},\n  year      = {2000},\n  url       = {https://doi.org/10.1007/3-540-44618-4\\_12},\n  doi       = {10.1007/3-540-44618-4\\_12},\n  timestamp = {Tue, 14 May 2019 10:00:43 +0200},\n  urlpaper = {papers/concur-00.pdf},\n  biburl    = {https://dblp.org/rec/conf/concur/CassezL00.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org},\n  note      = {CONCUR Test-Of-Time Award 2022}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1998\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1998')\"\n      onkeypress=\"toggleGroup('group_1998')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1998</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"sutre-finkel-roux-cassez-effectiverecognizabilityandmodelcheckingofreactivefiffoautomata-1998\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://dx.doi.org/10.1007/3-540-49253-4_10\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'sutre-finkel-roux-cassez-effectiverecognizabilityandmodelcheckingofreactivefiffoautomata-1998', 'http://dx.doi.org/10.1007/3-540-49253-4_10', event);\">\n    Effective Recognizability and Model Checking of Reactive FIFFO Automata.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Sutre, G.; Finkel, A.; Roux, O.;  and <a class=\"bibbase author link\" href=\"http://science.mq.edu.au/~fcassez/software-verif.html\">Cassez, F.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Algebraic Methodology and Software Technology, 7th International Conference, AMAST '98</i>, pages 106-123,  1998. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://dx.doi.org/10.1007/3-540-49253-4_10\"\n     onclick=\"log_download('sutre-finkel-roux-cassez-effectiverecognizabilityandmodelcheckingofreactivefiffoautomata-1998', 'http://dx.doi.org/10.1007/3-540-49253-4_10', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Effective Recognizability and Model Checking of Reactive FIFFO Automata [link]\"\n       title=\"Link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Link</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sutre-finkel-roux-cassez-effectiverecognizabilityandmodelcheckingofreactivefiffoautomata-1998\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sutre-finkel-roux-cassez-effectiverecognizabilityandmodelcheckingofreactivefiffoautomata-1998')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{amast-98,\n  author    = {Sutre, Grégoire  and\n                Finkel, Alain and\n                Roux, {Olivier F.} and\n                Cassez, Franck},\n  title     = {Effective Recognizability and Model Checking of Reactive\n               {FIFFO} Automata},\n  booktitle = {Algebraic Methodology and Software Technology, 7th International\n               Conference, AMAST &#x27;98},\n  year      = {1998},\n  pages     = {106-123},\n  ee        = {http://dx.doi.org/10.1007/3-540-49253-4_10},\n  crossref  = {DBLP:conf/amast/1998},\n  bibsource = {DBLP, http://dblp.uni-trier.de},\n  Type = {B - International Conferences},\n\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n  </div>\n\n\n  <!-- Modal -->\n\n  <!-- <iframe id=\"bibbase_network_frame\" -->\n  <!--         src=\"//bibbase.org/network/control\" -->\n  <!--         style=\"display: none;\"> -->\n  <!-- </iframe> -->\n\n</div>\n"}; document.write(bibbase_data.data);