![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Nikola Trcka
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [c22]Nikola Trcka, Mark Moulin, Shaunak D. Bopardikar, Alberto Speranzon:
A formal verification approach to revealing stealth attacks on networked control systems. HiCoNS 2014: 67-76 - 2013
- [c21]Nikola Trcka, Amit Surana:
Planning with process algebraic constraints: Application to multi-vehicle routing problem. ICRA 2013: 3489-3496 - 2012
- [j7]Suzana Andova, Sonja Georgievska, Nikola Trcka:
Branching bisimulation congruence for probabilistic systems. Theor. Comput. Sci. 413(1): 58-72 (2012) - [c20]Mykola Pechenizkiy, Nikola Trcka, Paul De Bra, Pedro A. Toledo:
CurriM: Curriculum Mining. EDM 2012: 216-217 - [c19]Twan Basten
, Martijn Hendriks, Lou J. Somers, Nikola Trcka:
Model-Driven Design-Space Exploration for Software-Intensive Embedded Systems - (Extended Abstract). FORMATS 2012: 1-6 - 2011
- [j6]Natalia Sidorova
, Christian Stahl, Nikola Trcka:
Soundness verification for conceptual workflow nets with data: Early detection of errors with the most precision possible. Inf. Syst. 36(7): 1026-1043 (2011) - [c18]Nikola Trcka, Marc Voorhoeve, Twan Basten
:
Parameterized Partial Orders for Modeling Embedded System Use Cases: Formal Definition and Translation to Coloured Petri Nets. ACSD 2011: 13-18 - [c17]Nikola Trcka, Martijn Hendriks, Twan Basten
, Marc Geilen
, Lou J. Somers:
Integrated model-driven design-space exploration for embedded systems. ICSAMOS 2011: 339-346 - 2010
- [j5]Wil M. P. van der Aalst
, Carmen Bratosin, Natalia Sidorova
, Nikola Trcka:
A reference model for grid architectures and its validation. Concurr. Comput. Pract. Exp. 22(11): 1365-1385 (2010) - [c16]Nikola Trcka:
Workflow Data Footprints. BIS 2010: 218-229 - [c15]Natalia Sidorova
, Christian Stahl, Nikola Trcka:
Workflow Soundness Revisited: Checking Correctness in the Presence of Data While Staying Conceptual. CAiSE 2010: 530-544
2000 – 2009
- 2009
- [j4]Rob J. van Glabbeek, Bas Luttik, Nikola Trcka:
Computation Tree Logic with Deadlock Detection. Log. Methods Comput. Sci. 5(4) (2009) - [j3]Rob J. van Glabbeek, Bas Luttik, Nikola Trcka:
Branching Bisimilarity with Explicit Divergence. Fundam. Informaticae 93(4): 371-392 (2009) - [j2]Jasen Markovski, Ana Sokolova
, Nikola Trcka, Erik P. de Vink:
Compositionality for Markov reward chains with fast and silent transitions. Perform. Evaluation 66(8): 435-452 (2009) - [c14]Nikola Trcka, Wil M. P. van der Aalst
, Natalia Sidorova
:
Data-Flow Anti-patterns: Discovering Data-Flow Errors in Workflows. CAiSE 2009: 425-439 - [c13]Nikola Trcka, Wil M. P. van der Aalst
, Natalia Sidorova
:
Workflow completion patterns. CASE 2009: 7-12 - [c12]Mykola Pechenizkiy, Nikola Trcka, Ekaterina Vasilyeva, Wil M. P. van der Aalst, Paul De Bra:
Process Mining Online Assessment Data. EDM 2009: 279-288 - [c11]Nikola Trcka, Mykola Pechenizkiy
:
From Local Patterns to Global Models: Towards Domain Driven Educational Process Mining. ISDA 2009: 1114-1119 - [c10]Nikola Trcka:
Strong, Weak and Branching Bisimulation for Transition Systems and Markov Reward Chains: A Unifying Matrix Approach. QFM 2009: 55-65 - 2008
- [c9]Nikola Trcka, Natalia Sidorova
, Wil M. P. van der Aalst
:
Soundness and Niceness as Correctness Criteria for Grid Workflows. eScience 2008: 55-62 - [c8]Jasen Markovski, Nikola Trcka:
Aggregation Methods for Markov Reward Chains with Fast and Silent Transitions. MMB 2008: 93-108 - [c7]Nikola Trcka, Wil M. P. van der Aalst
, Carmen Bratosin, Natalia Sidorova
:
Evaluating a Data Removal Strategy for Grid Environments Using Colored Petri Nets. OPODIS 2008: 538-541 - [c6]Carmen Bratosin, Wil M. P. van der Aalst
, Natalia Sidorova
, Nikola Trcka:
A Reference Model for Grid Architectures and Its Analysis. OTM Conferences (1) 2008: 898-913 - [c5]Nikola Trcka, Sonja Georgievska:
Branching Bisimulation Congruence for Probabilistic Systems. QAPL 2008: 129-143 - [i1]Rob J. van Glabbeek, Bas Luttik, Nikola Trcka:
Branching Bisimilarity with Explicit Divergence. CoRR abs/0812.3068 (2008) - 2007
- [c4]Jasen Markovski, Ana Sokolova, Nikola Trcka, Erik P. de Vink:
Compositionality for Markov Reward Chains with Fast Transitions. EPEW 2007: 18-32 - 2006
- [c3]Nikola Trcka:
Verifying chi Models of Industrial Systems with Spin. ICFEM 2006: 132-148 - [c2]Jasen Markovski, Nikola Trcka:
Lumping Markov Chains with Silent Steps. QEST 2006: 221-232 - 2005
- [j1]Elena M. Bortnik, Nikola Trcka, Anton Wijs
, Bas Luttik, Joanna M. van de Mortel-Fronczak, Jos C. M. Baeten, Wan J. Fokkink
, Jacobus E. Rooda:
Analyzing a chi model of a turntable system using Spin, CADP and Uppaal. J. Log. Algebraic Methods Program. 65(2): 51-104 (2005) - [c1]Bas Luttik, Nikola Trcka:
Stuttering Congruence for chi. SPIN 2005: 185-199
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint