Author image not provided
 Blaise Genest

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article4.79
Citation Count187
Publication count39
Publication years2002-2017
Available for download5
Average downloads per article121.00
Downloads (cumulative)605
Downloads (12 Months)111
Downloads (6 Weeks)17
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


39 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 39
Result page: 1 2

Sort by:

1 published by ACM
September 2017 Journal of the ACM (JACM): Volume 64 Issue 5, October 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 12,   Downloads (12 Months): 58,   Downloads (Overall): 58

Full text available: PDFPDF
We consider two-person zero-sum stochastic games with signals, a standard model of stochastic games with imperfect information. The only source of information for the players consists of the signals they receive; they cannot directly observe the state of the game, nor the actions played by their opponent, nor their own ...
Keywords: stochastic games, Controller synthesis, algorithmic game theory, imperfect information

2 published by ACM
March 2015 Journal of the ACM (JACM): Volume 62 Issue 1, February 2015
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 2,   Downloads (12 Months): 28,   Downloads (Overall): 338

Full text available: PDFPDF
A finite-state Markov chain M can be regarded as a linear transform operating on the set of probability distributions over its node set. The iterative applications of M to an initial probability distribution μ 0 will generate a trajectory of probability distributions. Thus, a set of initial distributions will induce ...
Keywords: LTL logic, discretization, approximate model checking, Markov chains

3
December 2014 Discrete Event Dynamic Systems: Volume 24 Issue 4, December 2014
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 0

For complex services composed of many (component) services, logging is an integral middleware aspect, especially for providing transactions and monitoring. In the event of a failure, the log allows us to deduce the cause of failure (diagnosis) and recover by compensating the executed services (atomicity). However, for heterogeneous services with ...

4
December 2014 Discrete Event Dynamic Systems: Volume 24 Issue 4, December 2014
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 1

Diagnosis of a system consists in providing explanations to a supervisor from a partial observation of the system and a model of possible executions. This paper proposes a partial order diagnosis algorithm that recovers sets of scenarios which correspond to a given observation. Systems are modeled using High-level Message Sequence ...
Keywords: Security, Anomaly detection, Discrete events systems, Scenarios, Diagnosis

5
July 2013 ICALP'13: Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

We consider the distributed control problem in the setting of Zielonka asynchronous automata. Such automata are compositions of finite processes communicating via shared actions and evolving asynchronously. Most importantly, processes participating in a shared action can exchange complete information about their causal past. This gives more power to controllers, and ...

6
September 2012 ICTAC'12: Proceedings of the 9th international conference on Theoretical Aspects of Computing
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

Verifying systems involving both time and concurrency rapidly leads to undecidability, and requires restrictions to become effective. This paper addresses the emptiness problem for time-constrained MSC-Graphs (TC-MSC graphs for short), that is, checking whether there is a timed execution compatible with a TC-MSC graph specification. This problem is known to ...

7
September 2012 IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB): Volume 9 Issue 5, September 2012
Publisher: IEEE Computer Society Press
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1,   Downloads (12 Months): 7,   Downloads (Overall): 76

Full text available: PDFPDF
Dynamic Bayesian Networks (DBNs) can serve as succinct probabilistic dynamic models of biochemical networks [CHECK END OF SENTENCE]. To analyze these models, one must compute the probability distribution over system states at a given time point. Doing this exactly is infeasible for large models; hence one must use approximate algorithms. ...
Keywords: algorithms, biology and genetics.,Probability and statistics,symbolic and algebraic manipulation—, Biological system modeling,Mathematical model,Trajectory,Approximation algorithms,Probability distribution,Approximation methods,Computational modeling,life and medical sciences—

8
August 2012 Information Processing Letters: Volume 112 Issue 14-15, August, 2012
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 1

Systems involving both time and concurrency are notoriously difficult to analyze. Existing decidability results apply when clocks on different processes cannot be compared or when the set of timed executions is regular. We prove new decidability results for timed concurrent systems, requiring neither restriction. We consider the formalism of time-constrained ...
Keywords: Formal languages, Partial order languages, Set of representatives, Specification languages, Formal methods, MSC graphs, Timed automata

9
June 2012 LICS '12: Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 0,   Downloads (12 Months): 5,   Downloads (Overall): 58

Full text available: PDFPDF
A finite state Markov chain M is often viewed as a probabilistic transition system. An alternative view - which we follow here - is to regard M as a linear transform operating on the space of probability distributions over its set of nodes. The novel idea here is to discretize ...
Keywords: Model Checking, Probabilistic Computation, Approximation, Markov Processes

