Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Linear temporal logic). Showing records 1 – 27 of 27 total matches.

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


McMaster University

1. Kazemlou, Shokoufeh. Decentralized Crash-Resilient Runtime Verification.

Degree: MSc, 2017, McMaster University

This is the final revision of my M.Sc. Thesis.

Runtime Verification is a technique to extract information from a running system in order to detect… (more)

Subjects/Keywords: Runtime Verification; Distributed Monitoring; Linear Temporal Logic; Fault Tolerance

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kazemlou, S. (2017). Decentralized Crash-Resilient Runtime Verification. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/23885

Chicago Manual of Style (16th Edition):

Kazemlou, Shokoufeh. “Decentralized Crash-Resilient Runtime Verification.” 2017. Masters Thesis, McMaster University. Accessed July 23, 2019. http://hdl.handle.net/11375/23885.

MLA Handbook (7th Edition):

Kazemlou, Shokoufeh. “Decentralized Crash-Resilient Runtime Verification.” 2017. Web. 23 Jul 2019.

Vancouver:

Kazemlou S. Decentralized Crash-Resilient Runtime Verification. [Internet] [Masters thesis]. McMaster University; 2017. [cited 2019 Jul 23]. Available from: http://hdl.handle.net/11375/23885.

Council of Science Editors:

Kazemlou S. Decentralized Crash-Resilient Runtime Verification. [Masters Thesis]. McMaster University; 2017. Available from: http://hdl.handle.net/11375/23885


University of Texas – Austin

2. Ghasemi, Mahsa. Synthesis of reactive controllers for reconfigurable networked systems.

Degree: Mechanical Engineering, 2017, University of Texas – Austin

 Moving toward more autonomous fault-tolerant systems with robustness against unpredicted environment behavior, this thesis defines a set of high-level specifications on an abstract model of… (more)

Subjects/Keywords: Networked systems; Formal synthesis; Linear temporal logic; Maximum satisfiability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ghasemi, M. (2017). Synthesis of reactive controllers for reconfigurable networked systems. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/62937

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ghasemi, Mahsa. “Synthesis of reactive controllers for reconfigurable networked systems.” 2017. Thesis, University of Texas – Austin. Accessed July 23, 2019. http://hdl.handle.net/2152/62937.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ghasemi, Mahsa. “Synthesis of reactive controllers for reconfigurable networked systems.” 2017. Web. 23 Jul 2019.

Vancouver:

Ghasemi M. Synthesis of reactive controllers for reconfigurable networked systems. [Internet] [Thesis]. University of Texas – Austin; 2017. [cited 2019 Jul 23]. Available from: http://hdl.handle.net/2152/62937.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ghasemi M. Synthesis of reactive controllers for reconfigurable networked systems. [Thesis]. University of Texas – Austin; 2017. Available from: http://hdl.handle.net/2152/62937

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Illinois – Urbana-Champaign

3. Kini, Dileep Raghunath. Verification of linear-time properties for finite probabilistic systems.

Degree: PhD, Computer Science, 2017, University of Illinois – Urbana-Champaign

 With computers becoming ubiquitous there is an ever growing necessity to ensure that they are programmed to behave correctly. Formal verification is a discipline within… (more)

Subjects/Keywords: Probabilistic model checking; Markov decision processes; Linear temporal logic; Automata theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kini, D. R. (2017). Verification of linear-time properties for finite probabilistic systems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/99357

Chicago Manual of Style (16th Edition):

Kini, Dileep Raghunath. “Verification of linear-time properties for finite probabilistic systems.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 23, 2019. http://hdl.handle.net/2142/99357.

MLA Handbook (7th Edition):

Kini, Dileep Raghunath. “Verification of linear-time properties for finite probabilistic systems.” 2017. Web. 23 Jul 2019.

Vancouver:

Kini DR. Verification of linear-time properties for finite probabilistic systems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2019 Jul 23]. Available from: http://hdl.handle.net/2142/99357.

Council of Science Editors:

Kini DR. Verification of linear-time properties for finite probabilistic systems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/99357


University of Edinburgh

4. To, Anthony Widjaja. Model checking infinite-state systems : generic and specific approaches.

Degree: 2010, University of Edinburgh

 Model checking is a fully-automatic formal verification method that has been extremely successful in validating and verifying safety-critical systems in the past three decades. In… (more)

Subjects/Keywords: 518; algorithmic metatheorems; model checking; infinite systems; LTL; Linear Temporal Logic; reversal-bounded counter systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

To, A. W. (2010). Model checking infinite-state systems : generic and specific approaches. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/4671

Chicago Manual of Style (16th Edition):

To, Anthony Widjaja. “Model checking infinite-state systems : generic and specific approaches.” 2010. Doctoral Dissertation, University of Edinburgh. Accessed July 23, 2019. http://hdl.handle.net/1842/4671.

MLA Handbook (7th Edition):

To, Anthony Widjaja. “Model checking infinite-state systems : generic and specific approaches.” 2010. Web. 23 Jul 2019.

Vancouver:

To AW. Model checking infinite-state systems : generic and specific approaches. [Internet] [Doctoral dissertation]. University of Edinburgh; 2010. [cited 2019 Jul 23]. Available from: http://hdl.handle.net/1842/4671.

Council of Science Editors:

To AW. Model checking infinite-state systems : generic and specific approaches. [Doctoral Dissertation]. University of Edinburgh; 2010. Available from: http://hdl.handle.net/1842/4671


University of Texas – Austin

5. -2427-9523. Hybrid control and model-based assertions for autonomous intersection management system as a cyber-physical system.

Degree: Mechanical Engineering, 2016, University of Texas – Austin

 A cyber-physical system (CPS) consists of multiple physical components that collab- orate through a network during real-time operation according to system-level commands. A hybrid control,… (more)

Subjects/Keywords: Cyber-physical system; AIMS; Hybrid control; Linear temporal logic; Model-based assertions; Sliding-mode control

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

