CONCUR 2004 - Concurrency Theory

DOI10.1007/b100113zbMath1099.68055OpenAlexW2499482941MaRDI QIDQ5311492

Marcus Nilsson, M. Saxena, Parosh Aziz Abdulla, Bengt Jonsson

Publication date: 23 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100113

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Zeno, Hercules, and the Hydra, Computing Parameterized Invariants of Parameterized Petri Nets, Regular model checking with regular relations, Model Checking Parameterized Systems, On notions of regularity for data languages, Model checking, synthesis, and learning, Regular model checking revisited, State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs, Static Analysis of Communicating Processes Using Symbolic Transducers, Monotonic Abstraction for Programs with Dynamic Memory Heaps, Synchronizing relations on words, Unnamed Item, Learning Meets Verification, On pebble automata for data languages with decidable emptiness problem, Calculational design of a regular model checker by abstract interpretation, Reachability analysis of reversal-bounded automata on series-parallel graphs, Symbolic reachability analysis and maximally permissive entrance control for globally synchronized templates, Computable fixpoints in well-structured symbolic model checking, Nash equilibria in symmetric graph games with partial observation, View abstraction for systems with component identities, CSL model checking algorithms for QBDs, On Verifying Fault Tolerance of Distributed Protocols, Closure properties of synchronized relations, Bottom-Up Shape Analysis, The Quantifier Alternation Hierarchy of Synchronous Relations, Learning residual alternating automata, Computing parameterized invariants of parameterized Petri nets, State complexity of permutation and related decision problems on alphabetical pattern constraints