CONCUR 2005 – Concurrency Theory

From MaRDI portal
Revision as of 18:48, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5897475


DOI10.1007/11539452zbMath1134.68382MaRDI QIDQ5897475

Kim Guldstrand Larsen, Emmanuel Fleury, Franck Cassez, Didier Lime, Alexandre David

Publication date: 1 November 2006

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

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


68Q45: Formal languages and automata

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, Unnamed Item, On-the-Fly Synthesis for Strictly Alternating Games, Specification Theories for Probabilistic and Real-Time Systems, A game approach to the parametric control of real-time systems, Game-based Synthesis of Distributed Controllers for Sampled Switched Systems, Control Strategies for Off-Line Testing of Timed Systems, Elimination of detached regions in dependency graph verification, Control strategies for off-line testing of timed systems, Simulation relations and applications in formal methods, Traffic models of periodic event-triggered quantized control systems, Dynamic controllability via timed game automata, Integrating discrete controller synthesis into a reactive programming language compiler, Robust synthesis for real-time systems, Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems, Antichains and compositional algorithms for LTL synthesis, Robust reachability in timed automata and games: a game-based approach, Automating the addition of fault tolerance with discrete controller synthesis, Symbolic synthesis of masking fault-tolerant distributed programs, Backward symbolic optimal reachability in weighted timed automata, On subgame perfect equilibria in turn-based reachability timed games, Optimal and robust controller synthesis using energy timed automata with uncertainty, Optimal and robust controller synthesis. Using energy timed automata with uncertainty, Logical time control of concurrent DES, Zone-based verification of timed automata: extrapolations, simulations and what next?, Monitoring timed properties (revisited), Verification of multiplayer stochastic games via abstract dependency graphs, PuRSUE -- from specification of robotic environments to synthesis of controllers, Efficient controller synthesis for a fragment of \(\mathrm{MTL}_{0,\infty}\), A symbolic algorithm for lazy synthesis of eager strategies, Synthesising succinct strategies in safety games with an application to real-time scheduling, Maximally permissive controller synthesis for time Petri nets, New Results on Timed Specifications, Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems, Methodologies for Specification of Real-Time Systems Using Timed I/O Automata, Robust Specification of Real Time Components, Model Checking Real-Time Systems, Symbolic Model Checking in Non-Boolean Domains, Timed Control with Observation Based and Stuttering Invariant Strategies, Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets, On Scheduling Policies for Streams of Structured Jobs, Compositional Abstraction in Real-Time Model Checking, Symbolic Branching Bisimulation-Checking of Dense-Time Systems in an Environment, Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation, Realizability of Real-Time Logics


Uses Software