-2427-9523. (2016). Hybrid control and model-based assertions for autonomous intersection management system as a cyber-physical system. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/39042

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

-2427-9523. “Hybrid control and model-based assertions for autonomous intersection management system as a cyber-physical system.” 2016. Thesis, University of Texas – Austin. Accessed July 23, 2019. http://hdl.handle.net/2152/39042.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

-2427-9523. “Hybrid control and model-based assertions for autonomous intersection management system as a cyber-physical system.” 2016. Web. 23 Jul 2019.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-2427-9523. Hybrid control and model-based assertions for autonomous intersection management system as a cyber-physical system. [Internet] [Thesis]. University of Texas – Austin; 2016. [cited 2019 Jul 23]. Available from: http://hdl.handle.net/2152/39042.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

-2427-9523. Hybrid control and model-based assertions for autonomous intersection management system as a cyber-physical system. [Thesis]. University of Texas – Austin; 2016. Available from: http://hdl.handle.net/2152/39042

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation


George Mason University

6. Krishnan, Ram Narayan. Group-Centric Secure Information Sharing Models .

Degree: 2010, George Mason University

 In this dissertation, we introduce a novel approach for secure information sharing characterized as "Group-Centric". Traditional approaches to information sharing include "Dissemination-Centric" and "Query-Centric" sharing.… (more)

