The following pages link to Paul Gastin (Q472793):
Displaying 50 items.
- Temporal logics for concurrent recursive programs: satisfiability and model checking (Q472794) (← links)
- The poset of infinitary traces (Q689293) (← links)
- Fast zone-based algorithms for reachability in pushdown timed automata (Q832208) (← links)
- Distributed synthesis for well-connected architectures (Q842581) (← links)
- Pure future local temporal logics are expressively complete for Mazurkiewicz traces (Q859824) (← links)
- Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems) (Q914365) (← links)
- On aperiodic and star-free formal power series in partially commuting variables (Q927397) (← links)
- Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces (Q988553) (← links)
- Decidability of the star problem in \(A^*\times{}\{ b\}^*\) (Q1201865) (← links)
- Approximating traces (Q1270563) (← links)
- An extension of Kleene's and Ochmański's theorems to infinite traces (Q1318685) (← links)
- Rational and recognizable complex trace languages (Q1346721) (← links)
- (Q1583241) (redirect page) (← links)
- Asynchronous cellular automata for pomsets (Q1583242) (← links)
- A truly concurrent semantics for a process algebra using resource pomsets (Q1603698) (← links)
- Resource traces: A domain for processes sharing exclusive resources. (Q1605180) (← links)
- LTL is expressively complete for Mazurkiewicz traces (Q1608324) (← links)
- An automata-theoretic approach to the verification of distributed algorithms (Q1706162) (← links)
- Local temporal logic is expressively complete for cograph dependence alphabets (Q1763374) (← links)
- A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties (Q1797777) (← links)
- The Kleene-Schützenberger theorem for formal power series in partially commuting variables. (Q1854303) (← links)
- Decidability of well-connectedness for distributed synthesis (Q1941703) (← links)
- Regular transducer expressions for regular transformations (Q2064527) (← links)
- Zone-based verification of timed automata: extrapolations, simulations and what next? (Q2112098) (← links)
- Modular descriptions of regular functions (Q2175401) (← links)
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic (Q2208242) (← links)
- Event clock message passing automata: a logical characterization and an emptiness checking algorithm (Q2248059) (← links)
- Checking conformance for time-constrained scenario-based specifications (Q2355682) (← links)
- Weighted automata and weighted logics (Q2373736) (← links)
- Timed substitutions for regular signal-event languages (Q2385194) (← links)
- Adding pebbles to weighted automata: easy specification \& efficient evaluation (Q2447753) (← links)
- From local to global temporal logics over Mazurkiewicz traces. (Q2490814) (← links)
- (Q2754145) (← links)
- (Q2763968) (← links)
- Verification of Parameterized Communicating Automata via Split-Width (Q2811340) (← links)
- Model Checking Languages of Data Words (Q2892785) (← links)
- (Q2908850) (← links)
- MSO Decidability of Multi-Pushdown Systems via Split-Width (Q2912701) (← links)
- Adding Pebbles to Weighted Automata (Q2914692) (← links)
- Fair Synthesis for Asynchronous Distributed Systems (Q2946693) (← links)
- (Q2978552) (← links)
- Local Temporal Logic Is Expressively Complete for Cograph Dependence Alphabets (Q2996153) (← links)
- (Q3086925) (← links)
- Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking (Q3088034) (← links)
- Controllers for the Verification of Communicating Multi-pushdown Systems (Q3190125) (← links)
- (Q3299221) (← links)
- Communicating Finite-State Machines and Two-Variable Logic (Q3304111) (← links)
- Parameterized Verification of Communicating Automata under Context Bounds (Q3447694) (← links)
- Verifying Communicating Multi-pushdown Systems via Split-Width (Q3457774) (← links)
- (Q3504344) (← links)
