Search results for "determinisation"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
123	Jan Supol, Borivoj Melichar	A New Approach to Determinisation Using Bit-Parallelism.	ICTAC	2006	DBLP DOI BibTeX RDF
100	Sven Schewe	Tighter Bounds for the Determinisation of Büchi Automata.	FoSSaCS	2009	DBLP DOI BibTeX RDF
89	Thierry Jéron, Hervé Marchand, Vlad Rusu	Symbolic Determinisation of Extended Automata.	IFIP TCS	2006	DBLP DOI BibTeX RDF	symbolic automata, determinisation
76	Rob J. van Glabbeek, Bas Ploeger	Five Determinisation Algorithms.	CIAA	2008	DBLP DOI BibTeX RDF
47	Aidan Harding, Mark Ryan 0001, Pierre-Yves Schobbens	A New Algorithm for Strategy Synthesis in LTL Games.	TACAS	2005	DBLP DOI BibTeX RDF
29	Ismaël Jecker, Filip Mazowiecki, David Purser	Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata.	CoRR	2023	DBLP DOI BibTeX RDF
29	Frederic Dörband, Thomas Feller 0001, Kevin Stier	Approximated Determinisation of Weighted Tree Automata.	LATA	2021	DBLP DOI BibTeX RDF
29	Laure Daviaud	Register complexity and determinisation of max-plus automata.	ACM SIGLOG News	2020	DBLP DOI BibTeX RDF
29	Lukás Holík, Ondrej Lengál, Olli Saarikivi, Lenka Turonová, Margus Veanes, Tomás Vojnar	Succinct Determinisation of Counting Automata via Sphere Construction (Technical Report).	CoRR	2019	DBLP BibTeX RDF
29	Gerco van Heerdt, Tobias Kappé, Jurriaan Rot, Matteo Sammartino, Alexandra Silva 0001	Tree Automata as Algebras: Minimisation and Determinisation.	CoRR	2019	DBLP BibTeX RDF
29	Lukás Holík, Ondrej Lengál, Olli Saarikivi, Lenka Turonová, Margus Veanes, Tomás Vojnar	Succinct Determinisation of Counting Automata via Sphere Construction.	APLAS	2019	DBLP DOI BibTeX RDF
29	Théodore Lopez, Benjamin Monmege, Jean-Marc Talbot	Determinisation of Finitely-Ambiguous Copyless Cost Register Automata.	MFCS	2019	DBLP DOI BibTeX RDF
29	Gerco van Heerdt, Tobias Kappé, Jurriaan Rot, Matteo Sammartino, Alexandra Silva 0001	Tree Automata as Algebras: Minimisation and Determinisation.	CALCO	2019	DBLP DOI BibTeX RDF
29	John P. Gallagher, Mai Ajspur, Bishoksan Kafle	Optimised determinisation and completion of finite tree automata.	J. Log. Algebraic Methods Program.	2018	DBLP DOI BibTeX RDF
29	John P. Gallagher, Mai Ajspur, Bishoksan Kafle	An Optimised Algorithm for Determinisation and Completion of Finite Tree Automata.	CoRR	2015	DBLP BibTeX RDF
29	Radomír Polách, Jan Travnicek, Jan Janousek, Borivoj Melichar	A new algorithm for the determinisation of visibly pushdown automata.	FedCSIS	2015	DBLP DOI BibTeX RDF
29	Denis Kuperberg, Michal Skrzypczak	On Determinisation of Good-for-Games Automata.	ICALP (2)	2015	DBLP DOI BibTeX RDF
29	Ernst Moritz Hahn, Guangyuan Li, Sven Schewe, Andrea Turrini, Lijun Zhang 0001	Lazy Probabilistic Model Checking without Determinisation.	CONCUR	2015	DBLP DOI BibTeX RDF
29	Praveen Thomas Methrayil Varghese	Parity and generalised Büchi automata : determinisation and complementation.		2014	RDF
29	Ernst Moritz Hahn, Guangyuan Li, Sven Schewe, Lijun Zhang 0001	Lazy Determinisation for Quantitative Model Checking.	CoRR	2013	DBLP BibTeX RDF
29	Amélie Stainer	Contribution to the Verification of Timed Automata: Determinization, Quantitative Verification and Reachability in Networks of Automata. (Contribution à la vérification des automates temporisés : déterminisation, vérification quantitative et accessibilité dans les réseaux d'automates).		2013	RDF
29	Gerjan Stokkink, Mark Timmer, Mariëlle Stoelinga	Talking quiescence: a rigorous theory that supports parallel composition, action hiding and determinisation	MBT	2012	DBLP DOI BibTeX RDF
29	Sven Schewe, Thomas Varghese	Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata.	ATVA	2012	DBLP DOI BibTeX RDF
29	Thomas Hanneforth, Bruce W. Watson	An Efficient Parallel Determinisation Algorithm for Finite-state Automata.	Stringology	2012	DBLP BibTeX RDF
29	Wolfram Kahl	Determinisation of relational substitutions in ordered categories with domain.	J. Log. Algebraic Methods Program.	2010	DBLP DOI BibTeX RDF
29	Wolfram Kahl	Determinisation of Relational Substitutions in Ordered Categories with Domain.	RelMiCS	2008	DBLP DOI BibTeX RDF
29	Philippe Noël	A Method for the Determinisation of Propositional Temporal Formulae.	LOPSTR	1991	DBLP DOI BibTeX RDF
23	Christopher H. Broadbent, C.-H. Luke Ong	On Global Model Checking Trees Generated by Higher-Order Recursion Schemes.	FoSSaCS	2009	DBLP DOI BibTeX RDF	Collapsible Pushdown Automaton, Parity Game, Model Checking, Game Semantics, Recursion Scheme
23	Guy Edward Gallasch, Jonathan Billington	Parametric Language Analysis of the Class of Stop-and-Wait Protocols.	Petri Nets	2008	DBLP DOI BibTeX RDF
23	Ahmed Bouajjani, Peter Habermehl, Lukás Holík, Tayssir Touili, Tomás Vojnar	Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata.	CIAA	2008	DBLP DOI BibTeX RDF