Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
scientific article; zbMATH DE number 1232241 - MaRDI portal

scientific article; zbMATH DE number 1232241

From MaRDI portal
Publication:4223067

zbMath0907.68126MaRDI QIDQ4223067

Bernard Willems, Pierre Wolper, Alain Finkel

Publication date: 3 January 1999


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Eliminating the storage tape in reachability constructions., Reachability problems on reliable and lossy queue automata, Model-checking structured context-free languages, Model checking LTL with regular valuations for pushdown systems, Complexity results on branching-time pushdown model checking, SAT-Based Model Checking, Model Checking Procedural Programs, Faster pushdown reachability analysis with applications in network verification, Winning Regions of Pushdown Parity Games: A Saturation Method, Pushdown reachability with constant treewidth, Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata, Verification in loosely synchronous queue-connected discrete timed automata., Pushdown timed automata: A binary reachability characterization and safety verification., Unnamed Item, Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects, Verifying parallel programs with dynamic communication structures, Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations, An efficient automata approach to some problems on context-free grammars., Normalization of Linear Horn Clauses, A saturation method for the modal \(\mu \)-calculus over pushdown systems, Detecting Useless Transitions in Pushdown Automata, An Automata-based Approach for CTL⋆ With Constraints, The regular viewpoint on PA-processes, Interprocedural Analysis of Concurrent Programs Under a Context Bound, Program Analysis Using Weighted Pushdown Systems, Efficient CTL Model-Checking for Pushdown Systems, Verifying Parallel Programs with Dynamic Communication Structures, Domains for Higher-Order Games, Iterating transducers, CTL* model checking for data-aware dynamic systems with arithmetic