10 published by ACM
September 2011 CMSB '11: Proceedings of the 9th International Conference on Computational Methods in Systems Biology
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 2,   Downloads (12 Months): 13,   Downloads (Overall): 75

Full text available: PDFPDF
Dynamic Bayesian Networks (DBNs) can serve as succinct models of large biochemical networks [19]. To analyze these models, one must compute the probability distribution over system states at a given time point. Doing this exactly is infeasible for large models and hence approximate methods are needed. The Factored Frontier algorithm ...

11
October 2010 Information and Computation: Volume 208 Issue 10, October, 2010
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 0

Good scheduling policies for distributed embedded applications are required for meeting hard real time constraints and for optimizing the use of computational resources. We study the quasi-static scheduling problem in which (uncontrollable) control flow branchings can influence scheduling decisions at run time. Our abstracted distributed task model consists of a ...
Keywords: Channel bound, Quasi-static scheduling, Communicating machines

12
July 2010 ICALP'10: Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 7

Asynchronous automata are parallel compositions of finitestate processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trace language can be represented by a deterministic asynchronous automaton. In this paper we improve the construction, in that the size of the obtained asynchronous automaton is polynomial ...

13
September 2009 Theoretical Computer Science: Volume 410 Issue 41, September, 2009
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 4

Scenario languages based on Message Sequence Charts (MSCs) have been widely studied in the last decade. The high expressive power of MSCs renders many basic problems concerning these languages undecidable. However, several of these problems are decidable for languages that possess a behavioral property called ''existentially bounded''. Unfortunately, collections of ...
Keywords: Partial orders, Scenario languages, Distributed systems, Modeling

14
August 2009 XSym '09: Proceedings of the 6th International XML Database Symposium on Database and XML Technologies
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

With more and more data stored into XML databases, there is a need to provide the same level of failure resilience and robustness that users have come to expect from relational database systems. In this work, we discuss strategies to provide the transactional aspect of atomicity to XML databases. The ...

15
August 2009 LICS '09: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 20

We consider the standard model of finite two-person zero-sum stochastic games with signals. We are interested in the existence of almost-surely winning or positively winning strategies, under reachability, safety, Buchi or co-Buchi winning objectives. We prove two qualitative determinacy results. First, in a reachability game either player $1$ can achieve ...
Keywords: Stochastic games, imperfect information, signals

16
June 2009 Annals of Mathematics and Artificial Intelligence: Volume 56 Issue 2, June 2009
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 0

The problem of state space search is fundamental to many areas of computer science, such as, e.g., AI and formal methods. Often, the state space to be searched is huge, so optimizing the search is an important issue. In this paper, we consider the problem of visiting all states in ...
Keywords: 68N30, Commutativity, Partial order reduction, State space search

17
December 2008 HASE '08: Proceedings of the 2008 11th IEEE High Assurance Systems Engineering Symposium
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 4

For complex services, logging is an integral part of many middleware aspects, especially, transactions and monitoring. In the event of a failure, the log allows us to deduce the cause of failure (diagnosis), recover by compensating the logged actions (atomicity), etc. However, for heterogeneous services, logging all the actions is ...
Keywords: Small Logs, Web Services, minimal marker placement, observability

18
October 2008 ATVA '08: Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 6

Classical verification often uses abstraction when dealing with data. On the other hand, dynamic XML-based applications have become pervasive, for instance with the ever growing importance of web services. We define here <em>Tree Pattern Rewriting Systems</em>(TPRS) as an abstract model of dynamic XML-based documents. TPRS systems generate infinite transition systems, ...

19
August 2008 CONCUR '08: Proceedings of the 19th international conference on Concurrency Theory
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 3

Good scheduling policies for distributed embedded applications are required for meeting hard real time constraints and for optimizing the use of computational resources. We study the <em>quasi-static scheduling</em>problem in which (uncontrollable) control flow branchings can influence scheduling decisions at run time. Our abstracted task model consists of a network of ...

20
March 2008 FOSSACS'08/ETAPS'08: Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

An effective way to assemble partial views of a distributed system is to compute their product. Given twoMessage Sequence Graphs, we address the problem of computing a Message Sequence Graph that generates the product of their languages, when possible. Since all MSCs generated by a Message Sequence Graph G may ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us