Communicating sequential processes
Communicating sequential processes
Actors: a model of concurrent computation in distributed systems
Actors: a model of concurrent computation in distributed systems
Denotational semantics of a parallel object-oriented language
Information and Computation
Proceedings of the Fourth Annual Symposium on Logic in computer science
ABCL: an object-oriented concurrent system
ABCL: an object-oriented concurrent system
Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
A calculus of mobile processes, II
Information and Computation
A compositional protocol verification using relativized bisimulation
Information and Computation
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
RTsynchronizer: language support for real-time specifications in distributed systems
LCTES '95 Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, & tools for real-time systems
Actor languages. their syntax, semantics, translation, and equivalence
Theoretical Computer Science
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Model checking
A methodology for hardware verification using compositional model checking
Science of Computer Programming - Special issue on mathematics of program construction
Information and Computation - Special issue on FLOC '96
Tool-supported program abstraction for finite-state verification
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Distributed Algorithms
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Programming dynamically reconfigurable open systems with SALSA
ACM SIGPLAN Notices
Composable Semantic Models for Actor Theories
Higher-Order and Symbolic Computation
Actor theories in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Revised Lectures from the International Symposium on Compositionality: The Significant Difference
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Modularization and Abstraction: The Keys to Practical Formal Verification
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Closing Open SDL-Systems for Model Checking with DTSpin
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
MOCHA: Modularity in Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
A Proof System for the Language POOL
Proceedings of the REX School/Workshop on Foundations of Object-Oriented Languages
The Structure and Semantics of Actor Languages
Proceedings of the REX School/Workshop on Foundations of Object-Oriented Languages
A foundation for actor computation
Journal of Functional Programming
A Front-End Tool for Automated Abstraction and Modular Verification of Actor-Based Models
ACSD '04 Proceedings of the Fourth International Conference on Application of Concurrency to System Design
Coordinating Object Oriented Components Using Data-Flow Networks
Formal Methods for Components and Objects
Dynamic Consistency in Process Algebra: From Paradigm to ACP
Electronic Notes in Theoretical Computer Science (ENTCS)
Slicing-based Reductions for Rebeca
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Verification of the IEEE 802.1D Spanning Tree Protocol Using Extended Rebeca
Electronic Notes in Theoretical Computer Science (ENTCS)
Semi-distributed LTL model checking for actor based modeling languages
SoftCOM'09 Proceedings of the 17th international conference on Software, Telecommunications and Computer Networks
Formal analysis of policy-based self-adaptive systems
Proceedings of the 2010 ACM Symposium on Applied Computing
Rebeca: theory, applications, and tools
FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
PobSAM: Policy-based Managing of Actors in Self-Adaptive Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Actor-based slicing techniques for efficient reduction of Rebeca models
Science of Computer Programming
Computers and Electrical Engineering
Sysfier: Actor-based formal verification of SystemC
ACM Transactions on Embedded Computing Systems (TECS)
Ten years of analyzing actors: Rebeca experience
Formal modeling
Context-based behavioral equivalence of components in self-adaptive systems
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Correct transformation: From object-based graph grammars to PROMELA
Science of Computer Programming
Bounded rational search for on-the-fly model checking of LTL properties
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Compositional semantics of an actor-based language using constraint automata
COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages
Efficient symmetry reduction for an actor-based model
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Formal Analysis of SystemC Designs in Process Algebra
Fundamenta Informaticae
Using coordinated actors to model families of distributed systems
COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages
Hi-index | 0.00 |
Actor-based modeling has been successfully applied to the representation of concurrent and distributed systems. Besides having an appropriate and efficient way for modeling these systems, one needs a formal verification approach for ensuring their correctness. In this paper, we develop an actor-based model for describing such systems, use temporal logic to specify properties of the model, and apply different abstraction and verification methods for verifying that the model meets its specification. We use a compositional verification approach for verifying safety properties of these models. For that we introduce a notion of component, based on an user-defined decomposition of the model. Components are more abstract than the model itself, and so we can reduce the state space of the model which makes it more amenable to model checking techniques. We prove that our abstraction technique preserves a set of behavioral specifications in temporal logic. The soundness of the abstraction is proved by the weak simulation relation between the constructs.