default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSven Schneider 0001
Person information
- affiliation: Hasso-Plattner-Institut, Potsdam, Germany
Other persons with the same name
- Sven Schneider 0002
![[0000-0002-1916-5222]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-1916-5222")
— Bonn-Rhein-Sieg University of Applied Sciences, St. Augustin, Germany - Sven Schneider 0003 — University of Sydney, NSW, Australia
- Sven Schneider 0004 — Bauhaus-Universität Weimar, Germany
- Sven Schneider 0005 — Chemnitz University of Technology, Faculty of Computer Science, Germany
- Sven Schneider 0006 — University of Erlangen-Nuremberg, Institute for Factory Automation and Production Systems, Germany
- Sven Schneider 0007 — Stuttgart Technology University of Applied Sciences, Germany
- Sven Schneider 0008 — Bauhaus University Weimar, Weimar, Germany
- Sven Schneider 0009 — Zurich University of Applied Sciences, Winterthur, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Sven Schneider, Maria Maximova, Holger Giese:
Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic. J. Log. Algebraic Methods Program. 137: 100938 (2024)- [c18]Lara Stoltenow, Barbara König, Sven Schneider, Andrea Corradini, Leen Lambers, Fernando Orejas:
Coinductive Techniques for Checking Satisfiability of Generalized Nested Conditions. CONCUR 2024: 39:1-39:20 - [c17]He Xu, Sven Schneider, Holger Giese:
Combining Look-ahead Design-time and Run-time Control-synthesis for Graph Transformation Systems. FASE 2024: 77-100 - [c16]Mustafa Ghani, Sven Schneider, Maria Maximova, Holger Giese:
Deriving Delay-Robust Timed Graph Transformation System Models. ICGT 2024: 158-179 - [i3]Lara Stoltenow, Barbara König, Sven Schneider, Andrea Corradini, Leen Lambers, Fernando Orejas:
Coinductive Techniques for Checking Satisfiability of Generalized Nested Conditions. CoRR abs/2407.06864 (2024) - 2023
- [j7]Boris Flotterer, Maria Maximova, Sven Schneider, Johannes Dyck, Christian Zöllner, Holger Giese, Christelle Hély, Cédric Gaucherel:
Modeling and formal analysis of meta-ecosystems with dynamic structure using graph transformation. Ecol. Informatics 75: 101908 (2023) - [j6]Maria Maximova, Sven Schneider, Holger Giese:
Compositional Analysis of Probabilistic Timed Graph Transformation Systems. Formal Aspects Comput. 35(3): 16:1-16:79 (2023) - [j5]Sven Schneider, Leen Lambers:
Evaluation diversity for graph conditions. J. Log. Algebraic Methods Program. 133: 100862 (2023) - 2022
- [c15]Sven Schneider, Maria Maximova, Holger Giese:
Probabilistic Metric Temporal Graph Logic. ICGT 2022: 58-76 - [c14]Sven Schneider, Maria Maximova, Holger Giese:
Invariant Analysis for Multi-agent Graph Transformation Systems Using k-Induction. ICGT 2022: 173-192 - 2021
- [j4]Sven Schneider, Leen Lambers, Fernando Orejas:
A logic-based incremental approach to graph repair featuring delta preservation. Int. J. Softw. Tools Technol. Transf. 23(3): 369-410 (2021) - [j3]Sven Schneider, Maria Maximova, Lucas Sakizloglou, Holger Giese:
Formal testing of timed graph transformation systems using metric temporal graph logic. Int. J. Softw. Tools Technol. Transf. 23(3): 411-488 (2021) - [c13]Maria Maximova, Sven Schneider, Holger Giese:
Compositional Analysis of Probabilistic Timed Graph Transformation Systems. FASE 2021: 196-217 - [c12]Sven Schneider, Leen Lambers:
Evaluation Diversity for Graph Conditions. ICGT 2021: 122-141 - [c11]Maria Maximova, Sven Schneider, Holger Giese:
Interval Probabilistic Timed Graph Transformation Systems. ICGT 2021: 221-239 - [i2]Sven Schneider, Maria Maximova, Holger Giese:
Probabilistic Metric Temporal Graph Logic. CoRR abs/2106.08418 (2021) - 2020
- [c10]Sven Schneider, Johannes Dyck, Holger Giese:
Formal Verification of Invariants for Attributed Graph Transformation Systems Based on Nested Attributed Graph Conditions. ICGT 2020: 257-275 - [c9]Sven Schneider, Lucas Sakizloglou, Maria Maximova, Holger Giese:
Optimistic and Pessimistic On-the-fly Analysis for Metric Temporal Graph Logic. ICGT 2020: 276-294 - [c8]Leen Lambers, Sven Schneider, Marcel Weisgut:
Model-Based Testing of Read Only Graph Queries. ICST Workshops 2020: 24-34
2010 – 2019
- 2019
- [b1]Sven Schneider:
Deterministic pushdown automata as specifications for discrete event supervisory control in Isabelle. Technical University of Berlin, Germany, 2019 - [c7]Sven Schneider, Leen Lambers, Fernando Orejas:
A Logic-Based Incremental Approach to Graph Repair. FASE 2019: 151-167 - [c6]Holger Giese, Maria Maximova, Lucas Sakizloglou, Sven Schneider:
Metric Temporal Graph Logic over Typed Attributed Graphs. FASE 2019: 282-298 - 2018
- [j2]Sven Schneider, Leen Lambers, Fernando Orejas:
Automated reasoning for attributed graph properties. Int. J. Softw. Tools Technol. Transf. 20(6): 705-737 (2018) - 2017
- [c5]Sven Schneider, Leen Lambers, Fernando Orejas:
Symbolic Model Generation for Graph Properties. FASE 2017: 226-243 - 2016
- [j1]Anne-Kathrin Schmuck, Sven Schneider, Jörg Raisch, Uwe Nestmann:
Supervisory control synthesis for deterministic context free specification languages - Enforcing controllability least restrictively. Discret. Event Dyn. Syst. 26(1): 5-32 (2016) - 2014
- [c4]Sven Schneider, Anne-Kathrin Schmuck, Uwe Nestmann, Jörg Raisch:
Reducing an Operational Supervisory Control Problem by Decomposition for Deterministic Pushdown Automata. WODES 2014: 214-221 - [c3]Anne-Kathrin Schmuck, Sven Schneider, Jörg Raisch, Uwe Nestmann:
Extending Supervisory Controller Synthesis to Deterministic Pushdown Automata - Enforcing Controllability Least Restrictively. WODES 2014: 286-293 - [i1]Sven Schneider, Uwe Nestmann:
Enforcing Operational Properties including Blockfreeness for Deterministic Pushdown Automata. CoRR abs/1403.5081 (2014) - 2011
- [c2]Sven Schneider, Uwe Nestmann:
Rigorous Discretization of Hybrid Systems Using Process Calculi. FORMATS 2011: 301-316
2000 – 2009
- 2008
- [c1]Sven Schneider, Johannes Borgström, Uwe Nestmann:
Towards the Application of Process Calculi in the Domain of Peer-to-Peer Algorithms. SJTU-TUB Joint Workshop 2008: 97-104
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-10-16 21:25 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:
