scispace - formally typeset
Search or ask a question
Author

Roni Rosner

Bio: Roni Rosner is an academic researcher from Weizmann Institute of Science. The author has contributed to research in topics: Concurrency & Bounded function. The author has an hindex of 6, co-authored 6 publications receiving 1964 citations.

Papers
More filters
Proceedings ArticleDOI
03 Jan 1989
TL;DR: An algorithm is presented based on a new procedure for checking the emptiness of Rabin automata on infinite trees in time exponential in the number of pairs, but only polynomial in theNumber of states, which leads to a synthesis algorithm whose complexity is doubleonential in the length of the given specification.
Abstract: @(x, y) is valid over all tree models. For the restricted case that all variables range over finite domains, the validity problem is decidable, and we present an algorithm for constructing the program whenever it exists. The algorithm is based on a new procedure for checking the emptiness of Rabin automata on infinite trees in time exponential in the number of pairs, but only polynomial in the number of states. This leads to a synthesis algorithm whose complexity is double exponential in the length of the given specification.

1,612 citations

Book ChapterDOI
11 Jul 1989
TL;DR: The synthesis of a reactive asynchronous module which communicates with its environment via the shared input variable x and the shared output variable y is considered, assuming that the module is specified by the linear temporal formula ϕ(x,y).
Abstract: We consider the synthesis of a reactive asynchronous module which communicates with its environment via the shared input variable x and the shared output variable y, assuming that the module is specified by the linear temporal formula ϕ(x,y). We derive from ϕ(x,y) another linear formula χ(r,w,x,y), with the additional scheduling variables r,w, and show that there exists a program satisfying ϕ iff the branching time formula (∀r,w,x)(∃y)Aχ(r,w,x,y) is valid over all tree models. For the restricted case that all variables range over finite domains, the validity problem is decidable, and we present an algorithm, of doubly exponential time and space complexity, for constructing a program that implements the specification whenever it is implementable. In addition, we provide some matching lower bounds.

318 citations

Proceedings Article
01 Jan 1986

112 citations

Book ChapterDOI
01 Oct 1988
TL;DR: It is shown that there exists a program satisfying ϕ iff the branching time formula (∀x)(∃y)Aϕ(x, y) is valid over all tree models.
Abstract: We consider the synthesis of a reactive module with input x and output y, which is specified by the linear temporal formula ϕ(x, y). We show that there exists a program satisfying ϕ iff the branching time formula (∀x)(∃y)Aϕ(x, y) is valid over all tree models.

30 citations

Proceedings Article
01 Jan 1990
TL;DR: Hirst and Harel as mentioned in this paper considered the question of whether the additional succinctness that bounded concurrency provides influences the complexity of reasoning about regular computation sequences on the propositional level.
Abstract: For pt.II by T. Hirst and D. Harel see Proc. 15th Coll. Trees in Algebra and programming. Lec. Notes in Comp. Sci., Springer (1990). The difficulty of reasoning about programs is addressed. Specifically, the question of whether the additional succinctness that bounded concurrency provides influences the complexity of reasoning about regular computation sequences on the propositional level is considered. The results concern dynamic, temporal, and process logics, and supply a strongly affirmative answer. In particular, triple-exponential time upper and lower bounds on deciding the validity of propositional dynamic logic with alternating automata enriched with bounded cooperative concurrency, and quadruple-exponential time bounds for deciding validity of branching-time and process logics with such automata are proven. In addition to constituting further evidence for the inherent exponential nature of bounded concurrency, the results appear to provide the first examples of natural decision problems that are elementary and yet have lower bounds that are higher than double-exponential time.<>

15 citations


Cited by
More filters
Book
01 Nov 2001
TL;DR: A multi-agent system (MAS) as discussed by the authors is a distributed computing system with autonomous interacting intelligent agents that coordinate their actions so as to achieve its goal(s) jointly or competitively.
Abstract: From the Publisher: An agent is an entity with domain knowledge, goals and actions. Multi-agent systems are a set of agents which interact in a common environment. Multi-agent systems deal with the construction of complex systems involving multiple agents and their coordination. A multi-agent system (MAS) is a distributed computing system with autonomous interacting intelligent agents that coordinate their actions so as to achieve its goal(s) jointly or competitively.

3,003 citations

Book ChapterDOI
02 Jan 1991
TL;DR: In this article, a multiaxis classification of temporal and modal logic is presented, and the formal syntax and semantics for two representative systems of propositional branching-time temporal logics are described.
Abstract: Publisher Summary This chapter discusses temporal and modal logic. The chapter describes a multiaxis classification of systems of temporal logic. The chapter describes the framework of linear temporal logic. In both its propositional and first-order forms, linear temporal logic has been widely employed in the specification and verification of programs. The chapter describes the competing framework of branching temporal logic, which has seen wide use. It also explains how temporal logic structures can be used to model concurrent programs using non-determinism and fairness. The chapter also discusses other modal and temporal logics in computer science. The chapter describes the formal syntax and semantics of Propositional Linear Temporal Logic (PLTL). The chapter also describes the formal syntax and semantics for two representative systems of propositional branching-time temporal logics.

2,871 citations

Book
01 Jan 1999
TL;DR: This second edition has been completely revised, capturing the tremendous developments in multiagent systems since the first edition appeared in 1999.
Abstract: Multiagent systems are made up of multiple interacting intelligent agents -- computational entities to some degree autonomous and able to cooperate, compete, communicate, act flexibly, and exercise control over their behavior within the frame of their objectives They are the enabling technology for a wide range of advanced applications relying on distributed and parallel processing of data, information, and knowledge relevant in domains ranging from industrial manufacturing to e-commerce to health care This book offers a state-of-the-art introduction to multiagent systems, covering the field in both breadth and depth, and treating both theory and practice It is suitable for classroom use or independent study This second edition has been completely revised, capturing the tremendous developments in multiagent systems since the first edition appeared in 1999 Sixteen of the book's seventeen chapters were written for this edition; all chapters are by leaders in the field, with each author contributing to the broad base of knowledge and experience on which the book rests The book covers basic concepts of computational agency from the perspective of both individual agents and agent organizations; communication among agents; coordination among agents; distributed cognition; development and engineering of multiagent systems; and background knowledge in logics and game theory Each chapter includes references, many illustrations and examples, and exercises of varying degrees of difficulty The chapters and the overall book are designed to be self-contained and understandable without additional material Supplemental resources are available on the book's Web site Contributors:Rafael Bordini, Felix Brandt, Amit Chopra, Vincent Conitzer, Virginia Dignum, Jurgen Dix, Ed Durfee, Edith Elkind, Ulle Endriss, Alessandro Farinelli, Shaheen Fatima, Michael Fisher, Nicholas R Jennings, Kevin Leyton-Brown, Evangelos Markakis, Lin Padgham, Julian Padget, Iyad Rahwan, Talal Rahwan, Alex Rogers, Jordi Sabater-Mir, Yoav Shoham, Munindar P Singh, Kagan Tumer, Karl Tuyls, Wiebe van der Hoek, Laurent Vercouter, Meritxell Vinyals, Michael Winikoff, Michael Wooldridge, Shlomo Zilberstein

1,692 citations

Book ChapterDOI
02 Jan 1991
TL;DR: This chapter discusses the formulation of two interesting generalizations of Rabin's Tree Theorem and presents some remarks on the undecidable extensions of the monadic theory of the binary tree.
Abstract: Publisher Summary This chapter focuses on finite automata on infinite sequences and infinite trees. The chapter discusses the complexity of the complementation process and the equivalence test. Deterministic Muller automata and nondeterministic Buchi automata are equivalent in recognition power. Any nonempty Rabin recognizable set contains a regular tree and shows that the emptiness problem for Rabin tree automata is decidable. The chapter discusses the formulation of two interesting generalizations of Rabin's Tree Theorem and presents some remarks on the undecidable extensions of the monadic theory of the binary tree. A short overview of the work that studies the fine structure of the class of Rabin recognizable sets of trees is also presented in the chapter. Depending on the formalism in which tree properties are classified, the results fall in three categories: monadic second-order logic, tree automata, and fixed-point calculi.

1,475 citations