Decidable Topologies for Communicating Automata With FIFO and Bag Channels

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-662-44584-6_20
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Decidable Problems for Probabilistic Automata on Infinite Words

2012English

Probabilistic Automata on Finite Words: Decidable and Undecidable Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

GOTICA - Generation of Optimal Topologies by Irregular Cellular Automata

Structural and Multidisciplinary Optimization
ControlSystems EngineeringComputer GraphicsOptimizationComputer Science ApplicationsComputer-Aided DesignSoftware
2016English

Communicating on MIMO Channels With Covariance Information: Antenna Correlation and Coupling

2006English

Communicating With Waves Between Volumes: Evaluating Orthogonal Spatial Channels and Limits on Coupling Strengths

Applied Optics
2000English

Decidable Description Logics of Context With Rigid Roles

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Decidable Containment of Recursive Queries

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2005English

Communicating With Patients

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy