Filters








146,101 Hits in 4.6 sec

Finite labelling problem in event structures

Marc Roland Assous, Vincent Bouchitté, Christine Charretton, Brigitte Rozoy
1994 Theoretical Computer Science  
In Section 4 we give an example of an event structure that admits a finite nice labelling.  ...  An event structure with a finite nice labelling at least n + log n colours for a nice In this section our goal is to highlight infinite event structures admitting a finite nice labelling.  ... 
doi:10.1016/0304-3975(94)90065-5 fatcat:c2qivgyicnfxzbzsx6ztzlcb3q

Language Inclusion for Finite Prime Event Structures [article]

Andreas Fellner, Thorsten Tarrach, Georg Weissenbacher
2019 arXiv   pre-print
We study the problem of language inclusion between finite, labeled prime event structures. Prime event structures are a formalism to compactly represent concurrent behavior of discrete systems.  ...  We study the problem of deciding inclusion and membership for languages encoded by finite prime event structures and provide complexity results for both problems.  ...  Let E = ⟨E, <, #, h⟩ be a finite prime event structure with labels X .  ... 
arXiv:1911.06355v1 fatcat:rjp25hvbpvdm5mfj66nzyodofq

Nice Labeling Problem for Event Structures: A Counterexample

Victor Chepoi
2012 SIAM journal on computing (Print)  
In this paper, we present a counterexample to a conjecture of Rozoy and Thiagarajan from 1991 (also called the nice labeling problem) asserting that any (coherent) event structure with finite degree admits  ...  a labeling with a finite number of labels or, equivalently, that there exists a function f : N → N such that an event structure with degree ≤ n admits a labeling with at most f (n) labels.  ...  I would like to acknowledge Remi Morin for introducing to me the nice labeling conjecture and for useful discussions, Luigi Santocanale for several discussions on this conjecture, Mark Hagen for our exchanges  ... 
doi:10.1137/110837760 fatcat:vnbm7tbeh5bijkv2rwwp44voou

Local Model Checking in a Logic for True Concurrency [chapter]

Paolo Baldan, Tommaso Padoan
2017 Lecture Notes in Computer Science  
Global algorithms are not convenient in this setting, since the event structure associated with a system is typically infinite (even if the system is finite state), a fact that makes also the decidability  ...  The algorithm is given in the form of a tableau system, for which, over a class of event structures satisfying a suitable regularity condition, we prove termination, soundness and completeness.  ...  Decidability itself is an issue, since event structure models are infinite even for finite state systems and problems in this framework have often revealed to sit on the border between decidability and  ... 
doi:10.1007/978-3-662-54458-7_24 fatcat:3wf3mlxqmrewxjp5wk6dpw4mjy

Automata Techniques for Epistemic Protocol Synthesis

Guillaume Aucher, Bastien Maubert, Sophie Pinchinat
2014 Electronic Proceedings in Theoretical Computer Science  
To do so, we first remark that repeatedly executing ad infinitum a propositional event model from an initial epistemic model yields a relational structure that can be finitely represented with automata  ...  In this work we aim at applying automata techniques to problems studied in Dynamic Epistemic Logic, such as epistemic planning.  ...  We establish that structures generated by iterated execution of an event model from an epistemic model are regular structures, i.e. they can be finitely represented with automata, in case the event model  ... 
doi:10.4204/eptcs.146.13 fatcat:rxcurxcdgbeozpskfzjcabcsfu

Automatic Generation of Test Purposes for Testing Distributed Systems [chapter]

Olaf Henniger, Miao Lu, Hasan Ural
2004 Lecture Notes in Computer Science  
The labeled event structure is a non-interleaving behavior model describing the behavior of a system in terms of the partial ordering of events.  ...  In this paper, we present an algorithm for generating test purpose descriptions in form of MSC's from a given labeled event structure that represents the behavior of a system of asynchronously communicating  ...  Acknowledgements This work is supported in part by the Natural Sciences and Engineering Research Council of Canada.  ... 
doi:10.1007/978-3-540-24617-6_13 fatcat:twihyu4xmrfmbn2q6xpwph7cli

Nice labeling problem for event structures: a counterexample [article]

Victor Chepoi
2011 arXiv   pre-print
In this note, we present a counterexample to a conjecture of Rozoy and Thiagarajan from 1991 (called also the nice labeling problem) asserting that any (coherent) event structure with finite degree admits  ...  a labeling with a finite number of labels, or equivalently, that there exists a function f: NN such that an event structure with degree < n admits a labeling with at most f(n) labels.  ...  This work was supported in part by the ANR grant BLAN GGAA.  ... 
arXiv:1107.1207v1 fatcat:ikckspfvwfembdceffudhnkxhm

Toward a language-theoretic foundation for planning and filtering [article]

