Personensuche
Personensuche
Es wurde 1 Person gefunden.
Informatik / AI
Anschrift
Lotharstr. 65 (LF)
47057 Duisburg
47057 Duisburg
Raum
LF 264
Telefon
Telefax
E-Mail
Webseite
Funktionen
-
Studiendekan/in, Informatik
-
Vorsitzende, Studienbeirat
-
Studiendekan/in, Fakultätsrat
-
Universitätsprofessor/in, Theoretische Informatik
Aktuelle Veranstaltungen
-
2024 WS
Vergangene Veranstaltungen (max. 10)
-
2024 SS
-
2023 WS
Die folgenden Publikationen sind in der Online-Universitätsbibliographie der Universität Duisburg-Essen verzeichnet. Weitere Informationen finden Sie gegebenenfalls auch auf den persönlichen Webseiten der Person.
-
Fixpoint Theory : Upside DownIn: Logical Methods in Computer Science Jg. 19 (2023) Nr. 2, S. 15:1 - 15:60Online Volltext: dx.doi.org/ (Open Access)
-
Up-to techniques for behavioural metrics via fibrationsIn: Mathematical Structures in Computer Science Jg. 33 (2023) Nr. 4-5: Differences and Metrics in Programs Semantics: Advances in Quantitative Relational Reasoning, S. 182 - 221Online Volltext: dx.doi.org/ (Open Access)
-
Conditional Bisimilarity for Reactive SystemsIn: Logical Methods in Computer Science Jg. 18 (2022) Nr. 1, S. 6:1 - 6:41Online Volltext: dx.doi.org/ (Open Access)
-
Conditional transition systems with upgradesIn: Science of Computer Programming Jg. 186 (2020) 102320Online Volltext: dx.doi.org/ (Open Access)
-
Permutation flow shop scheduling: Variability of completion time differences : NP-completenessIn: International Journal of Operational Research: IJOR Jg. 39 (2020) Nr. 4, S. 562 - 573Online Volltext: dx.doi.org/
-
CoReS: A tool for computing core graphs via SAT/SMT solversIn: Journal of Logical and Algebraic Methods in Programming Jg. 109 (2019) S. 100484Online Volltext: dx.doi.org/
-
Fixpoint games on continuous latticesIn: Proceedings of the ACM on Programming Languages Jg. 3 (2019) Nr. POPL, S. 26Online Volltext: dx.doi.org/ (Open Access)
-
Specifying graph languages with type graphsIn: Journal of Logical and Algebraic Methods in Programming Jg. 104 (2019) S. 176 - 200Online Volltext: dx.doi.org/ (Open Access)
-
A coalgebraic treatment of conditional transition systems with upgradesIn: Logical Methods in Computer Science Jg. 14 (2018) Nr. 1, S. 19Online Volltext: dx.doi.org/ (Open Access)
-
A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automataIn: Soft Computing Jg. 22 (2018) Nr. 4, S. 1103 - 1120Online Volltext: dx.doi.org/
-
Coalgebraic behavioral metricsIn: Logical Methods in Computer Science Jg. 14 (2018) Nr. 3, S. 20Online Volltext: dx.doi.org/ (Open Access)
-
Recognizable languages of arrows and cospansIn: Mathematical Structures in Computer Science Jg. 28 (2018) Nr. 8, S. 1290 - 1332Online Volltext: dx.doi.org/
-
Well-structured graph transformation systemsIn: Information and Computation Jg. 252 (2017) S. 71 - 94Online Volltext: dx.doi.org/
-
Robustness and closure properties of recognizable languages in adhesive categoriesIn: Science of Computer Programming Jg. 104 (2015) S. 71 - 98Online Volltext: dx.doi.org/
-
Towards trace metrics via functor liftingIn: Leibniz International Proceedings in Informatics (LIPIcs) Jg. 35 (2015) Nr. October, S. 35 - 49Online Volltext: dx.doi.org/ Online Volltext
-
Verification of Evolving Graph Structures : Dagstuhl Seminar 15451In: Dagstuhl Reports Jg. 5 (2015) Nr. 11, S. 1 - 28Online Volltext: dx.doi.org/ (Open Access)
-
Developments in automated verification techniquesIn: International Journal on Software Tools for Technology Transfer (STTT) Jg. 16 (2014) Nr. 2, S. 123 - 125Online Volltext: dx.doi.org/
-
Processes and unfoldings : Concurrent computations in adhesive categoriesIn: Mathematical Structures in Computer Science Jg. 24 (2014) Nr. 4, 240402Online Volltext: dx.doi.org/ Online Volltext (Open Access)
-
Coalgebraic trace semantics for continuous probabilistic transition systemsIn: Logical Methods in Computer Science Jg. 9 (2013) Nr. 4, S. 1 - 34Online Volltext: dx.doi.org/ (Open Access)
-
Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automataIn: Journal of Visual Languages and Computing Jg. 24 (2013) Nr. 3, S. 192 - 206Online Volltext: dx.doi.org/
-
Efficient unfolding of contextual Petri netsIn: Theoretical Computer Science Jg. 449 (2012) S. 2 - 22Online Volltext: dx.doi.org/ (Open Access)
-
Structured operational semantics for graph rewritingIn: Scientific Annals of Computer Science Jg. 22 (2012) Nr. 1, S. 105 - 145Online Volltext: dx.doi.org/
-
A lattice-theoretical perspective on adhesive categoriesIn: Journal of Symbolic Computation Jg. 46 (2011) Nr. 3, S. 222 - 245Online Volltext: dx.doi.org/
-
Unfolding-based diagnosis of systems with an evolving topologyIn: Information and Computation Jg. 208 (2010) Nr. 10, S. 1169 - 1192Online Volltext: dx.doi.org/ (Open Access)
-
Behaviour Simulation and Equivalence of Systems Modelled by Graph TransformationIn: Bulletin of the European Association for Theoretical Computer Science (EATCS) (2009) Nr. 97, S. 117 - 125
-
Synthesising CCS bisimulation using graph rewritingIn: Information and Computation Jg. 207 (2009) Nr. 1, S. 14 - 40Online Volltext: dx.doi.org/ (Open Access)
-
A Framework for the Verification of Infinite-State Graph Transformation SystemsIn: Information and Computation Jg. 206 (2008) Nr. 7, S. 869 - 907Online Volltext: dx.doi.org/ (Open Access)
-
Augur 2 - A New Version of a Tool for the Analysis of Graph Transformation Systems
Fifth International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT), 1-2 April 2006, Vienna, Austria,In: Electronic Notes in Theoretical Computer Science Jg. 211 (2008) Nr. C, S. 201 - 210Online Volltext: dx.doi.org/ (Open Access) -
Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri NetsIn: Logical Methods in Computer Science Jg. 4 (2008) Nr. 4, S. 3Online Volltext: dx.doi.org/ (Open Access)
-
Incremental Construction of Coverability GraphsIn: Information Processing Letters Jg. 103 (2007) Nr. 5, S. 203 - 209Online Volltext: dx.doi.org/
-
Inequational Deduction as Term Graph RewritingIn: Electronic Notes in Theoretical Computer Science Jg. 72 (2007) Nr. 1, S. 31 - 44Online Volltext: dx.doi.org/ (Open Access)
-
Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting with Borrowed ContextsIn: Mathematical Structures in Computer Science Jg. 16 (2006) Nr. 6, S. 1133 - 1163Online Volltext: dx.doi.org/
-
A General Framework for Types in Graph RewritingIn: Acta Informatica Jg. 42 (2005) Nr. 4-5, S. 349 - 388Online Volltext: dx.doi.org/
-
Analysing Input/Output-Capabilities of Mobile Processes with a Generic Type SystemIn: Journal of Logic and Algebraic Programming Jg. 63 (2005) Nr. 1, S. 35 - 58Online Volltext: dx.doi.org/ (Open Access)
-
Augur-A Tool for the Analysis of Graph Transformation SystemsIn: Bulletin of the European Association for Theoretical Computer Science (EATCS Bulletin) Jg. 87 (2005) S. 125 - 137
-
On Deterministic Finite Automata and Syntactic Monoid SizeIn: Theoretical Computer Science Jg. 327 (2004) Nr. 3, S. 319 - 347Online Volltext: dx.doi.org/ (Open Access)
-
Regular Languages, Sizes of Syntactic Monoids, Graph Colouring, State Complexity Results, and How These Topics are Related to Each OtherIn: Bulletin of the European Association for Theoretical Computer Science (EATCS Bulletin) Jg. 83 (2004) S. 139 - 155
-
Verifying a Behavioural Logic for Graph Transformation SystemsIn: Electronic Notes in Theoretical Computer Science. - Proceedings of the Workshop of the COMETA Project on Computational Metamodels Jg. 104 (2004) S. 5 - 24
-
The Theory of Finite-State AdventuresIn: Bulletin of the European Association for Theoretical Computer Science (EATCS Bulletin) Jg. 79 (2003) S. 230 - 237
-
Hypergraph Construction and Its Application to the Static Analysis of Concurrent SystemsIn: Mathematical Structures in Computer Science Jg. 12 (2002) Nr. 2, S. 149 - 175Online Volltext: dx.doi.org/
-
A van Benthem Theorem for Quantitative Probabilistic Modal Logic(2018)(Open Access)
-
PrefaceIn: Coalgebraic Methods in Computer Science: Proceedings / 17th IFIP WG 1.3 International Workshop, CMCS 2024, Colocated with ETAPS 2024, Luxembourg City, Luxembourg, April 6–7, 2024 / König, Barbara; Urbat, Henning (Hrsg.) (2024) S. v - vi
-
Preface
23rd International Conference, FOSSACS 2020, 25 - 30 April 2020, Dublin, Ireland,In: Foundations of Software Science and Computation Structures: 23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020, Proceedings / Goubault-Larrecq, Jean; König, Barbara (Hrsg.) (2020)Online Volltext: dx.doi.org/ (Open Access) -
Preface : Proceedings of the Thirty-Fifth Conference on the Mathematical Foundations of Programming SemanticsIn: Electronic Notes in Theoretical Computer Science Jg. 347 (2019) S. 1 - 3Online Volltext: dx.doi.org/ (Open Access)
-
PrefaceIn: STAF 2017 Doctoral Symposium: Proceedings of the Doctoral Symposium Held as a Part of STAF 2017 co-located with Software Technologies: Applications and Foundations (STAF 2017) / Doctoral Symposium as a part of STAF 2017, 17. July 2017, Marburg, Germany / Di Ruscio, Davide; König, Barbara (Hrsg.) Jg. 1955 (2017)Online Volltext (Open Access)
-
Behavioural Metrics : Compositionality of the Kantorovich Lifting and an Application to Up-To TechniquesIn: Proceedings of the 35th International Conference on Concurrency Theory (CONCUR 2024) / 35th International Conference on Concurrency Theory (CONCUR 2024); 9 - 13 September 2024; Calgary, Canada / Majumdar, Rupak; Silva, Alexandra (Hrsg.) 2024 20Online Volltext: dx.doi.org/ Online Volltext (Open Access)
-
Expressive Quantale-Valued Logics for Coalgebras: An Adjunction-Based ApproachIn: 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024) / Symposium on Theoretical Aspects of Computer Science (STACS) / Beyersdorff, Olaf; Kante, Mamadou; Kupferman, Orna; Lokshtanov, Daniel (Hrsg.) 2024 10Online Volltext: dx.doi.org/ (Open Access)
-
Hidden Markov Models with Unobservable TransitionsIn: Taming the Infinities of Concurrency: Essays Dedicated to Javier Esparza on the Occasion of His 60th Birthday / Kiefer, Stefan; Křetínský, Jan; Kučera, Antonín (Hrsg.) 2024, S. 101 - 121Online Volltext: dx.doi.org/
-
A Lattice-Theoretical View of Strategy IterationIn: 31st EACSL Annual Conference on Computer Science Logic: CSL 2023, February 13-16, 2023, Warsaw, Poland / 31st EACSL Annual Conference on Computer Science Logic: CSL 2023, 13.-16.02.2023, Warsaw / Klin, Bartek; Pimentel, Elaine (Hrsg.) 2023 7Online Volltext: dx.doi.org/ Online Volltext (Open Access)
-
A Monoidal View on Fixpoint ChecksIn: Graph Transformation: 16th International Conference, ICGT 2023, Held as Part of STAF 2023, Leicester, UK, July 19–20, 2023, Proceedings / Fernández, Maribel; Poskitt, Christopher M.; 16th International Conference, ICGT 2023, Held as Part of STAF 2023, Leicester, UK, July 19–20, 2023 2023, S. 3 - 21Online Volltext: dx.doi.org/ (Open Access)
-
Hennessy-Milner Theorems via Galois ConnectionsIn: 31st EACSL Annual Conference on Computer Science Logic (CSL 2023) / 31st EACSL Annual Conference on Computer Science Logic, February 13-16, 2023, Warsaw, Poland / Klin, Bartek; Pimentel, Elaine (Hrsg.) 2023 12:1-12:18Online Volltext: dx.doi.org/ (Open Access)
-
Stochastic Decision Petri NetsIn: Application and Theory of Petri Nets and Concurrency: Proceedings / Gomes, Luis; Lorenz, Robert; 44th International Conference, PETRI NETS 2023; Lisbon, Portugal; 25–30 June 2023 2023, S. 264 - 285Online Volltext: dx.doi.org/ (Open Access)
-
Graded Monads and Behavioural Equivalence GamesIn: LICS '22: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science / 37th Annual ACM/IEEE Symposium on Logic in Computer Science ; LICS '22 ; August 2 - 5, 2022, Haifa, Israel / Baier, Christel (Hrsg.) 2022 61Online Volltext: dx.doi.org/
-
Lifecycle-Based View on Cyber-Physical System Models Using Extended Hidden Markov ModelsIn: Proceedings of the 20th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE 2022) / 20. ACM-IEEE International Conference on Formal Methods and Models for System Design: Shanghai, China; Online; 13-14 October 2022 2022Online Volltext: dx.doi.org/
-
Predicate and Relation Liftings for Coalgebras with Side Effects : An Application in Coalgebraic Modal LogicIn: Coalgebraic Methods in Computer Science: Proceedings / 16th IFIP WG 1.3 International Workshop, CMCS 2022, Colocated with ETAPS 2022, Munich, Germany, April 2-3, 2022 / Hansen, Helle Hvid; Zanasi, Fabio (Hrsg.) 2022, S. 1 - 22Online Volltext: dx.doi.org/ (Open Access)
-
Fixpoint theory – upside downIn: Foundations of Software Science and Computation Structures: Proceedings / 24th International Conference, FOSSACS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021 / Kiefer, Stefan; Tasson, Christine (Hrsg.) 2021, S. 62 - 81Online Volltext: dx.doi.org/ (Open Access)
-
A Flexible and Easy-to-Use Library for the Rapid Development of Graph Tools in JavaIn: Graph Transformation: Proceedings / 13th International Conference, ICGT 2020, Held as Part of STAF 2020, Bergen, Norway, June 25–26, 2020 / Gadducci, Fabio; Kehrer, Timo (Hrsg.) 2020, S. 297 - 306Online Volltext: dx.doi.org/ (Open Access)
-
Abstraction, up-to techniques and games for systems of fixpoint equationsIn: Proceedings of the 31st International Conference on Concurrency Theory / CONCUR 2020; Virtual, Vienna, Austria; 1 - 4 September 2020 / Konnov, Igor; Kovacs, Laura (Hrsg.) 2020, S. 251 - 2520Online Volltext: dx.doi.org/ Online Volltext (Open Access)
-
Conditional bisimilarity for reactive systemsIn: 5th International Conference on Formal Structures for Computation and Deduction: FSCD 2020, June 29-July 6, 2020, Paris, France (virtual conference) / International Conference on Formal Structures for Computation and Deduction ; FSCD ; June 29 - July 6, 2020, Paris / Ariola, Zena M. (Hrsg.) 2020, S. 10Online Volltext: dx.doi.org/ Online Volltext
-
Explaining non-bisimilarity in a coalgebraic approach: Games and distinguishing formulasIn: Coalgebraic Methods in Computer Science: Proceedings / 15th IFIP WG 1.3 International Workshop, CMCS 2020, Colocated with ETAPS 2020, Dublin, Ireland, April 25–26, 2020 2020, S. 133 - 154Online Volltext: dx.doi.org/ (Open Access)
-
Uncertainty reasoning for probabilistic petri nets via bayesian networksIn: 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science: FSTTCS 2020, December 14-18, 2020, BITS Pilani, K K Birla Goa Campus, Goa, India (virtual conference) / 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science: FSTTCS 2020, 14.-18.12 2020, Goa, India, Virtual / Saxena, Nitin; Simon, Sunil (Hrsg.) 2020 38Online Volltext: dx.doi.org/ (Open Access)
-
A modal characterization theorem for a probabilistic fuzzy description logicIn: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence / International Joint Conferences on Artifical Intelligence (IJCAI), Macao, 10-16 August 2019 / Kraus, Sarit (Hrsg.) 2019, S. 1900 - 1906Online Volltext: dx.doi.org/ (Open Access)
-
Rewriting Abstract Structures : Materialization Explained CategoricallyIn: Foundations of Software Science and Computation Structures: Proceedings / 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019 2019, S. 169 - 188Online Volltext: dx.doi.org/ (Open Access)
-
(Metric) bisimulation games and real-valued modal logics for coalgebrasIn: 29th International Conference on Concurrency Theory (CONCUR 2018) / CONCUR 2018 : 29th International Conference on Concurrency Theory, Sep 4, 2018 - Sep 7, 2018, Beijing, China 2018Online Volltext: dx.doi.org/
-
A Tutorial on Graph TransformationIn: Graph Transformation, Specifications, and Nets: In Memory of Hartmut Ehrig / Heckel, Reiko; Taentzer, Gabriele (Hrsg.) 2018, S. 83 - 104Online Volltext: dx.doi.org/ Online Volltext (Open Access)
-
A van Benthem Theorem for Fuzzy Modal LogicIn: Proceedings of the Symposium on Logic in Computer Science / 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018; Oxford; United Kingdom; 9 July 2018 through 12 July 2018 Jg. Part F138033 2018, S. 909 - 918Online Volltext: dx.doi.org/ (Open Access)
-
CoReS: A tool for computing core graphs via SAT/SMT solversIn: Graph Transformation / 11th International Conference, ICGT 2018, Held as Part of STAF 2018, Toulouse, France, June 25–26, 2018 2018, S. 37 - 42Online Volltext: dx.doi.org/
-
Up-to techniques for behavioural metrics via fibrationsIn: 29th International Conference on Concurrency Theory (CONCUR 2018) / CONCUR 2018 : 29th International Conference on Concurrency Theory, Sep 4, 2018 - Sep 7, 2018, Beijing, China 2018Online Volltext: dx.doi.org/
-
Updating probabilistic knowledge on condition/event nets using Bayesian networksIn: 29th International Conference on Concurrency Theory (CONCUR 2018) / CONCUR 2018 : 29th International Conference on Concurrency Theory, Sep 4, 2018 - Sep 7, 2018, Beijing, China 2018Online Volltext: dx.doi.org/
-
Bisimulation Games on CoalgebrasIn: CALCO Early Ideas 2017: a satellite workshop of CALCO 2017 / 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017), 12-16 June 2017 - Ljubljana, Slovenia 2017 8:1 bis 8:3
-
Conditional transition systems with upgradesIn: The 11th International Symposium on Theoretical Aspects of Software Engineering: Proceedings / 11th International Symposium on Theoretical Aspects of Software Engineering (TASE) , 13–15 September 2017, Sophia Antipolis, France / Deantoni, Julien (Hrsg.) 2017Online Volltext: dx.doi.org/ (Open Access)
-
Extracting the Main Path of Historic Events from WikipediaIn: Network Intelligence Meets User Centered Social Media Networks / ENIC '17 (European Network Intelligence Conference) 2017, S. 65 - 81Online Volltext: dx.doi.org/
-
PAWS : A tool for the analysis of weighted systemsIn: Proceedings 15th Workshop on Quantitative Aspects of Programming Languages and Systems / Workshop on Quantitative Aspects of Programming Languages and Systems, Uppsala, Sweden, 23rd April 2017 / Wiklicky, Herbert; de Vink, Erik (Hrsg.) 2017, S. 75 - 91Online Volltext: dx.doi.org/ (Open Access)
-
Specifying Graph Languages with Type GraphsIn: Graph Transformation: Proceedings / 10th International Conference on Graph Transformation, ICGT 201718-19 July 2017, Marburg, Germany 2017, S. 73 - 89Online Volltext: dx.doi.org/
-
Up-To Techniques for Weighted SystemsIn: Tools and Algorithms for the Construction and Analysis of Systems: Proceedings, Part I / 23rd International Conference Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2017, 22-29. April 2017, Uppsala, Sweden / Legay, Axel; Margaria, Tiziana (Hrsg.) 2017, S. 535 - 552Online Volltext: dx.doi.org/
-
Termination of term graph rewritingIn: 15th International Workshop on Termination: Proceedings / WST 2016, September 5–7, 2016, Obergurgl, Austria / Middeldorp, Aart; Thiemann, Rene (Hrsg.) 2016 14:1-14:5
-
Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over SemiringsIn: Graph Transformation: Proceedings / 8th International Conference, ICGT 2015, Held as Part of STAF 2015, L'Aquila, Italy, July 21-23, 2015 2015, S. 52 - 68Online Volltext: dx.doi.org/
-
A general framework for well-structured graph transformation systemsIn: CONCUR 2014 – Concurrency Theory: 25th International Conference, CONCUR 2014, Rome, Italy, September 2-5, 2014. Proceedings / 25th International Conference, CONCUR 2014, 2-5 September 2014, Rome, Italy / Baldan, Paolo (Hrsg.) 2014, S. 457 - 481Online Volltext: dx.doi.org/
-
Behavioral Metrics via Functor LiftingIn: 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014) / 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014), 15-17 Dezember 2014, New Delhi, India / Raman, Venkatesh; Suresh, S. P. (Hrsg.) 2014, S. 403 - 415Online Volltext: dx.doi.org/ Online Volltext (Open Access)
-
Generic partition refinement algorithms for coalgebras and an instantiation to weighted automataIn: Theoretical Computer Science: Proceedings / 8th IFIP TC 1/WG 2.2 international conference, TCS 2014, Rome, Italy, September 1 - 3, 2014 / Diaz, Josep; Lanese, Ivan; Sangiorgi, Davide (Hrsg.) 2014, S. 311 - 325Online Volltext: dx.doi.org/
-
Lifting adjunctions to coalgebras to (re)discover automata constructionsIn: Coalgebraic Methods in Computer Science: 12th IFIP WG 1.3 International Workshop, CMCS 2014, Colocated with ETAPS 2014, Grenoble, France, April 5-6, 2014, Revised Selected Papers / International Workshop on Coalgebraic Methods in Computer Science, CMCS 2014, 5-6 April 2014, Grenoble, France / Bonsangue, Marcello M. (Hrsg.) 2014, S. 168 - 188Online Volltext: dx.doi.org/
-
Termination Analysis for Graph Transformation SystemsIn: Theoretical computer science: 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014 ; Proceedings / International Conference on Theoretical Computer Science ; TCS ; September 1-3, 2014, Rome / Diaz, Josep; Lanese, Ivan; Sangiorgi, Davide (Hrsg.) 2014, S. 179 - 194Online Volltext: dx.doi.org/ Online Volltext (Open Access)
-
Termination of cycle rewritingIn: Rewriting and Typed Lambda Calculi / Joint International Conference, RTA-TLCA 2014, Vienna, Austria, July 14-17, 2014 / Dowek, Gilles (Hrsg.) 2014, S. 476 - 490Online Volltext: dx.doi.org/
-
Concatenation and other Closure Properties of Recognizable Languages in Adhesive CategoriesIn: Proceedings of the 12th International Workshop on Graph Transformation and Visual Modeling Techniques (GTVMT 2013) / 12th International Workshop on Graph Transformation and Visual Modeling Techniques (GTVMT 2013), März 2013, Rom, Italy 2013, S. 1 - 14Online Volltext: dx.doi.org/ (Open Access)
-
A coalgebraic perspective on minimization and determinizationIn: Foundations of software science and computational structures: 15th international conference ; proceedings / Birkedal, Lars (Hrsg.) 2012, S. 58 - 73Online Volltext: dx.doi.org/
-
Coalgebraic Trace Semantics for Probabilistic Transition Systems Based on Measure TheoryIn: CONCUR 2012 – Concurrency Theory: Proceedings / 23rd International Conference, CONCUR 2012, 4-7 September 2012, Newcastle upon Tyne, UK / Koutny, Maciej; Ulidowski, Irek (Hrsg.) 2012, S. 410 - 424Online Volltext: dx.doi.org/
-
Conditions in Reactive Systems and in Graph RewritingIn: Proceedings of the 5th International Workshop on Petri Nets, Graph Transformation and other Concurrency Formalisms (PNGT 2012) / 5th International Workshop on Petri Nets, Graph Transformation and other, PNGT 2012, 29. September 2012, Bremen, Germany 2012Online Volltext: dx.doi.org/ Online Volltext (Open Access)
-
Deriving bisimulation congruences for conditional reactive systemsIn: Foundations of software science and computational structures: 15th international conference ; proceedings / 15th International Conference (FOSSACS), March 24 – April 1, 2012, Tallinn, Estonia / Birkedal, Lars (Hrsg.) 2012, S. 361 - 375Online Volltext: dx.doi.org/
-
Efficient Symbolic Implementation of Graph Automata with Applications to Invariant CheckingIn: Graph Transformations: Proceedings / 6th International Conference, ICGT 2012, Bremen, Germany, September 24-29, 2012 / Ehrig, Hartmut; Engels, Gregor; Kreowski, Hans-Jörg; Rozenberg, Grzegorz (Hrsg.) 2012, S. 264 - 278Online Volltext: dx.doi.org/
-
On the decidability status of reachability and coverability in graph transformation systemsIn: 23rd International Conference on Rewriting Techniques and Applications (RTA'12) / International Conference on Rewriting Techniques and Applications, May 28 - June 2, 2012, Nagoya, Japan / Tiwari, Ashish (Hrsg.) 2012, S. 101 - 116Online Volltext: dx.doi.org/
-
Towards Alternating Automata for Graph LanguagesIn: Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GTVMT 2012) / 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GTVMT 2012), 24-25 März 2012, Brighton, UK 2012Online Volltext: dx.doi.org/ Online Volltext (Open Access)
-
Well-structured graph transformation systems with negative application conditionsIn: Graph Transformations: 6th International Conference, ICGT 2012, Bremen, Germany, September 24-29, 2012. Proceedings / 6th nternational Conference on Graph Transformation, ICGT 2012, 24-29 September 2012, Bremen, Germany / Ehrig, Hartmut; Engels, Gregor; Kreowski, Hans-Jörg; Rozenberg, Grzegorz (Hrsg.) 2012, S. 81 - 95Online Volltext: dx.doi.org/
-
Construction of Pushout Complements in the Category of HypergraphsIn: Graph Computation Models 2010 / GCM 2010 - The Third International Workshop on Graph Computation Models, 02. October 2010, Enschede, The Netherlands / Echahed, Rachid; Habel, Annegret; Mosbah, Mohamed (Hrsg.) 2011Online Volltext: dx.doi.org/ (Open Access)
-
Treewidth, Pathwidth and Cospan DecompositionsIn: Proceedings of the Tenth International Workshop on Graph Transformation and Visual Modeling Techniques: GTVMT 2011 / Tenth International Workshop on Graph Transformation and Visual Modeling Techniques, GTVMT 2011, 2.-3- April 2011, Saarbrücken, Germany / Gadducci, Fabio; Mariani, Leonardo (Hrsg.) 2011Online Volltext: dx.doi.org/ Online Volltext (Open Access)
-
A Logic on Subobjects and RecognizabilityIn: Theoretical Computer Science: 6th IFIP TC 1/WG 2.2 International Conference, TCS 2010 / 6th International Conference on Theoretical Computer Science (TCS), September 20-23, 2010, Brisbane, Australia 2010, S. 197 - 212Online Volltext: dx.doi.org/
-
Efficient Analysis of Permutation Equivalence of Graph Derivations Based on Petri NetsIn: Proceedings of the Ninth International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2010) / e Ninth International Workshop on Graph Transformation and Visual Modeling Technique (GT-VMT), March 20-21 2010, Paphos, Cyprus 2010Online Volltext: dx.doi.org/
-
On the computation of McMillan's Complete Prefix for Contextual Nets and Graph GrammarsIn: Graph Transformations: 5th International Conference , ICGT 2010 / 5th International Conference on Graph Transformation (ICGT), September 27-October 2, 2010,Enschede, The Netherlands 2010, S. 91 - 106Online Volltext: dx.doi.org/
-
Recognizable Graph Languages for Checking InvariantsIn: Proceedings of the Ninth International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2010) / 9. International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT), March 20-21 2010, Paphos (Cypros) 2010, 13 SeitenOnline Volltext: dx.doi.org/ (Open Access)
-
Showing Full Semantics Preservation in Model Transformation : A Comparison of TechniquesIn: Integrated Formal Methods: 8th International Conference on Integrated Formal Methods, IFM 2010, Nancy, France, October 11-14, 2010. Proceedings / 8th International Conference on Integrated Formal Methods, IFM 2010, 11-14 October 2010, Nancy, France 2010, S. 183 - 198Online Volltext: dx.doi.org/
-
Specification and Verification of Model TransformationsIn: International Colloquium on Graph and Model Transformation: On the occasion of the 65th birthday of Hartmut Ehrig (GraMoT 2010) / GraMoT 2010, 11-12 February 2010, Berlin, Germany 2010Online Volltext: dx.doi.org/ (Open Access)
-
Verification of Graph Transformation Systems with Context-Free SpecificationsIn: Graph Transformations: Proceedings of the 5th International Conference on Graph Transformation, ICGT 2010 / 5th International Conference on Graph Transformation, ICGT 2010, 27. September - 2. October 2010, Enschede, The Netherlands / Ehrig, Hartmut; Rensink, Arend; Rozenberg, Grzegorz; Schürr, Andy (Hrsg.) 2010, S. 107 - 122Online Volltext: dx.doi.org/
-
Case Study: Verification of a Leader Election Protocol using AugurIn: Solution for the 5th International Workshop on Graph-Based Tools, GraBaTs 2009 2009
-
Unfolding Grammars in Adhesive CategoriesIn: Algebra and coalgebra in computer science: third international conference, CALCO 2009 / 3rd International Conference on Algebra and Coalgebra in Computer Science (CALCO), September 7-10, 2009, Udine, Italy 2009, S. 350 - 366Online Volltext: dx.doi.org/
-
Applying the Graph Minor Theorem to the Verification of Graph Transformation SystemsIn: Computer aided verification: 20th international conference, CAV 2008 / 20th International Conference on Computer Aided Verification, July 7-14, 2008, Princeton, USA 2008, S. 214 - 226Online Volltext: dx.doi.org/
-
Behavior Preservation in Model Refactoring using DPO Transformations with Borrowed ContextsIn: Graph Transformations: 4th International Conference, ICGT 2008 / 4th International Conference on Graph Transformations, September 7-13, 2008, Leicester, United Kingdom 2008, S. 242 - 256Online Volltext: dx.doi.org/
-
Deriving Bisimulation Congruences in the Presence of Negative Application ConditionsIn: Foundations of software science and computational structures: 11th international conference, FOSSACS 2008 / 11th International Conference on Foundations of Software Science and Computational Structures (FOSSACS), March 29-April 6, 2008, Budapest, Hungary 2008, S. 413 - 427Online Volltext: dx.doi.org/
-
Irreducible Objects and Lattice Homomorphisms in Adhesive CategoriesIn: Proceedings of the Workshop on Applied and Computational Category Theory (ACCAT '08) / Pfalzgraf, Jochen (Hrsg.) 2008
-
McMillan's complete prefix for contextual netsIn: Transactions on Petri Nets and Other Models of Concurrency I / Jensen, Kurt; Aalst, Wil M. P. van der; Billington, Jonathan (Hrsg.) 2008, S. 199 - 220Online Volltext: dx.doi.org/
-
On the recognizability of arrow and graph languagesIn: Graph Transformations: 4th International Conference, ICGT 2008 / 4th International Conference on Graph Transformations (ICGT), September 7-13, 2008, Leicester, United Kingdom 2008, S. 336 - 350Online Volltext: dx.doi.org/
-
Open Petri Nets : Non-deterministic Processes and CompositionalityIn: Graph Transformations: 4th International Conference, ICGT 2008 / 4th International Conference on Graph Transformations (ICGT), September 7-13, 2008, Leicester, United Kingdom 2008, S. 257 - 273Online Volltext: dx.doi.org/
-
Towards the Verification of Attributed Graph Transformation SystemsIn: Graph Transformations: 4th International Conference, ICGT 2008 / 4th International Conference on Graph Transformations (ICGT), September 7-13, 2008, Leicester, United Kingdom 2008, S. 305 - 320Online Volltext: dx.doi.org/
-
Unfolding Graph Transformation Systems : Theory and Applications to VerificationIn: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday / Degano, Pierpaolo; Nicola, Rocco De; Meseguer, José (Hrsg.) 2008, S. 16 - 36Online Volltext: dx.doi.org/
-
Unfolding-based Diagnosis of Systems with an Evolving TopologyIn: CONCUR 2008 - concurrency theory / 19th International Conference on Concurrency Theory (CONCUR), August 19-22, 2008, Toronto, Canada 2008, S. 203 - 217Online Volltext: dx.doi.org/
-
Workshop on Petri Nets and Graph TransformationsIn: Graph transformations: 4th international conference, ICGT 2008, Leicester, United Kingdom, September 7 - 13, 2008 ; proceedings / ICGT: International Conference on Graph Transformations ; 4 (Leicester) : 2008.09.07-13 / Ehrig, Hartmut; Heckel, Reiko; Rozenberg, Grzegorz; Taentzer, Gabriele (Hrsg.) 2008, S. 467 - 469Online Volltext: dx.doi.org/
-
A Temporal Graph Logic for Verification of Graph Transformation SystemsIn: Recent Trends in Algebraic Development Techniques: 18th international workshop, WADT 2006 / International Workshop on Algebraic Development Techniques (WADT), June 1-3, 2006, La Roche en Ardenne, Belgium 2007, S. 1 - 20Online Volltext: dx.doi.org/
-
Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri NetsIn: Algebra and coalgebra in computer science: second international conference, CALCO 2007 / International Conference on Algebra and Coalgebra in Computer Science (CALCO), August 20-24, 2007, Bergen, Norway 2007, S. 126 - 142Online Volltext: dx.doi.org/
-
Bisimulation Verification for the DPO Approach with Borrowed ContextsIn: Proceedings of the Sixth International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2007) / 6. International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT), March 31 - April 1 2007, Braga, Portugal 2007, 14 SeitenOnline Volltext: dx.doi.org/ (Open Access)
-
Deriving Bisimulation Congruences with Borrowed ContextsIn: Algebra and coalgebra in computer science: second international conference, CALCO 2007 / Second International Conference on Algebra and Coalgebra in Computer Science (CALCO), August 20-24, 2007, Bergen, Norway 2007, S. 36 - 39
-
Graph transformation systems, Petri nets and semilinear sets : checking for the absence of forbidden paths in graphsIn: Proceedings of the Workshop on Petri Nets and Graph Transformation (PNGT 2006) / Workshop on Petri Nets and Graph Transformation (PNGT), September 21-22, 2006, Natal, Brasil 2007Online Volltext: dx.doi.org/ (Open Access)
-
Composition and decomposition of DPO transformations with borrowed contextIn: Graph transformation: Proceedings / Third International Conference, ICGT 2006 Natal, Rio Grande do Norte, Brazil, September 17-23, 2006 / Corradini, Andrea; Ehrig, Hartmut; Montanari, Ugo; Ribeiro, Leila; Rozenberg, Grzegorz (Hrsg.) 2006, S. 153 - 167Online Volltext: dx.doi.org/
-
Counterexample-guided Abstraction Refinement for the Analysis of Graph Transformation SystemsIn: Tools and Algorithms for the Construction and Analysis of Systems: 12th International Conference, TACAS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25 - April 2, 2006. Proceedings / 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 5. März -2. April 2006, Wien, Austria 2006, S. 197 - 211Online Volltext: dx.doi.org/
-
Distributed Unfolding of Petri NetsIn: Foundations of software science and computation structures: 9th international conference, FOSSACS 2006 / 9th International Conference on Foundations of Software Science and Computational Structures (FOSSACS), March 25 - 31, 2006, Vienna, Austria 2006, S. 126 - 141Online Volltext: dx.doi.org/
-
Process bisimulation via a graphical encodingIn: Graph transformation: Proceedings / Third International Conference, ICGT 2006 Natal, Rio Grande do Norte, Brazil, September 17-23, 2006 / Corradini, Andrea; Ehrig, Hartmut; Montanari, Ugo; Ribeiro, Leila; Rozenberg, Grzegorz (Hrsg.) 2006, S. 168 - 183Online Volltext: dx.doi.org/
-
Processes for Adhesive Rewriting SystemsIn: Foundations of software science and computation structures: 9th international conference, FOSSACS 2006 / 9th International Conference on Foundations of Software Science and Computational Structures (FOSSACS), March 25 - 31, 2006, Vienna, Austria 2006, S. 202 - 216Online Volltext: dx.doi.org/
-
Saturated Semantics for Reactive SystemsIn: Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) 2006, S. 69 - 80
-
Sesqui-Pushout RewritingIn: Graph Transformations: Proceedings / Third International Conference, ICGT 2006 Natal, Rio Grande do Norte, Brazil, September 17-23, 2006 / Corradini, Andrea; Ehrig, Hartmut; Montanari, Ugo; Ribeiro, Leila; Rozenberg, Grzegorz (Hrsg.) 2006, S. 30 - 45Online Volltext: dx.doi.org/
-
Graph Grammar Verification through AbstractionIn: Abstracts Collection - Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems. - (Dagstuhl Seminar Proceedings ; 04241) 2005
-
On Timed Automata with Discrete Time-Structural and Language Theoretical CharacterizationIn: Developments in language theory: 9th international conference, DLT 2005, Palermo, Italy, July 4-8, 2005 ; proceedings / 9th international conference (DLT), July 4-8, 2005, Palermo, Italy 2005, S. 272 - 283Online Volltext: dx.doi.org/
-
Verifying Red-Black TreesIn: Proceedings of the First international workshop on the verification of COncurrent Systems with dynaMIC Allocated Heaps, COSMICAH 2005. - (Technical report of Queen Mary University of London ; RR-05-04) 2005
-
Deriving Bisimulation Congruences in the DPO Approach to Graph RewritingIn: Foundations of software science and computation structures: 7th international conference, FOSSACS 2004 / 7th International Conference Foundations of Software Science and Computation Structures (FOSSACS), March 29 - April 2, 2004, Barcelona, Spain 2004, S. 151 - 166Online Volltext: dx.doi.org/
-
Generating test cases for code generators by unfolding graph transformation systemsIn: Graph Transformations: Proceedings / Second International Conference, ICGT 2004, Rome, Italy, September 28–October 1, 2004 / Ehrig, Hartmut; Engels, Gregor; Parisi-Presicce, Francesco; Rozenberg, Grzegorz (Hrsg.) 2004, S. 194 - 209Online Volltext: dx.doi.org/
-
On Timed Automata with Discrete Time-Structural and Language Theoretical CharacterizationIn: 14. Theorietag der GI-Fachgruppe 0.1.5 "Automaten und Formale Sprachen" 2004
-
Verifying Finite-State Graph Grammars: an Unfolding-Based ApproachIn: CONCUR 2004 - Concurrency theory: 15th international conference ; proceedings / 15th International Conference on Concurrency Theory (CONCUR), August 31 - September 3, 2004 , London, UK 2004, S. 83 - 98Online Volltext: dx.doi.org/
-
A Logic for Analyzing Abstractions of Graph Transformation SystemsIn: Static analysis: 10th international symposium ; proceedings / 10. International Static Analysis Symposium, 2003.06.11-13, San Diego, USA 2003, S. 255 - 272Online Volltext: dx.doi.org/
-
On Deterministic Finite Automata and Syntactic Monoid SizeIn: Developments in language theory: 6th international conference, Kyoto, Japan, September 18 - 21, 2002 ; revised papers / International Conference on Developments in Language Theory (DLT), 2002.09.18-21, Kyoto, Japan 2003, S. 429 - 444Online Volltext: dx.doi.org/
-
On Deterministic Finite Automata and Syntactic Monoid Size, ContinuedIn: Developments in language theory: 7th international conference / 7th International Conference on Developments in Language Theory, July 7 - 11, 2003, Szeged, Hungary / Ésik,, Zoltán (Hrsg.) 2003, S. 163Online Volltext: dx.doi.org/
-
Unfolding-Based Verification for Graph Transformation SystemsIn: Proceedings of Uniform Approaches to Graphical Specification Techniques, UniGra 2003 2003
-
Approximating the behaviour of graph transformation systemsIn: Graph Transformation: Proceedings / First International Conference, ICGT 2002 Barcelona, Spain, October 7–12, 2002 / Corradini, Andrea; Ehrig, Hartmut; Kreowski, Hans -Jörg; Rozenberg, Grzegorz (Hrsg.) 2002, S. 14 - 29Online Volltext: dx.doi.org/
-
On Deterministic Finite Automata and Syntactic Monoid SizeIn: 12. Theorietag der GI-Fachgruppe 0.1.5 "Automaten und Formale Sprachen" mit dem Workshop Berechenbarkeit und Komplexität in der Analyse / Mazala, R.; Staiger, L.; Winter, R. (Hrsg.) 2002, S. 29 - 31
-
Static Analysis of Distributed Systems with Mobility Specified by Graph Grammars-A Case StudyIn: Integrated design process technology: proceedings of the sixth Biennial World Conference on Integrated Design and Process Technology / 6. Biennial World Conference on Integrated Design and Process Technology (IDPT), 2002.06.23-28, Pasadena, USA / Ehrig, Hartmut; Krämer, B.; Ertas, A. (Hrsg.) 2002
-
A Static Analysis Technique for Graph Transformation SystemsIn: Concurrency Theory: 12th international conference / 12th International Conference on Concurrency Theory, August 20-25, 2001, Aalborg, Denmark 2001, S. 381 - 395Online Volltext: dx.doi.org/
-
Observational Equivalence for Synchronized Graph Rewriting with MobilityIn: Theoretical aspects of computer software: 4th international symposium, TACS 2001 / 4th International Symposium on Theoretical Aspects of Computer Software (TACS), October 29 - 31, 2001, Sendai, Japan 2001, S. 145 - 164
-
A general framework for types in graph rewritingIn: FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science: Proceedings of the 20th Conference / 20th Conference of Foundations of Software Technology and Theoretical Computer Science (FST TCS 2000), 13.-15. December 2000, New Delhi, India 2000, S. 373 - 384Online Volltext: dx.doi.org/
-
A graph rewriting semantics for the polyadic pi-calculusIn: ICALP workshops 2000: proceedings of the satellite workshops of the 27th international colloquium on automata, languages, and programming / GT-VMT 2000, Workshop on Graph Transformation and Visual Modelling Techniques, 14-15 July 2000, Geneva, Switzerland / Rolim, José D.P. (Hrsg.) 2000, S. 451 - 458
-
Analysing Input/Output-Capabilities of Mobile Processes with a Generic Type SystemIn: Automata, Languages and Programming: 27th International Colloquium, ICALP 2000 Geneva, Switzerland, July 9–15, 2000 Proceedings / 27th International Colloquium on Automata, Languages and Programming (ICALP), 9.-15. July 2000, Geneva, Switzerland 2000, S. 403 - 414Online Volltext: dx.doi.org/
-
Hypergraph Construction and its Application to the Compositional Modelling of ConcurrencyIn: Proceedings of Joint APPLIGRAPH/GETGRATS Workshop on Graph Transformation (GRATRA 2000) 2000
-
Generating Type Systems for Process GraphsIn: CONCUR’99 Concurrency Theory: 10th International Conference Eindhoven, The Netherlands, August 24-27, 1999 Proceedings / CONCUR’99, 10th International Conference, 24. - 27. August 1999, Eindhoven, Netherlands 1999, S. 352 - 367Online Volltext: dx.doi.org/ Online Volltext
-
Coalgebraic Methods in Computer Science : Proceedings
17th IFIP WG 1.3 International Workshop, CMCS 2024, Colocated with ETAPS 2024, Luxembourg City, Luxembourg, April 6–7, 2024,In: Lecture Notes in Computer Science (LNCS) Berlin Jg. 14617 (2024)Online Volltext: dx.doi.org/ -
Foundations of Software Science and Computation Structures : 23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020, Proceedings
23rd International Conference, FOSSACS 2020, 25 - 30 April 2020, Dublin, Ireland,In: Lecture Notes in Computer Science Cham Jg. 12077 (2020) 641 SeitenOnline Volltext: dx.doi.org/ (Open Access) -
Algebra and Coalgebra in Computer Science : 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)
7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017), 12-16 June 2017 - Ljubljana, Slovenia,In: LIPIcs Jg. 72 (2017)Online Volltext; Online Volltext (Open Access) -
STAF 2017 Doctoral Symposium : Proceedings of the Doctoral Symposium Held as a Part of STAF 2017 co-located with Software Technologies: Applications and Foundations (STAF 2017)
Doctoral Symposium as a part of STAF 2017, 17. July 2017, Marburg, Germany,In: CEUR Workshop Proceedings Aachen Jg. 1955 (2017)Online Volltext (Open Access) -
Graph transformation : 7th international conference, ICGT 2014, held as part of STAF 2014, York, UK, July 22 - 24, 2014 ; proceedings
7th International Conference, ICGT 2014, Held as Part of STAF 2014, 22-24 Juli 2014, York, UK,In: Lecture notes in computer science Cham Jg. 8571 (2014)Online Volltext: dx.doi.org/ -
TACAS 2012
18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2012, 24. March - 1.April 2012, Tallinn, Estonia,In: International Journal on Software Tools for Technology Transfer Jg. Volume 16, Issue 2 (2014) -
Applying the Graph Minor Theorem to the Verification of Graph Transformation SystemsIn: Technische Berichte der Abteilung für Informatik und Angewandte Kognitionswissenschaft Duisburg Jg. 2012-01 (2012) 21 S.Online Volltext (Open Access)
-
Coalgebraic Trace Semantics for Probabilistic Transition Systems based on Measure TheoryIn: Technische Berichte der Abteilung für Informatik und Angewandte Kognitionswissenschaft Duisburg Jg. 2012-02 (2012)Online Volltext (Open Access)
-
Selected papers of the conference ''Tools and Algorithms for the Construction and Analysis of Systems'' : TACAS 2012
18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2012, 24. March - 1.April 2012, Tallinn, Estonia,In: Logical Methods in Computer Science Jg. Special Issue (2012)Online Volltext: dx.doi.org/ Online Volltext -
Tools and algorithms for the construction and analysis of systems : 18th international conference, TACAS 2012, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012 ; proceedings
18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2012, 24. March - 1.April 2012, Tallinn, Estonia,In: Lecture notes in computer science Berlin Jg. 7214 (2012)Online Volltext: dx.doi.org/ -
Well-Structured Graph Transformation Systems with Negative Application ConditionsIn: Technische Berichte der Abteilung für Informatik und Angewandte Kognitionswissenschaft Duisburg Jg. 2012-03 (2012)
-
CONCUR 2011 - Concurrency Theory : 22nd International Conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011, Proceedings
22nd International Conference on Concurrency Theory, CONCUR 2011, 6-9 September 2011, Aachen, Germany,Heidelberg (2011)Online Volltext: dx.doi.org/ -
Selected Papers of the "22nd International Conference on Concurrency Theory" CONCUR 2011
22nd International Conference on Concurrency Theory, CONCUR 2011, 6-9 September 2011, Aachen, Germany,In: Logical Methods in Computer Science Jg. Special Issue (2011)Online Volltext: dx.doi.org/ Online Volltext -
Full Semantics Preservation in Model Transformation : A Comparison of Proof TechniquesIn: CTIT Technical Report Series Twente Jg. TR-CTIT-10-09 (2010)
-
Deriving Bisimulation Congruences in the Presence of Negative Application ConditionsIn: Technische Berichte der Abteilung für Informatik und Angewandte Kognitionswissenschaft Duisburg Jg. 2008-01 (2008) 31
-
On the recognizability of arrow and graph languagesIn: Technische Berichte der Abteilung für Informatik und Angewandte Kognitionswissenschaft Duisburg Jg. 2008-3 (2008) 27Online Volltext (Open Access)
-
Proceedings of the Third Workshop on Graph Transformation for Concurrency and Verification (GT-VC 2007) : 3 September 2007, Lisbon, Portugal
3rd Workshop on Graph Transformation for Concurrency and Verification (GT-VC 2007), Lisbon, Portugal, 03.09.2007,In: Electronic Notes in Theoretical Computer Science Jg. 213,1 (2008) 95 SeitenOnline Volltext (Open Access) -
Proceedings of the Third Workshop on Petri Nets and Graph Transformations (PNGT 2008)
PNGT 2008 3rd Workshop on Petri Nets and Graph Transformations, Leicester, United Kingdom, 12.-13.09.2008,In: Electronic Communications of the EASST Jg. 14 (2008)Online Volltext: dx.doi.org/ (Open Access) -
Unfolding-based Diagnosis of Systems with an Evolving TopologyIn: Technische Berichte der Abteilung für Informatik und Angewandte Kognitionswissenschaft Duisburg Jg. 2008-02 (2008) 26
-
Proceedings of the Workshop on Graph Transformation for Concurrency and Verification (GT-VC 2006)
Workshop on Graph Transformation for Concurrency and Verification, Bonn, Germany, 31.08.2006,In: Electronic Notes in Theoretical Computer Science Jg. 175,4 (2007)Online Volltext (Open Access) -
Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri NetsIn: Rapporto di Ricerca Jg. CS-2006-9 (2006)
-
Proceedings of the Workshop on Graph Transformation for Verification and Concurrency (GT-VC 2005)
Workshop on Graph Transformation for Verification and Concurrency (GT-VC 2005), San Francisco, USA, 22th August 2005,In: Electronic Notes in Theoretical Computer Science Jg. 154.2 (2006) 120 SeitenOnline Volltext (Open Access) -
A Case Study: Verifying a Mutual Exclusion Protocol with Process Creation using Graph Transformation SystemsIn: Technical Report Stuttgart Jg. TR-2004-08 (2004)
-
Analysis and Verification of Systems with Dynamically Evolving Structures(2004) 238
-
Description and Verification of Mobile Processes with Graph Rewriting TechniquesMünchen (1999) 222
-
Behavior Preservation in Model Refactoring using DPO Transformations with Borrowed ContextsBerlin (2008)