UB Paderborn / Katalog / Suche / in CDI

1 – 25 von 39

Sortiert nach

Reachability Problems: 15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings

1st Edition 2021, 2021

Link zum Volltext

Verfügbarkeit prüfen

Simulation Problems Over One-Counter Nets

Logical methods in computer science, 2016-03, Vol.12, Issue 1

2016

Link zum Volltext

Verfügbarkeit prüfen

Trace inclusion for one-counter nets revisited

Theoretical computer science, 2018-07, Vol.735, p.50-63

2018

Link zum Volltext

Verfügbarkeit prüfen

Approximating Weak Bisimilarity of Basic Parallel Processes

Electronic proceedings in theoretical computer science, 2012-08, Vol.89 (Proc. EXPRESS/SOS 2012), p.99-113

2012

Link zum Volltext

Verfügbarkeit prüfen

Handling of Past and Future with Phenesthe

Electronic proceedings in theoretical computer science, 2023, Vol.390, p.33-49

2023

Link zum Volltext

Verfügbarkeit prüfen

The Reachability Problem for Two-Dimensional Vector Addition Systems with States

Journal of the ACM, 2021-10, Vol.68 (5), p.1-43

2021

Link zum Volltext

Verfügbarkeit prüfen

Trace Inclusion for One-Counter Nets Revisited

Reachability Problems, p.151-162

Link zum Volltext

Verfügbarkeit prüfen

Making Sense of Heterogeneous Maritime Data

2022 23rd IEEE International Conference on Mobile Data Management (MDM), 2022, p.401-406

2022

Link zum Volltext
Volltext

Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete

Proceedings of the 31st Annual ACM/IEEE Symposium on logic in computer science, 2016, p.477-484

2016

Link zum Volltext

Verfügbarkeit prüfen

What Makes Petri Nets Harder to Verify: Stack or Data?

Concurrency, Security, and Puzzles, 2016, Vol.10160, p.144-161

2016

Link zum Volltext

Verfügbarkeit prüfen

History-Deterministic Timed Automata Are Not Determinizable

Reachability Problems, p.67-76

Link zum Volltext

Verfügbarkeit prüfen

MDPs with energy-parity objectives

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017, p.1-12

2017

Link zum Volltext

Verfügbarkeit prüfen

Linear combinations of unordered data vectors

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017, p.1-11

2017

Link zum Volltext

Verfügbarkeit prüfen

On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension

Automata, Languages, and Programming, p.324-336

Link zum Volltext

Verfügbarkeit prüfen

Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2016, p.1-8

2016

Link zum Volltext
Volltext

Decidability of Weak Simulation on One-Counter Nets

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013, p.203-212

2013

Link zum Volltext
Volltext

Coverability Trees for Petri Nets with Unordered Data

Foundations of Software Science and Computation Structures, p.445-461

Link zum Volltext

Verfügbarkeit prüfen

Infinite-state energy games

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on computer science logic (csl) and the twenty-ninth annual acm/ieee symposium on logic in computer science (lics), 2014, p.1-10

2014

Link zum Volltext

Verfügbarkeit prüfen

Branching-Time Model Checking Gap-Order Constraint Systems

Reachability Problems, p.171-182

Link zum Volltext

Verfügbarkeit prüfen

On Boundedness Problems for Pushdown Vector Addition Systems

Reachability Problems, 2015, Vol.9328, p.101-113

2015

Link zum Volltext

Verfügbarkeit prüfen