Subjects/Keywords: information sharing; access control models; model checking; security properties; Linear Temporal Logic; policy specification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Krishnan, R. N. (2010). Group-Centric Secure Information Sharing Models . (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/5669

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Krishnan, Ram Narayan. “Group-Centric Secure Information Sharing Models .” 2010. Thesis, George Mason University. Accessed July 23, 2019. http://hdl.handle.net/1920/5669.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Krishnan, Ram Narayan. “Group-Centric Secure Information Sharing Models .” 2010. Web. 23 Jul 2019.

Vancouver:

Krishnan RN. Group-Centric Secure Information Sharing Models . [Internet] [Thesis]. George Mason University; 2010. [cited 2019 Jul 23]. Available from: http://hdl.handle.net/1920/5669.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Krishnan RN. Group-Centric Secure Information Sharing Models . [Thesis]. George Mason University; 2010. Available from: http://hdl.handle.net/1920/5669

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Euskal Herriko Unibertsitatea / Universidad del País Vasco

7. Gaintzarain Ibarmia, José. Invariant-free deduction systems for temporal logic .

Degree: 2012, Euskal Herriko Unibertsitatea / Universidad del País Vasco

 In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is based on an inductive definition of eventualities that… (more)

Subjects/Keywords: temporal logic; PLTL; temporal deduction; tableaux; temporal tableaux; sequent; sequent calculus; resolution; clausal resolution; clausal temporal resolution; one-pass tableau; invariant; invariant formula; eventuality; invariant-free; cut-free; invariant generation; logic programming; temporal logic programming; completeness; disjunctive logic programming; temporal disjunctive logic programming; finitary sequent system; invariant-free clausal temporal resolution; declarative temporal logic programming; operational semantics; logical semantics; dual tableaux and sequent systems; propositional linear-time temporal logic; fixpoint semantics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gaintzarain Ibarmia, J. (2012). Invariant-free deduction systems for temporal logic . (Doctoral Dissertation). Euskal Herriko Unibertsitatea / Universidad del País Vasco. Retrieved from http://hdl.handle.net/10810/10332

Chicago Manual of Style (16th Edition):

Gaintzarain Ibarmia, José. “Invariant-free deduction systems for temporal logic .” 2012. Doctoral Dissertation, Euskal Herriko Unibertsitatea / Universidad del País Vasco. Accessed July 23, 2019. http://hdl.handle.net/10810/10332.

MLA Handbook (7th Edition):

Gaintzarain Ibarmia, José. “Invariant-free deduction systems for temporal logic .” 2012. Web. 23 Jul 2019.

Vancouver:

Gaintzarain Ibarmia J. Invariant-free deduction systems for temporal logic . [Internet] [Doctoral dissertation]. Euskal Herriko Unibertsitatea / Universidad del País Vasco; 2012. [cited 2019 Jul 23]. Available from: http://hdl.handle.net/10810/10332.

Council of Science Editors:

Gaintzarain Ibarmia J. Invariant-free deduction systems for temporal logic . [Doctoral Dissertation]. Euskal Herriko Unibertsitatea / Universidad del País Vasco; 2012. Available from: http://hdl.handle.net/10810/10332


Brno University of Technology

8. Sečkařová, Petra. Ověřování temporálních vlastností konečných běhů programů .

Degree: 2019, Brno University of Technology

 Temporální vlastnosti programů jsou používány ke specifikaci korektního průběhu jejich vykonávání. Jedním z nejčastějších způsobů formálního popisu těchto vlastností je lineární temporální logika - LTL… (more)

Subjects/Keywords: verifikace programů za běhu; temporální vlastnosti programů; lineární temporální logika; run-time verification; temporal properties of programs; linear temporal logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sečkařová, P. (2019). Ověřování temporálních vlastností konečných běhů programů . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/180387

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sečkařová, Petra. “Ověřování temporálních vlastností konečných běhů programů .” 2019. Thesis, Brno University of Technology. Accessed July 23, 2019. http://hdl.handle.net/11012/180387.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sečkařová, Petra. “Ověřování temporálních vlastností konečných běhů programů .” 2019. Web. 23 Jul 2019.

Vancouver:

Sečkařová P. Ověřování temporálních vlastností konečných běhů programů . [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2019 Jul 23]. Available from: http://hdl.handle.net/11012/180387.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sečkařová P. Ověřování temporálních vlastností konečných běhů programů . [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/180387

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Western Sydney

9. Xiao, Zhanhao. Refinement of intentions.

Degree: 2018, University of Western Sydney

 The mental attitudes, such as belief, desire, and intention, play a central role in the design and implementation of autonomous agents. In 1987, Bratman proposed… (more)

Subjects/Keywords: intelligent agents (computer software); databases; logic programming; artificial intelligence; linear temporal logic; problem solving; Thesis (Ph.D.) – Western Sydney University, 2018

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Xiao, Z. (2018). Refinement of intentions. (Thesis). University of Western Sydney. Retrieved from http://hdl.handle.net/1959.7/uws:47368

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Xiao, Zhanhao. “Refinement of intentions.” 2018. Thesis, University of Western Sydney. Accessed July 23, 2019. http://hdl.handle.net/1959.7/uws:47368.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Xiao, Zhanhao. “Refinement of intentions.” 2018. Web. 23 Jul 2019.

Vancouver:

Xiao Z. Refinement of intentions. [Internet] [Thesis]. University of Western Sydney; 2018. [cited 2019 Jul 23]. Available from: http://hdl.handle.net/1959.7/uws:47368.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Xiao Z. Refinement of intentions. [Thesis]. University of Western Sydney; 2018. Available from: http://hdl.handle.net/1959.7/uws:47368

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


KTH

10. Xu, Ziwei. LTL Motion Planning with Collision Avoidance for A Team of Quadrotors.

Degree: Electrical Engineering (EES), 2016, KTH

Linear Temporal Logic (LTL), as one of the temporal logic, can generate a fully automated correct-by-design controller synthesis approach for single or multiple autonomous… (more)

Subjects/Keywords: Finite transition system(FTS); Linear Temporal Logic(LTL) formula; Büchi automaton(BA); Optimal path; Robotic operating system(ROS)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Xu, Z. (2016). LTL Motion Planning with Collision Avoidance for A Team of Quadrotors. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-196904

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Xu, Ziwei. “LTL Motion Planning with Collision Avoidance for A Team of Quadrotors.” 2016. Thesis, KTH. Accessed July 23, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-196904.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Xu, Ziwei. “LTL Motion Planning with Collision Avoidance for A Team of Quadrotors.” 2016. Web. 23 Jul 2019.

Vancouver:

Xu Z. LTL Motion Planning with Collision Avoidance for A Team of Quadrotors. [Internet] [Thesis]. KTH; 2016. [cited 2019 Jul 23]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-196904.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Xu Z. LTL Motion Planning with Collision Avoidance for A Team of Quadrotors. [Thesis]. KTH; 2016. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-196904

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

11. Kuhlmann, K.S. LTL specifications for Highway Lane Changing Maneuvers of Highly Automated Vehicles:.

Degree: 2014, Delft University of Technology

 Since the interest in autonomous driving solutions is massively increasing, the need for good and reliable control algorithms is growing every day. This project studies… (more)

Subjects/Keywords: LTL; autonomous car; DAVI; linear temporal logic

…focus on Linear Temporal Logic (LTL), which is found appropriate to formally specify… …proposed an extension to this receding horizon framework to handle linear temporal logic… …Temporal Logic (LTL) and its semantics is given in section 2-2. Section 2-3 introduces… …a receding horizon framework for temporal logic specifications that acts as a big… …Temporal Logic Temporal logic is a logical language which incorporates temporal aspects and can… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kuhlmann, K. S. (2014). LTL specifications for Highway Lane Changing Maneuvers of Highly Automated Vehicles:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:561afc99-ccb6-49fa-813e-5aa751e1a55d

Chicago Manual of Style (16th Edition):

Kuhlmann, K S. “LTL specifications for Highway Lane Changing Maneuvers of Highly Automated Vehicles:.” 2014. Masters Thesis, Delft University of Technology. Accessed July 23, 2019. http://resolver.tudelft.nl/uuid:561afc99-ccb6-49fa-813e-5aa751e1a55d.

MLA Handbook (7th Edition):

Kuhlmann, K S. “LTL specifications for Highway Lane Changing Maneuvers of Highly Automated Vehicles:.” 2014. Web. 23 Jul 2019.

Vancouver:

Kuhlmann KS. LTL specifications for Highway Lane Changing Maneuvers of Highly Automated Vehicles:. [Internet] [Masters thesis]. Delft University of Technology; 2014. [cited 2019 Jul 23]. Available from: http://resolver.tudelft.nl/uuid:561afc99-ccb6-49fa-813e-5aa751e1a55d.

Council of Science Editors:

Kuhlmann KS. LTL specifications for Highway Lane Changing Maneuvers of Highly Automated Vehicles:. [Masters Thesis]. Delft University of Technology; 2014. Available from: http://resolver.tudelft.nl/uuid:561afc99-ccb6-49fa-813e-5aa751e1a55d

12. Ferlin, Antoine. Vérification de propriétés temporelles sur des logiciels avioniques par analyse dynamique formelle : Verification of temporal properties on avionics software using formal dynamic analysis.

Degree: Docteur es, Sureté de logiciel et calcul de haute performance, 2013, Toulouse, ISAE

La vérification de logiciels est une activité dont l'importance est cruciale pour les logiciels embarqués critiques. Les différentes approches envisageables peuvent être classées en quatre… (more)

Subjects/Keywords: Logique Temporelle Linéaire; Analyse Dynamique; Analyse Statique, Logiciels critiques; Linear Temporal Logic; Dynamic analysis; Static analysis; Critical software; 000

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ferlin, A. (2013). Vérification de propriétés temporelles sur des logiciels avioniques par analyse dynamique formelle : Verification of temporal properties on avionics software using formal dynamic analysis. (Doctoral Dissertation). Toulouse, ISAE. Retrieved from http://www.theses.fr/2013ESAE0024

Chicago Manual of Style (16th Edition):

Ferlin, Antoine. “Vérification de propriétés temporelles sur des logiciels avioniques par analyse dynamique formelle : Verification of temporal properties on avionics software using formal dynamic analysis.” 2013. Doctoral Dissertation, Toulouse, ISAE. Accessed July 23, 2019. http://www.theses.fr/2013ESAE0024.

MLA Handbook (7th Edition):

Ferlin, Antoine. “Vérification de propriétés temporelles sur des logiciels avioniques par analyse dynamique formelle : Verification of temporal properties on avionics software using formal dynamic analysis.” 2013. Web. 23 Jul 2019.

Vancouver:

Ferlin A. Vérification de propriétés temporelles sur des logiciels avioniques par analyse dynamique formelle : Verification of temporal properties on avionics software using formal dynamic analysis. [Internet] [Doctoral dissertation]. Toulouse, ISAE; 2013. [cited 2019 Jul 23]. Available from: http://www.theses.fr/2013ESAE0024.

Council of Science Editors:

Ferlin A. Vérification de propriétés temporelles sur des logiciels avioniques par analyse dynamique formelle : Verification of temporal properties on avionics software using formal dynamic analysis. [Doctoral Dissertation]. Toulouse, ISAE; 2013. Available from: http://www.theses.fr/2013ESAE0024


University of California – Berkeley

13. Iannopollo, Antonio. A Platform-Based Approach to Verification and Synthesis of Linear Temporal Logic Specifications.

Degree: Electrical Engineering & Computer Sciences, 2018, University of California – Berkeley

 The design of Cyber-Physical Systems (CPS) is challenging as it requires coordination across several domains (e.g., functional, temporal, mechanical). To cope with complexity, rarely a… (more)

Subjects/Keywords: Computer science; assume guarantee contracts; counterexample-guided inductive synthesis; decomposition; linear temporal logic; oracle-guided inductive synthesis; refinement

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Iannopollo, A. (2018). A Platform-Based Approach to Verification and Synthesis of Linear Temporal Logic Specifications. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/0xx972bn

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Iannopollo, Antonio. “A Platform-Based Approach to Verification and Synthesis of Linear Temporal Logic Specifications.” 2018. Thesis, University of California – Berkeley. Accessed July 23, 2019. http://www.escholarship.org/uc/item/0xx972bn.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Iannopollo, Antonio. “A Platform-Based Approach to Verification and Synthesis of Linear Temporal Logic Specifications.” 2018. Web. 23 Jul 2019.

Vancouver:

Iannopollo A. A Platform-Based Approach to Verification and Synthesis of Linear Temporal Logic Specifications. [Internet] [Thesis]. University of California – Berkeley; 2018. [cited 2019 Jul 23]. Available from: http://www.escholarship.org/uc/item/0xx972bn.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Iannopollo A. A Platform-Based Approach to Verification and Synthesis of Linear Temporal Logic Specifications. [Thesis]. University of California – Berkeley; 2018. Available from: http://www.escholarship.org/uc/item/0xx972bn

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

14. Nguyên, Duy-Tùng. Vérification symbolique de modèles à l'aide de systèmes de ré-écriture dédiés : Symbolic model-checking based on rewriting systems.

Degree: Docteur es, Informatique, 2010, Université d'Orléans

Cette thèse propose un nouveau type de systèmes de ré-écriture, appelé les systèmes de réécriture fonctionnels. Nous montrons que notre modèle a la puissance d'expression… (more)

Subjects/Keywords: Vérification symbolique; Diagrammes de décision binaires; Algorithme de saturation; Logique temporelle linéaire; Symbolic verification; Binary decision diagram; Saturation algorithm; Linear temporal logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Nguyên, D. (2010). Vérification symbolique de modèles à l'aide de systèmes de ré-écriture dédiés : Symbolic model-checking based on rewriting systems. (Doctoral Dissertation). Université d'Orléans. Retrieved from http://www.theses.fr/2010ORLE2030

Chicago Manual of Style (16th Edition):

Nguyên, Duy-Tùng. “Vérification symbolique de modèles à l'aide de systèmes de ré-écriture dédiés : Symbolic model-checking based on rewriting systems.” 2010. Doctoral Dissertation, Université d'Orléans. Accessed July 23, 2019. http://www.theses.fr/2010ORLE2030.

MLA Handbook (7th Edition):

Nguyên, Duy-Tùng. “Vérification symbolique de modèles à l'aide de systèmes de ré-écriture dédiés : Symbolic model-checking based on rewriting systems.” 2010. Web. 23 Jul 2019.

Vancouver:

Nguyên D. Vérification symbolique de modèles à l'aide de systèmes de ré-écriture dédiés : Symbolic model-checking based on rewriting systems. [Internet] [Doctoral dissertation]. Université d'Orléans; 2010. [cited 2019 Jul 23]. Available from: http://www.theses.fr/2010ORLE2030.

Council of Science Editors:

Nguyên D. Vérification symbolique de modèles à l'aide de systèmes de ré-écriture dédiés : Symbolic model-checking based on rewriting systems. [Doctoral Dissertation]. Université d'Orléans; 2010. Available from: http://www.theses.fr/2010ORLE2030

15. Yang, Hengyi. Dynamic Programming algorithm for Computing Temporal Logic Robustness.

Degree: MS, Computer Science, 2013, Arizona State University

 In this thesis we deal with the problem of temporal logic robustness estimation. We present a dynamic programming algorithm for the robust estimation problem of… (more)

Subjects/Keywords: Computer science; Dynamic Programming; Linear &; Metric Temporal Logic; Robustness

…x5D;. Recently, progress has been made to use temporal logic to capture more information and… …mainly focus on Metric Temporal Logic (MTL) [3] which provides the ability… …a physical system in [2]. The computation of temporal logic robustness was… …TALIRO. We came up with the solution to apply dynamic programming algorithm for temporal logic… …that we have refined the dynamic programming algorithm for temporal logic robustness problem… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Yang, H. (2013). Dynamic Programming algorithm for Computing Temporal Logic Robustness. (Masters Thesis). Arizona State University. Retrieved from http://repository.asu.edu/items/18026

Chicago Manual of Style (16th Edition):

Yang, Hengyi. “Dynamic Programming algorithm for Computing Temporal Logic Robustness.” 2013. Masters Thesis, Arizona State University. Accessed July 23, 2019. http://repository.asu.edu/items/18026.

MLA Handbook (7th Edition):

Yang, Hengyi. “Dynamic Programming algorithm for Computing Temporal Logic Robustness.” 2013. Web. 23 Jul 2019.

Vancouver:

Yang H. Dynamic Programming algorithm for Computing Temporal Logic Robustness. [Internet] [Masters thesis]. Arizona State University; 2013. [cited 2019 Jul 23]. Available from: http://repository.asu.edu/items/18026.

Council of Science Editors:

Yang H. Dynamic Programming algorithm for Computing Temporal Logic Robustness. [Masters Thesis]. Arizona State University; 2013. Available from: http://repository.asu.edu/items/18026


Delft University of Technology

16. Adzkiya, D. Finite Abstractions of Max-Plus-Linear Systems: Theory and Algorithms.

Degree: 2014, Delft University of Technology

 Max-Plus-Linear (MPL) systems are a class of discrete-event systems with a continuous state space characterizing the timing of the underlying sequential discrete events. These systems… (more)

Subjects/Keywords: max-plus-linear systems; switching min-plus-linear systems; network calculus; stochastic max-plus-linear systems; finite abstractions; reachability; linear temporal logic; probabilistic invariance specifications

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Adzkiya, D. (2014). Finite Abstractions of Max-Plus-Linear Systems: Theory and Algorithms. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:9404b6f4-2cf0-4a7f-bd12-132a8cd0f43b ; urn:NBN:nl:ui:24-uuid:9404b6f4-2cf0-4a7f-bd12-132a8cd0f43b ; urn:NBN:nl:ui:24-uuid:9404b6f4-2cf0-4a7f-bd12-132a8cd0f43b ; http://resolver.tudelft.nl/uuid:9404b6f4-2cf0-4a7f-bd12-132a8cd0f43b

Chicago Manual of Style (16th Edition):

Adzkiya, D. “Finite Abstractions of Max-Plus-Linear Systems: Theory and Algorithms.” 2014. Doctoral Dissertation, Delft University of Technology. Accessed July 23, 2019. http://resolver.tudelft.nl/uuid:9404b6f4-2cf0-4a7f-bd12-132a8cd0f43b ; urn:NBN:nl:ui:24-uuid:9404b6f4-2cf0-4a7f-bd12-132a8cd0f43b ; urn:NBN:nl:ui:24-uuid:9404b6f4-2cf0-4a7f-bd12-132a8cd0f43b ; http://resolver.tudelft.nl/uuid:9404b6f4-2cf0-4a7f-bd12-132a8cd0f43b.

MLA Handbook (7th Edition):

Adzkiya, D. “Finite Abstractions of Max-Plus-Linear Systems: Theory and Algorithms.” 2014. Web. 23 Jul 2019.

Vancouver:

Adzkiya D. Finite Abstractions of Max-Plus-Linear Systems: Theory and Algorithms. [Internet] [Doctoral dissertation]. Delft University of Technology; 2014. [cited 2019 Jul 23]. Available from: http://resolver.tudelft.nl/uuid:9404b6f4-2cf0-4a7f-bd12-132a8cd0f43b ; urn:NBN:nl:ui:24-uuid:9404b6f4-2cf0-4a7f-bd12-132a8cd0f43b ; urn:NBN:nl:ui:24-uuid:9404b6f4-2cf0-4a7f-bd12-132a8cd0f43b ; http://resolver.tudelft.nl/uuid:9404b6f4-2cf0-4a7f-bd12-132a8cd0f43b.

Council of Science Editors:

Adzkiya D. Finite Abstractions of Max-Plus-Linear Systems: Theory and Algorithms. [Doctoral Dissertation]. Delft University of Technology; 2014. Available from: http://resolver.tudelft.nl/uuid:9404b6f4-2cf0-4a7f-bd12-132a8cd0f43b ; urn:NBN:nl:ui:24-uuid:9404b6f4-2cf0-4a7f-bd12-132a8cd0f43b ; urn:NBN:nl:ui:24-uuid:9404b6f4-2cf0-4a7f-bd12-132a8cd0f43b ; http://resolver.tudelft.nl/uuid:9404b6f4-2cf0-4a7f-bd12-132a8cd0f43b


RMIT University

17. Pham, D. Flexible agent protocols via temporal linear logic.

Degree: 2007, RMIT University

 Multi-agent systems have emerged as a new field that addresses issues among distributed, interconnected and intelligent systems such as conflicts of interests, global constraints, and… (more)

Subjects/Keywords: Fields of Research; Agent communication languages and protocols; logic and formal models of agency and multi agent systems; temporal linear logic; linear logic; choice; possibility; flexibility; commitment; partial handling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pham, D. (2007). Flexible agent protocols via temporal linear logic. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:161792

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Pham, D. “Flexible agent protocols via temporal linear logic.” 2007. Thesis, RMIT University. Accessed July 23, 2019. http://researchbank.rmit.edu.au/view/rmit:161792.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Pham, D. “Flexible agent protocols via temporal linear logic.” 2007. Web. 23 Jul 2019.

Vancouver:

Pham D. Flexible agent protocols via temporal linear logic. [Internet] [Thesis]. RMIT University; 2007. [cited 2019 Jul 23]. Available from: http://researchbank.rmit.edu.au/view/rmit:161792.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pham D. Flexible agent protocols via temporal linear logic. [Thesis]. RMIT University; 2007. Available from: http://researchbank.rmit.edu.au/view/rmit:161792

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

18. Tauriainen, Heikki. Automata and Linear Temporal Logic: Translations with Transition-Based Acceptance.

Degree: 2006, Helsinki University of Technology

Automata theory provides powerful tools for designing and implementing decision procedures for temporal logics and their applications to the automatic verification of systems against their… (more)

Subjects/Keywords: linear time temporal logic; alternating automata; nondeterministic automata; transition-based acceptance; minimization; nondeterminization; emptiness checking; nested depth-first search; lineaarisen ajan temporaalilogiikka; alternoivat automaatit; epädeterministiset automaatit; siirtymäpohjainen hyväksyvyys; automaattien sieventäminen; epädeterminisointi; tyhjyystarkastus; sisäkkäinen syvyyshaku

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Tauriainen, H. (2006). Automata and Linear Temporal Logic: Translations with Transition-Based Acceptance. (Thesis). Helsinki University of Technology. Retrieved from http://lib.tkk.fi/Diss/2006/isbn9512283433/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Tauriainen, Heikki. “Automata and Linear Temporal Logic: Translations with Transition-Based Acceptance.” 2006. Thesis, Helsinki University of Technology. Accessed July 23, 2019. http://lib.tkk.fi/Diss/2006/isbn9512283433/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Tauriainen, Heikki. “Automata and Linear Temporal Logic: Translations with Transition-Based Acceptance.” 2006. Web. 23 Jul 2019.

Vancouver:

Tauriainen H. Automata and Linear Temporal Logic: Translations with Transition-Based Acceptance. [Internet] [Thesis]. Helsinki University of Technology; 2006. [cited 2019 Jul 23]. Available from: http://lib.tkk.fi/Diss/2006/isbn9512283433/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tauriainen H. Automata and Linear Temporal Logic: Translations with Transition-Based Acceptance. [Thesis]. Helsinki University of Technology; 2006. Available from: http://lib.tkk.fi/Diss/2006/isbn9512283433/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Queensland

19. Kromodimoeljo, Sentot. Controlling the Generation of Multiple Counterexamples in LTL Model Checking.

Degree: School of Information Technology and Electrical Engineering, 2014, University of Queensland

Subjects/Keywords: Linear temporal logic; Symbolic model checking; Multiple counterexamples; Behavior trees; 0802 Computation Theory and Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kromodimoeljo, S. (2014). Controlling the Generation of Multiple Counterexamples in LTL Model Checking. (Thesis). University of Queensland. Retrieved from http://espace.library.uq.edu.au/view/UQ:347070

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Kromodimoeljo, Sentot. “Controlling the Generation of Multiple Counterexamples in LTL Model Checking.” 2014. Thesis, University of Queensland. Accessed July 23, 2019. http://espace.library.uq.edu.au/view/UQ:347070.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kromodimoeljo, Sentot. “Controlling the Generation of Multiple Counterexamples in LTL Model Checking.” 2014. Web. 23 Jul 2019.

Vancouver:

Kromodimoeljo S. Controlling the Generation of Multiple Counterexamples in LTL Model Checking. [Internet] [Thesis]. University of Queensland; 2014. [cited 2019 Jul 23]. Available from: http://espace.library.uq.edu.au/view/UQ:347070.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kromodimoeljo S. Controlling the Generation of Multiple Counterexamples in LTL Model Checking. [Thesis]. University of Queensland; 2014. Available from: http://espace.library.uq.edu.au/view/UQ:347070

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Vienna

20. Ul, Muram Faiz. Supporting automated containment checking of software behavioural models.

Degree: 2017, University of Vienna

 Während des Softwareentwicklungsprozesses ist es eine große Herausforderung, bereits in den frühen Phasen auf verschiedenen Abstraktionsebenen festzustellen, ob ein System von beabsichtigtem Verhalten abweicht und… (more)

Subjects/Keywords: 54.52 Software engineering; Containment Checking / Konsistenzprüfung / Modellprüfung / Modelltransformation / Graphensuche / Verhaltensmodelle / Architekturmuster / Lineare temporale Logik; Containment Checking / Consistency Checking / Model Checking / Model Transformation / Graph Search / Behaviour Models / Architectural Patterns / Linear Temporal Logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ul, M. F. (2017). Supporting automated containment checking of software behavioural models. (Thesis). University of Vienna. Retrieved from http://othes.univie.ac.at/47558/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ul, Muram Faiz. “Supporting automated containment checking of software behavioural models.” 2017. Thesis, University of Vienna. Accessed July 23, 2019. http://othes.univie.ac.at/47558/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ul, Muram Faiz. “Supporting automated containment checking of software behavioural models.” 2017. Web. 23 Jul 2019.

Vancouver:

Ul MF. Supporting automated containment checking of software behavioural models. [Internet] [Thesis]. University of Vienna; 2017. [cited 2019 Jul 23]. Available from: http://othes.univie.ac.at/47558/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ul MF. Supporting automated containment checking of software behavioural models. [Thesis]. University of Vienna; 2017. Available from: http://othes.univie.ac.at/47558/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


KTH

21. Olsson, Jakob. Measuring the Technical and Process Benefits of Test Automation based on Machine Learning in an Embedded Device.

Degree: SCS, 2018, KTH

Learning-based testing is a testing paradigm that combines model-based testing with machine learning algorithms to automate the modeling of the SUT, test case generation,… (more)

Subjects/Keywords: testing; test automation; LBT; learning-based testing; telecommunication system; embedded system; embedded device; linear temporal logic; LTL; generation from data model; user requirements; inteno; micro bus architecture; ubus; key performance indicator; KPI; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Olsson, J. (2018). Measuring the Technical and Process Benefits of Test Automation based on Machine Learning in an Embedded Device. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231785

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Olsson, Jakob. “Measuring the Technical and Process Benefits of Test Automation based on Machine Learning in an Embedded Device.” 2018. Thesis, KTH. Accessed July 23, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231785.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Olsson, Jakob. “Measuring the Technical and Process Benefits of Test Automation based on Machine Learning in an Embedded Device.” 2018. Web. 23 Jul 2019.

Vancouver:

Olsson J. Measuring the Technical and Process Benefits of Test Automation based on Machine Learning in an Embedded Device. [Internet] [Thesis]. KTH; 2018. [cited 2019 Jul 23]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231785.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Olsson J. Measuring the Technical and Process Benefits of Test Automation based on Machine Learning in an Embedded Device. [Thesis]. KTH; 2018. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231785

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Virginia Tech

22. Stamenkovich, Joseph Allan. Enhancing Trust in Autonomous Systems without Verifying Software.

Degree: MS, Electrical and Computer Engineering, 2019, Virginia Tech

 The complexity of the software behind autonomous systems is rapidly growing, as are the applications of what they can do. It is not unusual for… (more)

Subjects/Keywords: Autonomy; Runtime Verification; FPGA; Field Programmable Gate Array; Monitor; Formal Methods; UAS; UAV; Security; Linear Temporal Logic; LTL; High-Level Synthesis; HLS; monitor; model; checking; drone; malware; assurance; robotics; firmware; hardware

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Stamenkovich, J. A. (2019). Enhancing Trust in Autonomous Systems without Verifying Software. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/89950

Chicago Manual of Style (16th Edition):

Stamenkovich, Joseph Allan. “Enhancing Trust in Autonomous Systems without Verifying Software.” 2019. Masters Thesis, Virginia Tech. Accessed July 23, 2019. http://hdl.handle.net/10919/89950.

MLA Handbook (7th Edition):

Stamenkovich, Joseph Allan. “Enhancing Trust in Autonomous Systems without Verifying Software.” 2019. Web. 23 Jul 2019.

Vancouver:

Stamenkovich JA. Enhancing Trust in Autonomous Systems without Verifying Software. [Internet] [Masters thesis]. Virginia Tech; 2019. [cited 2019 Jul 23]. Available from: http://hdl.handle.net/10919/89950.

Council of Science Editors:

Stamenkovich JA. Enhancing Trust in Autonomous Systems without Verifying Software. [Masters Thesis]. Virginia Tech; 2019. Available from: http://hdl.handle.net/10919/89950

23. 山下, ひとみ. 線形な様相論理と時間論理の研究.

Degree: Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学

Supervisor:小野 寛晰

情報科学研究科

修士

Subjects/Keywords: 線形様相論理、線形時間論理、完全性、サークル、公理化; Linear modallogic, Linear temporal logic, Completeness, Circle, Axiomatization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

山下, . (n.d.). 線形な様相論理と時間論理の研究. (Thesis). Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学. Retrieved from http://hdl.handle.net/10119/3580

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

山下, ひとみ. “線形な様相論理と時間論理の研究.” Thesis, Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学. Accessed July 23, 2019. http://hdl.handle.net/10119/3580.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

山下, ひとみ. “線形な様相論理と時間論理の研究.” Web. 23 Jul 2019.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

山下 . 線形な様相論理と時間論理の研究. [Internet] [Thesis]. Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学; [cited 2019 Jul 23]. Available from: http://hdl.handle.net/10119/3580.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

山下 . 線形な様相論理と時間論理の研究. [Thesis]. Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学; Available from: http://hdl.handle.net/10119/3580

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

24. Huzaifa, Muhammad Umer. Movement theory inspired robot motion strategies and design of a bipedal walker.

Degree: MS, Mechanical Engineering, 2016, University of Illinois – Urbana-Champaign

 This work explores top down embodied movement analysis with reference to movement literature like Laban/Bartenieff Movement Studies (LBMS) and movement sequencing as in choreography. First,… (more)

Subjects/Keywords: Bipedal Robot; Robotics; Supervisory Control; Linear Temporal Logic; Laban/Bartenieff Movement Studies; Bartenieff's Basic Six; Core-located Actuation

Temporal Logic (LTL) [11]. With the notion of temporal logic, formal… …environments. There are other tools for temporal logic planning as well. For example, a… …the computer science community. Different formal logic tools have been developed over the… …decades for verification of algorithms related to software systems. One such example is Linear… …representative work in Computational Tree Logic (CTL) was written by [12] where… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Huzaifa, M. U. (2016). Movement theory inspired robot motion strategies and design of a bipedal walker. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/92869

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Huzaifa, Muhammad Umer. “Movement theory inspired robot motion strategies and design of a bipedal walker.” 2016. Thesis, University of Illinois – Urbana-Champaign. Accessed July 23, 2019. http://hdl.handle.net/2142/92869.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Huzaifa, Muhammad Umer. “Movement theory inspired robot motion strategies and design of a bipedal walker.” 2016. Web. 23 Jul 2019.

Vancouver:

Huzaifa MU. Movement theory inspired robot motion strategies and design of a bipedal walker. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2016. [cited 2019 Jul 23]. Available from: http://hdl.handle.net/2142/92869.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Huzaifa MU. Movement theory inspired robot motion strategies and design of a bipedal walker. [Thesis]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/92869

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

25. Ognjanović Zoran. Some probability logics and their applications in computer sciences.

Degree: PhD, Science, 1999, University of Kragujevac

 Part1. Subjective and objective interpretations of probability are described. The organization of the text is given. Part2. Some propositional probability logics are introduced. Their languages,… (more)

Subjects/Keywords: probability logic; uncertain reasoning; axiomatization; infinitary inference rules; completeness; decidability; linear programming; temporal logic; automated theorem proving; verovatnosna logika; rezonovanje u prisustvu neizvesnosti; aksiomatizacija; beskonačna pravila; potpunost; odlučivost; linearno programiranje; vremenske logike; automatsko dokazivanje teorema

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zoran, O. (1999). Some probability logics and their applications in computer sciences. (Doctoral Dissertation). University of Kragujevac. Retrieved from http://dx.doi.org/10.2298/KG19990903OGNJANOVIC ; http://eteze.kg.ac.rs/application/showtheses?thesesId=139 ; https://fedorakg.kg.ac.rs/fedora/get/o:206/bdef:Content/get ; http://vbs.rs/scripts/cobiss?command=SEARCH&base=99999&select=ID=517319573

Chicago Manual of Style (16th Edition):

Zoran, Ognjanović. “Some probability logics and their applications in computer sciences.” 1999. Doctoral Dissertation, University of Kragujevac. Accessed July 23, 2019. http://dx.doi.org/10.2298/KG19990903OGNJANOVIC ; http://eteze.kg.ac.rs/application/showtheses?thesesId=139 ; https://fedorakg.kg.ac.rs/fedora/get/o:206/bdef:Content/get ; http://vbs.rs/scripts/cobiss?command=SEARCH&base=99999&select=ID=517319573.

MLA Handbook (7th Edition):

Zoran, Ognjanović. “Some probability logics and their applications in computer sciences.” 1999. Web. 23 Jul 2019.

Vancouver:

Zoran O. Some probability logics and their applications in computer sciences. [Internet] [Doctoral dissertation]. University of Kragujevac; 1999. [cited 2019 Jul 23]. Available from: http://dx.doi.org/10.2298/KG19990903OGNJANOVIC ; http://eteze.kg.ac.rs/application/showtheses?thesesId=139 ; https://fedorakg.kg.ac.rs/fedora/get/o:206/bdef:Content/get ; http://vbs.rs/scripts/cobiss?command=SEARCH&base=99999&select=ID=517319573.

Council of Science Editors:

Zoran O. Some probability logics and their applications in computer sciences. [Doctoral Dissertation]. University of Kragujevac; 1999. Available from: http://dx.doi.org/10.2298/KG19990903OGNJANOVIC ; http://eteze.kg.ac.rs/application/showtheses?thesesId=139 ; https://fedorakg.kg.ac.rs/fedora/get/o:206/bdef:Content/get ; http://vbs.rs/scripts/cobiss?command=SEARCH&base=99999&select=ID=517319573

26. Rozier, Kristin Yvonne. Explicit or Symbolic Translation of Linear Temporal Logic to Automata.

Degree: PhD, Engineering, 2013, Rice University

 Formal verification techniques are growing increasingly vital for the development of safety-critical software and hardware in practice. Techniques such as requirements-based design and model checking… (more)

Subjects/Keywords: Linear temporal logic; LTL; Model checking; Explicit model checking; Symbolic model checking; Ltl satisfiability checking; Specification debugging; Property assurance; PANDA; Symbolic Automata; LTL-to-automata

…computationally demanding. 1.3 Linear Temporal Logic The focus of this dissertation is on… …satisfiability checking and model checking using Linear Temporal Logic (LTL) specifications… …future. 18 Chapter 2 Linear Temporal Logic Model Checking Theory 2.1 Modeling the System… …is not guaranteed. 2.2 Specifying the Behavior Property: Linear Temporal Logic Real-world… …in temporal logic. We check that M, s |= ϕ. In other words, we check that M satisfies (… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rozier, K. Y. (2013). Explicit or Symbolic Translation of Linear Temporal Logic to Automata. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/71687

Chicago Manual of Style (16th Edition):

Rozier, Kristin Yvonne. “Explicit or Symbolic Translation of Linear Temporal Logic to Automata.” 2013. Doctoral Dissertation, Rice University. Accessed July 23, 2019. http://hdl.handle.net/1911/71687.

MLA Handbook (7th Edition):

Rozier, Kristin Yvonne. “Explicit or Symbolic Translation of Linear Temporal Logic to Automata.” 2013. Web. 23 Jul 2019.

Vancouver:

Rozier KY. Explicit or Symbolic Translation of Linear Temporal Logic to Automata. [Internet] [Doctoral dissertation]. Rice University; 2013. [cited 2019 Jul 23]. Available from: http://hdl.handle.net/1911/71687.

Council of Science Editors:

Rozier KY. Explicit or Symbolic Translation of Linear Temporal Logic to Automata. [Doctoral Dissertation]. Rice University; 2013. Available from: http://hdl.handle.net/1911/71687

27. Dahlan, B. Finite Abstractions of Network Calculus Elements for Formal Verification of Network Bounds:.

Degree: 2013, Delft University of Technology

 This thesis presents a method to semi-automate the reasoning about network bounds, namely the backlog and delay. Network Calculus offers a rich theory for modeling… (more)

Subjects/Keywords: Networked Control Systems; Network Calculus; Leaky Buckets; Latency-Rate Servers; Virtual Delay; Backlog; Min-Plus Systems; Piecewise-Affine Systems; Symbolic Models; Finite Abstractions; Formal Methods; Verification; Model Checking; Linear Temporal Logic

…2-4-2 Linear Temporal Logic (LTL)… …Linear Temporal Logic (LTL) Temporal logic is a logical formalism that extends… …x5B;41], LTL is one prominent example of temporal logic that is based on the linear… …temporal logic for formal verification. In Chapter 5, the presented techniques are applied to an… …temporal logic operators are: ♦ for “eventually,” for “always,” for “next,” and U for “until.” 2… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Sample image

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Dahlan, B. (2013). Finite Abstractions of Network Calculus Elements for Formal Verification of Network Bounds:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:c6a21f0e-8bac-440b-a360-eaf4212c8107

Chicago Manual of Style (16th Edition):

Dahlan, B. “Finite Abstractions of Network Calculus Elements for Formal Verification of Network Bounds:.” 2013. Masters Thesis, Delft University of Technology. Accessed July 23, 2019. http://resolver.tudelft.nl/uuid:c6a21f0e-8bac-440b-a360-eaf4212c8107.

MLA Handbook (7th Edition):

Dahlan, B. “Finite Abstractions of Network Calculus Elements for Formal Verification of Network Bounds:.” 2013. Web. 23 Jul 2019.

Vancouver:

Dahlan B. Finite Abstractions of Network Calculus Elements for Formal Verification of Network Bounds:. [Internet] [Masters thesis]. Delft University of Technology; 2013. [cited 2019 Jul 23]. Available from: http://resolver.tudelft.nl/uuid:c6a21f0e-8bac-440b-a360-eaf4212c8107.

Council of Science Editors:

Dahlan B. Finite Abstractions of Network Calculus Elements for Formal Verification of Network Bounds:. [Masters Thesis]. Delft University of Technology; 2013. Available from: http://resolver.tudelft.nl/uuid:c6a21f0e-8bac-440b-a360-eaf4212c8107

.