UB Paderborn / Katalog / Suche / in CDI

1 – 25 von 60

Sortiert nach

Probing plasma physics and elemental composition of a leonid meteor by fitting complex plasma radiation model parameters

Monthly notices of the Royal Astronomical Society, 2022-07, Vol.514 (4), p.5266-5275

2022

Volltextzugriff (PDF)

HD 110067 c has an aligned orbit

Astronomy and astrophysics (Berlin), 2024-07, Vol.687

2024

Volltextzugriff (PDF)

On determinism in modal transition systems

Theoretical computer science, 2009-09, Vol.410 (41), p.4026-4043

2009

Volltextzugriff (PDF)

HD 110067 c has an aligned orbit: Measuring the Rossiter–McLaughlin effect inside a resonant multi-planet system with ESPRESSO

Astronomy and astrophysics (Berlin), 2024-07, Vol.687, p.L2

2024

Volltextzugriff (PDF)

Rare Events for Statistical Model Checking an Overview

Reachability Problems, 2016, Vol.9899, p.23-35

2016

Volltextzugriff (PDF)

Timed-Arc Petri Nets vs. Networks of Timed Automata

Applications and Theory of Petri Nets 2005, 2005, p.385-402

2005

Volltextzugriff (PDF)

Distributed Synthesis of State-Dependent Switching Control

Lecture notes in computer science, 2016, Vol.9899, p.119-133

2016

Volltextzugriff (PDF)

On the Complexity of Resource-Bounded Logics

Reachability Problems, 2016, Vol.9899, p.36-50

2016

Volltextzugriff (PDF)

Occam's Razor Applied to the Petri Net Coverability Problem

Reachability Problems, 2016, Vol.9899, p.77-89

2016

Volltextzugriff (PDF)

Decidable Models of Integer-Manipulating Programs with Recursive Parallelism

Reachability Problems, 2016, Vol.9899, p.148-162

2016

Volltextzugriff (PDF)

Safety Property-Driven Stubborn Sets

Reachability Problems, 2016, Vol.9899, p.90-103

2016

Volltextzugriff (PDF)

Compositional Analysis of Boolean Networks Using Local Fixed-Point Iterations

Reachability Problems, 2016, Vol.9899, p.134-147

2016

Volltextzugriff (PDF)

Reachability Predicates for Graph Assertions

Reachability Problems, 2016, Vol.9899, p.63-76

2016

Volltextzugriff (PDF)

Insertion-Deletion Systems over Relational Words

Reachability Problems, 2016, Vol.9899, p.177-191

2016

Volltextzugriff (PDF)

Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets Have Marked Graph Reachability Graphs

Reachability Problems, 2016, Vol.9899, p.51-62

2016

Volltextzugriff (PDF)

Characterizing Word Problems of Groups

Reachability Problems, 2016, Vol.9899, p.104-118

2016

Volltextzugriff (PDF)

Model checking and synthesis for branching multi-weighted logics

Journal of logical and algebraic methods in programming, 2019-06, Vol.105, p.28-46

2019

Volltextzugriff (PDF)

Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard

Automata, Languages and Programming, 2002, p.716-727

2002

Volltextzugriff (PDF)

Complexity of weak bisimilarity and regularity for BPA and BPP

Mathematical structures in computer science, 2003-08, Vol.13 (4), p.567-587, Article S0960129503003992

SRBA, JIŘÍ

2003

Volltextzugriff (PDF)

Undecidability of Weak Bisimilarity for PA-Processes

Developments in Language Theory, p.197-209

Volltextzugriff (PDF)

The Ideal Theory for WSTS

Reachability Problems, 2016, Vol.9899, p.1-22

2016

Volltextzugriff (PDF)

Robot Games with States in Dimension One

Reachability Problems, 2016, Vol.9899, p.163-176

2016

Volltextzugriff (PDF)

Undecidability of domino games and hhp-bisimilarity

Information and computation, 2003-08, Vol.184 (2), p.343-368

2003

Volltextzugriff (PDF)

On Counting the Number of Consistent Genotype Assignments for Pedigrees

FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005, p.470-482

2005

Volltextzugriff (PDF)

Strong bisimilarity of simple process algebras: complexity lower bounds

Acta informatica, 2003-06, Vol.39 (6-7), p.469-499

SRBA, Jiri

2003

Volltextzugriff (PDF)

1 – 25 von 60

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(54)
Mit Volltextzugriff
(59)

Publikationsform

Sprache

Erscheinungsjahr

n.n

Neu hinzugefügt

... seit 30 Tagen
(1)
... seit 90 Tagen
(2)

Menü

Weitere Dienste

Einstellungen

Probing plasma physics and elemental composition of a leonid meteor by fitting complex plasma radiation model parameters

HD 110067 c has an aligned orbit

On determinism in modal transition systems

HD 110067 c has an aligned orbit: Measuring the Rossiter–McLaughlin effect inside a resonant multi-planet system with ESPRESSO

Rare Events for Statistical Model Checking an Overview

Timed-Arc Petri Nets vs. Networks of Timed Automata

Distributed Synthesis of State-Dependent Switching Control

On the Complexity of Resource-Bounded Logics

Occam's Razor Applied to the Petri Net Coverability Problem

Decidable Models of Integer-Manipulating Programs with Recursive Parallelism

Safety Property-Driven Stubborn Sets

Compositional Analysis of Boolean Networks Using Local Fixed-Point Iterations

Reachability Predicates for Graph Assertions

Insertion-Deletion Systems over Relational Words

Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets Have Marked Graph Reachability Graphs

Characterizing Word Problems of Groups

Model checking and synthesis for branching multi-weighted logics

Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard

Complexity of weak bisimilarity and regularity for BPA and BPP

Undecidability of Weak Bisimilarity for PA-Processes

The Ideal Theory for WSTS

Robot Games with States in Dimension One

Undecidability of domino games and hhp-bisimilarity

On Counting the Number of Consistent Genotype Assignments for Pedigrees

Strong bisimilarity of simple process algebras: complexity lower bounds

Suchergebnisse filtern