Meta tags:
Headings (most frequently used words):
2026, concur, science, 20, friday, august, 21, monday, 03, april, gandalf, interview, with, tot, award, computer, process, algebra, diary, sunday, september, thursday, may, saturday, march, 28, pages, blog, archive, about, me, notes, on, krishnendu, chatterjee, tom, henzinger, and, nir, piterman, recipients, tenure, track, position, in, at, the, gran, sasso, institute, gssi, naoki, kobayashi, recipient, test, of, time, awards, estonian, latvian, theory, days, first, call, for, papers,
Text of the page (most frequently used words):
the (294), and (161), for (85), that (81), you (49), logic (46), type (40), 2026 (33), this (33), time (30), luca (29), was (29), your (29), with (28), strategy (28), may (27), such (27), theory (25), #concur (25), paper (25), games (24), are (23), can (23), calculus (23), april (22), naoki (22), research (22), also (22), september (21), share (21), system (21), would (21), systems (21), work (20), june (19), from (19), award (19), what (19), game (19), august (18), november (18), march (18), automata (18), deadlock (18), did (18), january (17), have (17), july (16), december (16), february (16), more (16), other (16), were (15), not (15), some (15), there (15), which (15), one (15), october (14), between (14), has (13), but (13), freedom (13), atl (13), strategies (13), gandalf (12), very (12), how (12), based (12), knt (12), 2006 (11), will (11), see (11), two (11), kobayashi (11), think (11), been (11), winning (11), our (10), related (10), model (10), checking (10), any (10), developed (10), article (10), natural (10), could (10), questions (10), email (9), verification (9), first (9), main (9), science (9), these (9), good (9), methods (9), ideas (9), they (9), expressive (9), implementation (9), aceto (8), about (8), logics (8), computer (8), community (8), free (8), types (8), result (8), than (8), most (8), them (8), techniques (8), while (8), results (8), dependencies (8), express (8), multi (8), alternating (8), pinterest (7), facebook (7), blogthis (7), comments (7), posted (7), formal (7), talk (7), however (7), nir (7), researchers (7), important (7), topics (7), came (7), find (7), interesting (7), lock (7), reasoning (7), using (7), study (7), had (7), process (7), general (7), linear (7), equilibria (7), synthesis (7), days (6), direction (6), further (6), obligation (6), receive (6), capability (6), open (6), all (6), infinite (6), question (6), non (6), agent (6), their (6), event (5), papers (5), university (5), https (5), colleagues (5), year (5), krishnendu (5), new (5), tot (5), finding (5), young (5), languages (5), possible (5), future (5), agents (5), properties (5), only (5), automated (5), concurrent (5), key (5), like (5), still (5), expressiveness (5), mentioned (5), davide (5), sangiorgi (5), developments (5), three (5), power (5), those (5), fragment (5), inference (5), indeed (5), later (5), analysis (5), different (5), his (5), phd (5), full (5), graphs (5), complexity (5), algorithmic (5), logical (5), framework (5), computational (5), support (5), player (5), 2010 (4), giorgio (4), bacci (4), symposium (4), held (4), life (4), theoretical (4), well (4), both (4), committee (4), made (4), piterman (4), henzinger (4), processes (4), test (4), genai (4), directions (4), programs (4), researcher (4), working (4), rather (4), role (4), setting (4), much (4), right (4), channels (4), notions (4), useful (4), example (4), line (4), language (4), problems (4), levels (4), amongst (4), within (4), answer (4), order (4), tags (4), typed (4), lower (4), already (4), algorithm (4), used (4), extensions (4), 2004 (4), among (4), idea (4), ensure (4), italian (4), aquila (4), italy (4), competitive (4), gssi (4), delivered (4), volume (4), alternation (4), graph (4), reactive (4), concepts (4), several (4), bound (4), tom (4), behavioral (4), version (4), ltl (4), talks (4), complete (3), 2007 (3), information (3), call (3), aalborg (3), international (3), period (3), gave (3), tartu (3), structures (3), estonian (3), latvian (3), edition (3), invited (3), get (3), students (3), choice (3), thomas (3), chatterjee (3), awards (3), opportunity (3), play (3), advice (3), learn (3), carefully (3), same (3), written (3), give (3), who (3), start (3), programming (3), cost (3), lightweight (3), combining (3), coding (3), change (3), annotations (3), then (3), become (3), even (3), now (3), because (3), similar (3), naturally (3), notion (3), operation (3), guarantee (3), request (3), handle (3), influence (3), builds (3), least (3), explored (3), necessary (3), approach (3), since (3), left (3), semantic (3), thereby (3), limitations (3), control (3), chains (3), through (3), others (3), hindsight (3), contributions (3), recursion (3), progress (3), property (3), into (3), viewed (3), concurrency (3), showed (3), say (3), typical (3), fully (3), readers (3), whether (3), worth (3), hard (3), implement (3), combine (3), handled (3), its (3), point (3), form (3), 2005 (3), challenging (3), over (3), previous (3), lnkd (3), applications (3), application (3), central (3), excellent (3), postdoctoral (3), tenure (3), track (3), programme (3), include (3), areas (3), group (3), algorithms (3), software (3), vol (3), context (3), rational (3), many (3), strictly (3), behaviors (3), players (3), part (3), checks (3), always (3), strategic (3), started (3), elementary (3), matching (3), tree (3), tell (3), tool (3), behavior (3), way (3), explicit (3), objects (3), consider (3), pre (3), operators (3), defining (3), algebra (3), view (2), 2008 (2), 2009 (2), 2011 (2), 2014 (2), 2018 (2), 2025 (2), notes (2), home (2), posts (2), submit (2), elli (2), anastasiadi (2), chaired (2), denmark (2), randour (2), mons (2), seventeenth (2), estonia (2), organising (2), robert (2), tarjan (2), data (2), feature (2), countries (2), people (2), welcome (2), audience (2), roles (2), website (2), department (2), friday (2), recipients (2), selected (2), following (2), monday (2), above (2), challenges (2), changes (2), explore (2), classical (2), keen (2), design (2), precision (2), beyond (2), incorporating (2), era (2), focus (2), broadly (2), humans (2), therefore (2), program (2), minimal (2), hamin (2), jacobs (2), monitors (2), esop (2), leino (2), locks (2), protocols (2), obligations (2), capabilities (2), out (2), another (2), conventional (2), applied (2), extended (2), variables (2), found (2), shows (2), send (2), describes (2), need (2), client (2), server (2), eventually (2), after (2), subsequent (2), obtained (2), particular (2), increasing (2), make (2), practical (2), interactive (2), theorem (2), remains (2), problem (2), suggested (2), love (2), solved (2), hybrid (2), mobile (2), syntactic (2), typing (2), rules (2), ones (2), tools (2), provide (2), guide (2), capture (2), causal (2), numbers (2), called (2), termination (2), formulation (2), seminal (2), contribution (2), desirable (2), examples (2), instance (2), induced (2), achieved (2), partial (2), conceptual (2), encoding (2), functional (2), evaluation (2), does (2), stuck (2), encodability (2), possibly (2), level (2), simply (2), things (2), every (2), proposal (2), accompanied (2), improvement (2), practice (2), benefit (2), ought (2), generic (2), elena (2), giachino (2), cosimo (2), laneve (2), networks (2), technically (2), extension (2), extend (2), doing (2), benjamin (2), pierce (2), david (2), turner (2), really (2), lics (2), 1997 (2), goals (2), balance (2), expressed (2), restricted (2), pleasing (2), completely (2), giving (2), surprising (2), addressed (2), briefly (2), explain (2), appeared (2), kindly (2), agreed (2), mine (2), via (2), post (2), answers (2), below (2), hope (2), enjoy (2), reading (2), thanks (2), interview (2), apply (2), recognition (2), offers (2), quality (2), academic (2), environment (2), english (2), recognized (2), teaching (2), whose (2), gran (2), sasso (2), institute (2), position (2), unifying (2), themes (2), connects (2), studied (2), area (2), history (2), exciting (2), makes (2), difficult (2), believe (2), ever (2), field (2), seems (2), signs (2), early (2), mas (2), uptake (2), happy (2), collaboration (2), studying (2), led (2), trees (2), together (2), meeting (2), wish (2), build (2), distinction (2), done (2), mcmas (2), having (2), relevant (2), hence (2), relate (2), defined (2), anyone (2), checker (2), implementations (2), modal (2), single (2), branching (2), objectives (2), treats (2), class (2), decidability (2), fragments (2), treating (2), explicitly (2), adversarial (2), connections (2), aspects (2), imho (2), regular (2), clear (2), social (2), contributed (2), presentations (2), covered (2), ezio (2), recent (2), sarah (2), nicola (2), wheeler (2), small (2), scientific (2), diary (2), awesome, inc, theme, powered, blogger, profile, 109, 2012, 2013, 2015, 2016, 2017, 2019, 2020, 2021, 2022, 2023, 2024, blog, archive, pages, subscribe, atom, older, spread, news, mickaël, université, belgium, organised, gandalfsymposium, github, saturday, recording, kudos, latvia, note, deadlines, registration, proposing, today, www, youtube, com, watch, pfhiuexfhwg, last, public, lecture, entitled, joint, goal, let, scientists, acquainted, each, participate, intended, graduate, listeners, presenters, quoting, reykjavik, hat, tip, colleague, tarmo, uustalu, congratulations, whole, truly, wonderful, consisting, anca, muscholl, chair, javier, esparza, prakash, panangaden, announced, discussed, rapidly, changing, landscape, facing, significant, adapting, native, foundations, constrained, traditional, assumptions, verified, respect, seen, product, former, philosophy, emphasized, automation, move, dependent, aiming, situation, generate, loop, invariants, burden, writing, longer, serious, issue, aim, strong, correctness, guarantees, merely, bugs, traditionally, played, keep, automate, bug, sometimes, completeness, should, jafar, bart, 415, 441, rustan, peter, müller, jan, smans, 407, 426, morten, dahl, yunde, sun, hans, hüttel, authenticity, asymmetric, cryptographic, atva, dual, turned, contexts, adapted, security, condition, particularly, arise, ingredient, perform, succeed, successfully, mutual, exclusion, thread, acquire, acquiring, release, integrating, probably, second, inherently, incomplete, smooth, integration, proving, acm, trans, lang, syst, address, limitation, latter, discharged, resorting, checkers, provers, complementing, combination, common, structural, patterns, cases, fall, outside, reach, purely, forbids, cyclic, forbid, suffers, inherent, yuxin, deng, relations, underlie, systematic, fashion, ensuring, typability, ock, challenge, finite, representation, reason, considering, corresponds, thus, preserved, compilation, parallel, cps, style, primitives, sort, requirement, shown, original, wanted, show, retained, encoded, convincing, sufficiently, overcome, developing, inspirations, cav, although, absolutely, identifying, suggesting, initially, proof, concept, mainly, convince, works, theories, supported, guaranteeing, commendably, atsushi, igarashi, theor, comput, sci, 311, 121, 163, unbounded, pushing, feeling, purpose, easily, involved, perhaps, promising, adapt, real, kinds, beneficial, precise, set, unfortunately, investigated, deal, value, passing, ccs, achieves, trade, off, ease, implementing, associated, try, range, variation, hit, diminishing, returns, where, advance, technical, remember, correctly, during, discussions, wants, channel, exactly, once, before, initial, published, enabling, somewhat, conflicting, core, follows, replaced, enable, combined, recovering, retaining, precisely, significantly, without, elegance, earlier, linearity, popl, 1996, 358, partially, 128, 139, flow, acta, informatica, 291, 347, hich, evolved, culmination, series, development, variations, delighted, recipient, thursday, gbnzua7b, official, gycbshda, applicants, holding, procedure, pending, provided, evidence, filed, here, gnczksdn, must, submitted, pica, platform, located, mountains, welcoming, immediate, access, nature, outdoor, activities, city, positioned, reaching, rome, adriatic, coast, deadline, instruction, eligibility, equivalent, qualification, years, documented, experience, location, contract, six, appointment, details, requirements, successful, candidate, expected, establish, independent, internationally, supervise, collaborate, strengthen, attract, funding, school, advanced, studies, responsibilities, doctoral, courses, seminars, candidates, complements, expands, interdisciplinary, profiles, strongly, encouraged, top, ranked, national, excellence, artificial, intelligence, engineering, addresses, fields, robotics, human, centric, cyber, physical, internet, space, smart, cities, invites, inflow, source, broad, benefited, grounded, axiomatic, characterizations, spaces, influential, evolutionary, mechanism, relationship, lens, determinism, bounds, fundamental, remain, polynomial, parity, iii, degree, sources, randomness, shared, active, computationally, efficient, lie, under, rapid, computing, generated, needs, modern, scale, hitherto, impossible, necessarily, take, lean, proofs, state, involving, predict, place, uniquely, wouldn, saw, coming, adoption, 2000s, regularly, major, definitely, established, upper, gap, closed, proved, settled, concentrated, case, interaction, structure, means, sense, captures, interested, collaborations, stories, ages, grew, concise, pursuing, realized, meant, expert, ingredients, zero, sum, lasting, interplay, exploited, fed, directly, lines, connection, deterministic, emerged, special, classes, elegant, mind, tcs, bridging, divide, covering, subject, matter, impact, construed, reminded, typically, thought, provoking, moshe, vardi, learnt, anything, slides, book, length, treatment, supports, principle, reduce, aware, implemented, answered, incentive, follow, protocol, stability, coalitions, individuals, profitably, deviate, puts, center, continue, exploring, allow, starting, exploration, mix, might, understand, else, present, negative, interest, experimental, far, know, supporting, manipulation, words, spot, owl, basis, creating, solve, required, adopted, equilibrium, eve, michael, wooldridge, oxford, epistemic, included, alessio, lomuscio, imperial, college, london, hinting, incomparable, fixed, achieving, best, worlds, maintaining, worked, intuitively, calculi, local, transition, fixpoint, whereas, global, choices, outcomes, paths, difference, due, archival, introduced, expressing, features, named, quantify, motivation, appealing, admits, come, clean, reasonable, establishing, various, describe, sounds, extremely, followed, path, recall, realisation, until, primarily, cooperative, around, consequence, considered, nash, secure, fact, isolated, suffices, afterwards, arrived, shift, driven, asking, eureka, moment, basing, tension, stronger, formalisms, recognize, tradition, chose, exact, formalism, etl, qltl, ldl, long, readily, translated, nesting, fixpoints, coalition, quantification, define, infinitely, manner, henceforth, abbreviated, computation, reasons, attended, few, conferences, workshops, quite, exception, glad, behalf, steering, thank, putting, lovely, pleasure, visit, stamping, grounds, departments, luck, next, giovanni, scientifc, mickael, high, especially, day, references, lord, rings, featured, appearance, stages, careers, spans, told, rule, guided, explainable, testing, deep, reinforcement, learning, policies, her, approaches, hyperproperties, described, compression, focusing, search, planned, message, speakers, want, presented, dblp, short, summary, thesis, martin, zimmermann, cotumaccio, winter, bartocci, devoted, inception, participants, thoroughly, enjoyed, programmes, friends, relaxed, friendly, listening, discussing, variety, attendees, honest, prefer, taking, gatherings, big, sunday, mostly, solely, fun, stuff, mathematics, large, issues,
Text of the page (random words):
iors of game theory around 2004 2005 we started working on connections between algorithmic game theory and graph games as a consequence we considered aspects of nash equilibria and other not strictly competitive notions of game theory such as secure equilibria in graph games a natural question was to build a logical framework that can express these aspects of game theory which led to strategy logic in fact we first isolated the one alternation fragment which suffices to express these equilibria and only afterwards arrived at the full more expressive logic in hindsight the shift to treating strategies explicitly was driven by the questions we were asking rather than by a single eureka moment luca strategy logic builds on ltl which is a very natural choice imho did you consider defining a version of strategy logic basing it on the linear time modal μ calculus would it be worth doing so and how would such a logic relate to the alternating time μ calculus knt there is always a tension between ltl and stronger formalisms that can recognize all ω regular languages following the tradition of atl and atl we naturally chose to go with ltl for defining the linear time objectives of players as the techniques that we developed were automata based it was clear that extensions of ltl that can express all ω regular languages would be handled by the same techniques the exact choice of the linear time formalism for example etl qltl ldl or the linear time μ calculus is not very important as long as it can be readily translated to automata in the alternating time μ calculus however by carefully nesting fixpoints and coalition quantification we can define infinitely many changes of strategic context but only in a completely adversarial manner luca as you are hinting in your paper amongst other results you showed that the alternating time μ calculus and strategy logic have incomparable expressive power would a fixed point version of strategy logic based on the modal μ calculus be a way of achieving a logic that offers the best of both worlds while maintaining some of the good computational properties of strategy logic has anyone worked on such a logic knt we did not consider such a version of strategy logic intuitively both classical and alternating time μ calculi combine local single transition branching operators such as pre with fixpoint operators whereas strategies express global behavioral choices and the objectives of players are defined on outcomes that are linear paths an important expressive difference between the alternating time μ calculus and strategy logic is therefore due to the distinction between branching and linear time it seems interesting to consider a logic that would combine two types of pre operators those that continue exploring pre defined strategies and their induced behaviors and those that allow to change the strategic context starting a new behavioral exploration but we believe that the techniques that handle alternating time mu calculus would work for such a logic and the mix of behavior and control might be very hard to understand luca did you or anyone else ever implement the model checking algorithms you present in your award winning paper if the answer is negative do you think that there would still be interest in such a model checker and in its experimental evaluation knt as far as we know there is no full implementation of strategy logic in general we have very good implementations supporting the manipulation and analysis of automata on infinite words such as spot and owl they are also used as a basis for creating tools that solve reactive synthesis but we do not have good tool support for using automata on infinite trees which would be required in order to fully support strategy logic the community studying multi agent systems adopted strategy logic and they have some support for the analysis of some questions there are implementations of equilibrium checking and rational synthesis in the tool eve that is developed in the group of michael wooldridge in oxford they support the analysis of concurrent game structures for such questions there is also a restricted version of an epistemic extension of strategy logic that is included in the model checker mcmas for multi agent systems which was developed in the group of alessio lomuscio in imperial college london mcmas also supports atl model checking and in principle it is possible to reduce the one alternation fragment of strategy logic to atl model checking but we are not aware of this having been implemented luca you mentioned the uptake of strategy logic by the multi agent systems community how is strategy logic relevant and did you think that this work would be relevant to multi agent systems knt strategy logic answered a natural need in multi agent systems research for mas questions about the goals of agents and hence strategies are very natural many questions relate to rational behavior whether agents have an incentive to follow a protocol stability of behavior what can coalitions do and whether individuals can profitably deviate the way strategy logic puts strategies in the center as explicit objects makes it very natural to study these questions we wouldn t say that we saw it coming but the signs of early adoption of strategic reasoning by the mas community were already there the uptake of atl and atl started in the early 2000s and by 2004 2005 people were using it regularly we are also very happy that some of the major developments of strategy logic came from this community luca are there any problems that you left open in your award winning article that you d still love to see solved did you or any colleagues study the problem of strategy synthesis knt definitely for the complete logic our paper established only a non elementary upper bound and left the matching lower bound open this gap was later closed by colleagues who proved a matching non elementary lower bound and thereby settled the computational complexity of the full logic we also concentrated on the case of two player games rather than multi player games the interaction between the logic and the game structure means that the two player framework in a sense already captures the complexity of the logic indeed the same techniques based on tree automata were later used by others to extend the logic to the multi player setting and concurrent game structures luca i am interested in how research collaborations start as i like to tell research life stories to phd students and young researchers of all ages could you tell us how you started your collaboration on the award winning paper knt the collaboration grew naturally out of a question from tom thomas henzinger could notions such as the equilibria we had been studying be expressed in atl or atl and if not what would be a natural and concise logic that could express them pursuing this led us to the one alternation fragment we then realized that strategies can be viewed as trees which meant tree automata were the right tool and nir nir piterman was our automata expert so the paper really came together at the meeting point of three ingredients the study of non zero sum games the wish for a logical framework to express their concepts and tree automata techniques luca how did the results and the techniques you developed in your award winning paper influence your subsequent research is there any result obtained by other researchers that builds on your work and that you like in particular knt the result had a lasting influence the interplay between games and automata that we exploited in the paper fed directly into later lines of work e g from the connection of games and automata the notion of good for games a k a history deterministic automata emerged among the results by others that build on strategy logic the matching non elementary lower bound and the work on special classes of strategies such as the distinction between behavioral and non behavioral strategies are very elegant luca to my mind games on graphs ought to be viewed as one of the unifying themes within tcs bridging the volume a volume b divide and i am happy to see that there is a book length treatment covering the subject now what is your view on this matter what impact do you think that your work has had if any on the community working on algorithmic game theory broadly construed i am reminded of the slides for a typically thought provoking talk delivered by moshe vardi what has our community learnt from the work done in the field of computational game theory and what if anything did they learn from the work done within the concurrency theory community knt indeed games on graphs is one of the unifying themes between volume a and volume b it connects with logic and automata theory from vol b and it connects with the notion of alternation from complexity theory and graph algorithms from vol a the inflow of ideas from algorithmic game theory or game theory in general is a key source of ideas in this work e g to express equilibria in a logical framework other notions of equilibria have also been studied in the context of reactive synthesis e g rational synthesis and vol b researchers have explored many concepts from general game theory beyond strictly competitive games the broad area of algorithmic game theory also benefited from logical reasoning grounded in concurrency theory e g strategy logic is the key logic for reasoning about behaviors in multi agent systems and axiomatic characterizations for reasoning about strategy spaces have been influential in evolutionary game theory there is also work using strategy logic in mechanism design luca what are the research topics related to logics for games on graphs that you find most interesting right now knt we can think of several interesting open questions i the relationship between games and automata through the lens of history determinism and similar concepts is an exciting direction ii algorithmic bounds for several fundamental problems remain open e g a polynomial time algorithm for parity games iii the degree to which sources of randomness can be shared between different players is an active area of research in concurrent games and iv the study of computationally efficient logics which lie between atl and strategy logic is also under explored luca what advice would you give to a young researcher who is keen to start working on topics related to logics for games and other computational problems related to games knt the rapid progress in ai makes this question a difficult one we believe that formal methods in general will become a central part of computing more than they have ever been because ai generated software needs checks even more than software written by humans but even more so because modern ai can for the first time provide or at least support such checks on a scale that was hitherto impossible formal checks do not necessarily have to take the form of say lean proofs but they could also include state based reasoning involving automata and games it is always difficult to predict the future but finding the right place for our field in this future seems a uniquely exciting opportunity posted by luca aceto at 2 56 pm no comments email this blogthis share to x share to facebook share to pinterest monday august 03 2026 tenure track position in computer science at the gran sasso science institute gssi the gran sasso science institute gssi in l aquila italy invites applications for a full time tenure track researcher position in computer science the gssi computer science group is among the top ranked in italy and has been recognized as a national department of excellence its main areas of research include algorithms artificial intelligence formal methods and software engineering research also addresses applications in fields such as robotics human centric systems cyber physical systems the internet of things space and smart cities we welcome candidates whose research complements or expands these areas excellent theoretical applied and interdisciplinary profiles are strongly encouraged to apply the successful candidate will be expected to establish an independent and internationally recognized research programme supervise phd students collaborate with postdoctoral researchers strengthen international research networks and attract competitive research funding the gssi is a school of advanced studies teaching responsibilities will include doctoral and postdoctoral courses and seminars delivered in english key details requirements contract six year full time tenure track appointment location l aquila italy eligibility phd or equivalent qualification and at least two years of documented postdoctoral research experience language of instruction english application deadline 17 august 2026 23 59 italian time about l aquila located in the mountains of central italy l aquila offers an excellent quality of life a welcoming international academic environment and immediate access to nature and outdoor activities the city is also well positioned for reaching rome and the adriatic coast application process applications must be submitted through the pica platform https lnkd in gnczksdn applicants holding a non italian phd may apply while the italian recognition procedure is pending provided that they submit evidence that a recognition request has been filed see more here https lnkd in gycbshda official call in italian https lnkd in gbnzua7b posted by luca aceto at 10 12 pm no comments email this blogthis share to x share to facebook share to pinterest thursday may 21 2026 interview with naoki kobayashi concur 2026 tot award recipient as mentioned in a previous post naoki kobayashi will receive one of the two concur 2026 test of time awards at concur 2026 naoki has kindly agreed to answer some questions of mine on his award winning paper via email i am delighted to post his answers below and hope you ll enjoy reading them as much as i did thanks naoki luca you receive the concur tot award 2026 for your paper a new type system for deadlock free processes which appeared at concur 2006 that article is the culmination of a series of contributions you gave on the development of type systems for variations on the pi calculus that guarantee deadlock freedom could you briefly explain to our readers how you came to study the question addressed in your award winning article and how the main ideas in your concur 2006 paper evolved over time w hich of the ideas and results in your paper did you find most pleasing surprising or challenging naoki if i remember correctly the idea of using types to ensure deadlock freedom came up during discussions on the linear pi calculus with benjamin pierce and david turner 1 indeed if one wants to ensure that a channel is really used exactly once one also has to ensure that the process does not get stuck before using it an initial result on type systems for deadlock freedom was published in lics 1997 2 after that the type s...
|
