Journal Article10.1023/A:1008739929481
Reactive Modules
Rajeev Alur,Thomas A. Henzinger +1 more
- 01 Jul 1999
Vol. 15, Iss: 1, pp 7-48
681
TL;DR: The model represents synchronous and asynchronous components in a uniform framework that supports compositional (assume-guarantee) and hierarchical design and verification and uses a hiding operator that may turn a synchronous system into an asynchronous one.
read more
Abstract: We present a formal model for concurrent systems. The model represents synchronous and asynchronous components in a uniform framework that supports compositional (assume-guarantee) and hierarchical (stepwise-refinement) design and verification. While synchronous models are based on a notion of atomic computation step, and asynchronous models remove that notion by introducing stuttering, our model is based on a flexible notion of what constitutes a computation step: by applying an abstraction operator to a system, arbitrarily many consecutive steps can be collapsed into a single step. The abstraction operator, which may turn an asynchronous system into a synchronous one, allows us to describe systems at various levels of temporal detail. For describing systems at various levels of spatial detail, we use a hiding operator that may turn a synchronous system into an asynchronous one. We illustrate the model with diverse examples from synchronous circuits, asynchronous shared-memory programs, and synchronous message-passing protocols.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Multiagent Systems : A Modern Approach to Distributed Artificial Intelligence
Gerhard Weiss
- 31 Jul 2000
TL;DR: This is the first comprehensive introduction to multiagent systems and contemporary distributed artificial intelligence and will be a useful reference not only for computer scientists and engineers, but for social scientists and management and organization scientists as well.
4.5K
Alternating-time temporal logic
TL;DR: This work introduces a third, more general variety of temporal logic: alternating-time temporal logic, which offers selective quantification over those paths that are possible outcomes of games, such as the game in which the system and the environment alternate moves.
•Book
Handbook of Knowledge Representation
Frank van Harmelen,Vladimir Lifschitz,Bruce Porter +2 more
- 08 Jan 2008
TL;DR: The Handbook of Knowledge Representation is an up-to-date review of twenty-five key topics in knowledge representation written by the leaders of each field, an essential resource for students, researchers and practitioners in all areas of Artificial Intelligence.
1K
PRISM: Probabilistic Symbolic Model Checker
TL;DR: PRISM has been successfully used to analyse probabilistic termination, performance, and quality of service properties for a range of systems, including randomized distributed algorithms, manufacturing systems and workstation clusters.
Stochastic model checking
Marta Kwiatkowska,Gethin Norman,David Parker +2 more
- 28 May 2007
TL;DR: This tutorial presents an overview of model checking for both discrete and continuous-time Markov chains (DTMCs and CTMCs) by outlining the main features supported by PRISM and three real-world case studies: a probabilistic security protocol, dynamic power management and a biological pathway.
References
Communicating sequential processes
TL;DR: It is suggested that input and output are basic primitives of programming and that parallel composition of communicating sequential processes is a fundamental program structuring method.
•Book
Communication and Concurrency
Robin Milner
- 01 Jan 1989
TL;DR: This chapter discusses Bisimulation and Observation Equivalence as a Modelling Communication, a Programming Language, and its application to Equational laws.
9K
•Book
Symbolic Model Checking
Edmund M. Clarke,Kenneth L. McMillan,Sérgio Campos,Vassili Hartonas-Garmhausen +3 more
- 31 Jul 1993
TL;DR: Using symbolic model checking techniques it is possible to verify industrial-size finite state systems and models with more than 10120 states have been verified using special techniques.
•Book
The temporal logic of reactive and concurrent systems
Zohar Manna,Amir Pnueli +1 more
- 01 Jan 1992
TL;DR: Temporal logic is a formal tool/language which yields excellent results in specifying reactive systems, and this volume (the first two), offers an introduction to temporal logic and to the computational model for reactive programs which has been developed by the authors as mentioned in this paper.
3K
•Book
Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach
Robert P. Kurshan
- 06 Feb 1995
TL;DR: Theories of L-automaton/L-process, L-matrix, and String Acceptors are compared to Boolean Algebra, which describes the construction of language-based Algebra.
902
Related Papers (5)
Marta Kwiatkowska,Gethin Norman,David Parker +2 more
- 14 Jul 2011
Christel Baier,Joost-Pieter Katoen +1 more
- 25 Apr 2008