Fatemeh Zahra Saberifar, Shervin Ghasemlou, Dylan A. Shell, Jason M. O'Kane
2018 arXiv   pre-print
a procrustean graph, and give these graph structures semantics in terms of ideas based in formal language theory.  ...  We introduce a new formal structure that generalizes and consolidates a variety of well-known structures including many forms of plans, planning problems, and filters, into a single data structure called  ...  . • We added in Section 7, at the suggestion of Reviewer 2, a discussion of connections to process algebra, and bisimulation in particular. • We corrected a number of typographical errors.  ... 
arXiv:1807.08856v1 fatcat:n3hverw3ubfnjdo6oe6t7bnzre

Mechanized Theory of Event Structures: A Case of Parallel Register Machine

Vladimir Gladstein, Dmitrii Mikhailovskii, Evgenii Moiseenko, Anton Trunov
2021 Proceedings of the Institute for System Programming of RAS  
In this work-in-progress report, we present a theory of event structures mechanized in the COQ proof assistant and demonstrate how it can be applied to define certified executable semantics of a simple  ...  The true concurrency models, and in particular event structures, have been introduced in the 1980s as an alternative to operational interleaving semantics of concurrency, and nowadays they are regaining  ...  Several modifications of event structures [14] , [15] were later proposed to tackle similar problems.  ... 
doi:10.15514/ispras-2021-33(3)-11 fatcat:l26vlarbcjdura5xtmxwpvkfwe

A Nice Labelling for Tree-Like Event Structures of Degree 3 [article]

Luigi Santocanale
2007 arXiv   pre-print
We address the problem of finding nice labellings for event structures of degree 3.  ...  The main theorem we present in this paper states that event structures of degree 3 whose causality order is a tree have a nice labelling with 3 colors.  ...  Event Structures and the Nice Labelling Problem Event structures are a basic model of concurrency introduced in [1] . The definition we present here is from [2] . Definition 1.  ... 
arXiv:0704.2355v1 fatcat:wla37y3oobehff4uxy3rrfkvzy

A Nice Labelling for Tree-Like Event Structures of Degree 3 (Extended Version) [article]

Luigi Santocanale
2009 arXiv   pre-print
We address the problem of finding nice labellings for event structures of degree 3.  ...  The main theorem we present in this paper states that event structures of degree 3 whose causality order is a tree have a nice labelling with 3 colors.  ...  The nice labelling problem asks to compute χ(E) for a given event structure E. It was shown to be an NP-complete problem in [13] .  ... 
arXiv:0903.3462v1 fatcat:kj3d2ea6qnalbedzei2xgmfsmy

A nice labelling for tree-like event structures of degree 3

Luigi Santocanale
2010 Information and Computation  
We address the problem of finding nice labellings for event structures of degree 3.  ...  The main theorem of the paper states that event structures of degree 3 whose causality order is a tree have a nice labelling with 3 colors.  ...  The author is also grateful to the anonymous referees that, thorough their analytic work, helped him in producing a readable and accessible manuscript of the present work.  ... 
doi:10.1016/j.ic.2009.05.006 fatcat:xmw65g2zn5dm7jcnl7ecu6cqia

A Complete Finite Prefix for Process Algebra [chapter]

Rom Langerak, Ed Brinksma
1999 Lecture Notes in Computer Science  
We present the model of component event structures as a semantics for process algebra, and show how to construct a complete finite prefix for this model.  ...  In this paper we show how to use McMillan's complete finite prefix approach for process algebra.  ...  Let E be a labelled component event structure with a set of cutoff events cut.  ... 
doi:10.1007/3-540-48683-6_18 fatcat:okgl23cfrjemxeregzsj7yqj2e

Page 424 of Mathematical Reviews Vol. , Issue 95a [page]

1995 Mathematical Reviews  
labelling problem in event structures.  ...  The problem is to minimize the number of labels. In this paper we are concerned with event structures admitting a finite nice labelling. We characterize those admitting a 2-labelling.  ... 

Formal language properties of hybrid systems with strong resets

Thomas Brihaye, Véronique Bruyère, Elaine Render
2010 RAIRO - Theoretical Informatics and Applications  
Finally, we prove that the reachability problem is undecidable for synchronized products of hybrid systems.  ...  Then the emptiness problem for hybrid systems over M is decidable. Example 4. 8 . 8 In Figure 14, we consider the hybrid system H with a loop labeled by the silent event .  ...  Let M = M, <, 0, . . . be a structure. Let P = {P i | 1 ≤ i ≤ n} be a finite partition of M + into definable non-empty pieces, and let Σ be a finite alphabet of events.  ... 
doi:10.1051/ita/2010006 fatcat:g4bukfnwlfarzoek6rfnbcl6wy
« Previous Showing results 1 — 15 out of 146,101 results