default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTimo Latvala
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c21]Viorel Preoteasa, Timo Latvala, Kimmo Varpaaniemi:
Modelling Programmable Logic Controllers in Refinement Calculus of Reactive Systems. CS&P 2019- 2017
- [c20]Inna Vistbakka, Elena Troubitsyna, Tuomas Kuismin, Timo Latvala:
Co-engineering Safety and Security in Industrial Control Systems: A Formal Outlook. SERENE 2017: 96-114 - 2016
- [c19]Victor Bos, Timo Vepsäläinen, Yuliya Prokhorova, Timo Latvala:
Time and Space Partitioning Using On-Board Software Reference Architecture. ISSRE Workshops 2016: 17-20 - [c18]Elena Troubitsyna, Linas Laibinis, Inna Pereverzeva, Tuomas Kuismin, Dubravka Ilic, Timo Latvala:
Towards Security-Explicit Formal Modelling of Safety-Critical Systems. SAFECOMP 2016: 213-225 - 2015
- [c17]Anton Tarasyuk, Inna Pereverzeva, Elena Troubitsyna, Timo Latvala:
The Formal Derivation of Mode Logic for Autonomous Satellite Flight Formation. SAFECOMP 2015: 29-43 - 2013
- [j5]Alexei Iliasov, Elena Troubitsyna, Linas Laibinis, Alexander B. Romanovsky
, Kimmo Varpaaniemi, Dubravka Ilic, Timo Latvala:
Developing mode-rich satellite software by refinement in Event-B. Sci. Comput. Program. 78(7): 884-905 (2013) - [c16]Yuliya Prokhorova, Elena Troubitsyna, Linas Laibinis, Dubravka Ilic, Timo Latvala:
Formalisation of an Industrial Approach to Monitoring Critical Data. SAFECOMP 2013: 57-69 - [p1]Dubravka Ilic, Linas Laibinis, Timo Latvala, Elena Troubitsyna, Kimmo Varpaaniemi:
Deployment in the Space Sector. Industrial Deployment of System Engineering Methods 2013: 45-62 - 2012
- [j4]Yuliya Prokhorova, Linas Laibinis, Elena Troubitsyna, Kimmo Varpaaniemi, Timo Latvala:
Deriving a mode logic using failure modes and effects analysis. Int. J. Crit. Comput. Based Syst. 3(4): 305-328 (2012) - [c15]Alexei Iliasov, Alexander B. Romanovsky, Linas Laibinis, Elena Troubitsyna, Timo Latvala:
Augmenting Event-B modelling with real-time verification. FormSERA@ICSE 2012: 51-57 - [c14]Anton Tarasyuk, Inna Pereverzeva, Elena Troubitsyna, Timo Latvala, Laura Nummila:
Formal Development and Assessment of a Reconfigurable On-board Satellite System. SAFECOMP 2012: 210-222 - 2011
- [c13]Yuliya Prokhorova, Linas Laibinis, Elena Troubitsyna, Kimmo Varpaaniemi, Timo Latvala:
Derivation and Formal Verification of a Mode Logic for Layered Control Systems. APSEC 2011: 49-56 - 2010
- [c12]Alexei Iliasov, Elena Troubitsyna, Linas Laibinis, Alexander B. Romanovsky, Kimmo Varpaaniemi, Dubravka Ilic, Timo Latvala:
Supporting Reuse in Event B Development: Modularisation Approach. ASM 2010: 174-188 - [c11]Alexei Iliasov, Elena Troubitsyna, Linas Laibinis, Alexander B. Romanovsky, Kimmo Varpaaniemi, Dubravka Ilic, Timo Latvala:
Developing Mode-Rich Satellite Software by Refinement in Event B. FMICS 2010: 50-66 - [c10]Alexei Iliasov, Elena Troubitsyna, Linas Laibinis, Alexander B. Romanovsky, Kimmo Varpaaniemi, Pauli Väisänen, Dubravka Ilic, Timo Latvala:
Verifying Mode Consistency for On-Board Satellite Software. SAFECOMP 2010: 126-141
2000 – 2009
- 2007
- [c9]Rajesh K. Karmani, Timo Latvala, Gul Agha:
On Scaling Multi-Agent Task Reallocation Using Market-Based Approach. SASO 2007: 173-182 - 2006
- [j3]Armin Biere, Keijo Heljanko, Tommi A. Junttila, Timo Latvala, Viktor Schuppan:
Linear Encodings of Bounded LTL Model Checking. Log. Methods Comput. Sci. 2(5) (2006) - [c8]Keijo Heljanko, Tommi A. Junttila, Misa Keinänen, Martin Lange, Timo Latvala:
Bounded Model Checking for Weak Alternating Büchi Automata. CAV 2006: 95-108 - [c7]Yaniv Eytani, Timo Latvala:
Explaining Intermittent Concurrent Bugs by Minimizing Scheduling Noise. Haifa Verification Conference 2006: 183-197 - [i1]Armin Biere, Keijo Heljanko, Tommi A. Junttila, Timo Latvala, Viktor Schuppan:
Linear Encodings of Bounded LTL Model Checking. CoRR abs/cs/0611029 (2006) - 2005
- [b1]Timo Latvala:
Automata-theoretic and bounded model checking for linear temporal logic. Helsinki University of Technology, Finland, 2005 - [c6]Keijo Heljanko, Tommi A. Junttila, Timo Latvala:
Incremental and Complete Bounded Model Checking for Full PLTL. CAV 2005: 98-111 - [c5]Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila:
Simple Is Better: Efficient Bounded Model Checking for Past LTL. VMCAI 2005: 380-395 - 2004
- [j2]Timo Latvala, Heikki Tauriainen:
Improved On-the-fly Verification with Testers. Nord. J. Comput. 11(2): 148-164 (2004) - [c4]Timo Latvala, Marko Mäkelä:
LTL Model Checking for Modular Petri Nets. ICATPN 2004: 298-311 - [c3]Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila:
Simple Bounded LTL Model Checking. FMCAD 2004: 186-200 - 2003
- [c2]Timo Latvala:
Efficient Model Checking of Safety Properties. SPIN 2003: 74-88 - 2001
- [c1]Timo Latvala:
Model Checking LTL Properties of High-Level Petri Nets with Fairness Constraints. ICATPN 2001: 242-262 - 2000
- [j1]Timo Latvala, Keijo Heljanko:
Coping With Strong Fairness. Fundam. Informaticae 43(1-4): 175-193 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
