Nominal Büchi Automata with Name Allocation (English)
Free access
- New search for: Urbat, Henning
- Further information on Urbat, Henning:
- https://orcid.org/0000-0002-3265-7168
- New search for: Hausmann, Daniel
- Further information on Hausmann, Daniel:
- https://orcid.org/0000-0002-0935-8602
- New search for: Milius, Stefan
- Further information on Milius, Stefan:
- https://orcid.org/0000-0002-2021-1644
- New search for: Schröder, Lutz
- Further information on Schröder, Lutz:
- https://orcid.org/0000-0002-3146-5906
- New search for: Urbat, Henning
- Further information on Urbat, Henning:
- https://orcid.org/0000-0002-3265-7168
- New search for: Hausmann, Daniel
- Further information on Hausmann, Daniel:
- https://orcid.org/0000-0002-0935-8602
- New search for: Milius, Stefan
- Further information on Milius, Stefan:
- https://orcid.org/0000-0002-2021-1644
- New search for: Schröder, Lutz
- Further information on Schröder, Lutz:
- https://orcid.org/0000-0002-3146-5906
- New search for: Haddad, Serge
- Further information on Haddad, Serge:
- https://orcid.org/0000-0002-1759-1201
- New search for: Varacca, Daniele
In:
LIPIcs, Volume 203, CONCUR 2021
: 32nd International Conference on Concurrency Theory (CONCUR 2021)
;
203
;
4:1-4:16
;
2021
-
ISBN:
-
ISSN:
- Conference paper / Electronic Resource
-
Title:Nominal Büchi Automata with Name Allocation
-
Contributors:Urbat, Henning ( author ) / Hausmann, Daniel ( author ) / Milius, Stefan ( author ) / Schröder, Lutz ( author ) / Haddad, Serge ( editor ) / Varacca, Daniele ( editor )
-
Published in:LIPIcs, Volume 203, CONCUR 2021 : 32nd International Conference on Concurrency Theory (CONCUR 2021) ; 203 ; 4:1-4:16Leibniz International Proceedings in Informatics (LIPIcs) ; 203 ; 4:1-4:16
-
Publisher:
- New search for: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Publication date:2021-08-13
-
Size:16 pages , 792669 byte
-
Remarks:LIPIcs, Vol. 203, 32nd International Conference on Concurrency Theory (CONCUR 2021), pages 4:1-4:16
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Conference paper
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Licence:
-
Source:
Table of contents conference proceedings
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
CONCUR Test-Of-Time Award 2021 (Invited Paper)Bertrand, Nathalie / de Alfaro, Luca / van Glabbeek, Rob / Palamidessi, Catuscia / Yoshida, Nobuko et al. | 2021
- 2
-
Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata ComplementationHavlena, Vojtěch / Lengál, Ondřej et al. | 2021
- 3
-
Inclusion Testing of Büchi Automata Based on Well-QuasiordersDoveri, Kyveli / Ganty, Pierre / Parolini, Francesco / Ranzato, Francesco et al. | 2021
- 4
-
Nominal Büchi Automata with Name AllocationUrbat, Henning / Hausmann, Daniel / Milius, Stefan / Schröder, Lutz et al. | 2021
- 5
-
Enforcing ω-Regular Properties in Markov Chains by RestartingEsparza, Javier / Kiefer, Stefan / Křetínský, Jan / Weininger, Maximilian et al. | 2021
- 6
-
Linear-Time Model Checking Branching ProcessesKiefer, Stefan / Semukhin, Pavel / Widdershoven, Cas et al. | 2021
- 7
-
Quantified Linear Temporal Logic over Probabilistic Systems with an Application to Vacuity CheckingPiribauer, Jakob / Baier, Christel / Bertrand, Nathalie / Sankur, Ocan et al. | 2021
- 8
-
Subgame-Perfect Equilibria in Mean-Payoff GamesBrice, Léonard / Raskin, Jean-François / van den Bogaard, Marie et al. | 2021
- 9
-
Fragility and Robustness in Mean-Payoff Adversarial Stackelberg GamesBalachander, Mrudula / Guha, Shibashis / Raskin, Jean-François et al. | 2021
- 10
-
Continuous Positional PayoffsKozachinskiy, Alexander et al. | 2021
- 11
-
Transience in Countable MDPsKiefer, Stefan / Mayr, Richard / Shirmohammadi, Mahsa / Totzke, Patrick et al. | 2021
- 12
-
Strategy Complexity of Mean Payoff, Total Payoff and Point Payoff Objectives in Countable MDPsMayr, Richard / Munday, Eric et al. | 2021
- 13
-
Model Checking Quantum Continuous-Time Markov ChainsXu, Ming / Mei, Jingyi / Guan, Ji / Yu, Nengkun et al. | 2021
- 14
-
A Unifying Framework for Deciding SynchronizabilityBollig, Benedikt / Di Giusto, Cinzia / Finkel, Alain / Laversa, Laetitia / Lozes, Etienne / Suresh, Amrita et al. | 2021
- 15
-
Guard Automata for the Verification of Safety and Liveness of Distributed AlgorithmsBertrand, Nathalie / Thomas, Bastien / Widder, Josef et al. | 2021
- 16
-
Dynamic Data-Race Detection Through the Fine-Grained LensKulkarni, Rucha / Mathur, Umang / Pavlogiannis, Andreas et al. | 2021
- 17
-
Adaptive Synchronisation of Pushdown AutomataBalasubramanian, A. R. / Thejaswini, K. S. et al. | 2021
- 18
-
Decomposing Permutation AutomataJecker, Ismaël / Mazzocchi, Nicolas / Wolf, Petra et al. | 2021
- 19
-
Algebra and Coalgebra of Stream ProductsBoreale, Michele / Gorla, Daniele et al. | 2021
- 20
-
Formally Verified Simulations of State-Rich Processes Using Interaction Trees in Isabelle/HOLFoster, Simon / Hur, Chung-Kil / Woodcock, Jim et al. | 2021
- 21
-
Fibrational Initial Algebra-Final Coalgebra Coincidence over Initial Algebras: Turning Verification Witnesses Upside DownKori, Mayuko / Hasuo, Ichiro / Katsumata, Shin-ya et al. | 2021
- 22
-
SMT-Based Model Checking of Max-Plus Linear SystemsMufid, Muhammad Syifa'ul / Micheli, Andrea / Abate, Alessandro / Cimatti, Alessandro et al. | 2021
- 23
-
A Decidable Non-Regular Modal Fixpoint LogicBruse, Florian / Lange, Martin et al. | 2021
- 24
-
A Temporal Logic for Strategic HyperpropertiesBeutner, Raven / Finkbeiner, Bernd et al. | 2021
- 25
-
Time Flies When Looking out of the Window: Timed Games with Window Parity ObjectivesMain, James C. A. / Randour, Mickael / Sproston, Jeremy et al. | 2021
- 26
-
Arena-Independent Finite-Memory Determinacy in Stochastic GamesBouyer, Patricia / Oualhadj, Youssouf / Randour, Mickael / Vandenhove, Pierre et al. | 2021
- 27
-
Stackelberg-Pareto SynthesisBruyère, Véronique / Raskin, Jean-François / Tamines, Clément et al. | 2021
- 28
-
The Orbit Problem for Parametric Linear Dynamical SystemsBaier, Christel / Funke, Florian / Jantsch, Simon / Karimov, Toghrul / Lefaucheux, Engel / Luca, Florian / Ouaknine, Joël / Purser, David / Whiteland, Markus A. / Worrell, James et al. | 2021
- 29
-
Scope-Bounded Reachability in Valence SystemsShetty, Aneesh K. / Krishna, S. / Zetzsche, Georg et al. | 2021
- 30
-
Deciding Polynomial Termination Complexity for VASS ProgramsAjdarów, Michal / Kučera, Antonín et al. | 2021
- 31
-
Bisimulation by Partitioning Is Ω((m+n)log n)Groote, Jan Friso / Martens, Jan / de Vink, Erik et al. | 2021
- 32
-
Explaining Behavioural Inequivalence Generically in Quasilinear TimeWißmann, Thorsten / Milius, Stefan / Schröder, Lutz et al. | 2021
- 33
-
Enabling Preserving Bisimulation Equivalencevan Glabbeek, Rob / Höfner, Peter / Wang, Weiyou et al. | 2021
- 34
-
Sized Types with Usages for Parallel Complexity of Pi-Calculus ProcessesBaillot, Patrick / Ghyselen, Alexis / Kobayashi, Naoki et al. | 2021
- 35
-
Generalising Projection in Asynchronous Multiparty Session TypesMajumdar, Rupak / Mukund, Madhavan / Stutz, Felix / Zufferey, Damien et al. | 2021
- 36
-
Separating Sessions SmoothlyFowler, Simon / Kokke, Wen / Dardha, Ornela / Lindley, Sam / Morris, J. Garrett et al. | 2021