CONCUR 2004 - Concurrency Theory

DOI10.1007/b100113zbMath1099.68055MaRDI 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

68Q60: Specification and verification (program logics, model checking, etc.)

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

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