Lecture Notes in Computer Science - Formal Techniques for Networked and Distributed Systems – FORTE 2007
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540731955, 9783540731962

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Simple Positive Flows Computation Algorithm for a Large Subclass of Colored Nets

Lecture Notes in Computer Science - Formal Techniques for Networked and Distributed Systems – FORTE 2007 ◽

10.1007/978-3-540-73196-2_12 ◽

2007 ◽

pp. 177-195 ◽

Cited By ~ 1

Author(s):

S. Evangelista ◽

C. Pajault ◽

J. F. Pradat-Peyre

Keyword(s):

Computation Algorithm

Formal Analysis of Publish-Subscribe Systems by Probabilistic Timed Automata

Lecture Notes in Computer Science - Formal Techniques for Networked and Distributed Systems – FORTE 2007 ◽

10.1007/978-3-540-73196-2_16 ◽

2007 ◽

pp. 247-262 ◽

Cited By ~ 8

Author(s):

Fei He ◽

Luciano Baresi ◽

Carlo Ghezzi ◽

Paola Spoletini

Keyword(s):

Timed Automata ◽

Formal Analysis ◽

Probabilistic Timed Automata

Verifying Erlang/OTP Components in μCRL

Lecture Notes in Computer Science - Formal Techniques for Networked and Distributed Systems – FORTE 2007 ◽

10.1007/978-3-540-73196-2_15 ◽

2007 ◽

pp. 227-246 ◽

Cited By ~ 3

Author(s):

Qiang Guo

Towards Modal Logic Formalization of Role-Based Access Control with Object Classes

Lecture Notes in Computer Science - Formal Techniques for Networked and Distributed Systems – FORTE 2007 ◽

10.1007/978-3-540-73196-2_7 ◽

2007 ◽

pp. 97-111 ◽

Cited By ~ 3

Author(s):

Junghwa Chae

Keyword(s):

Modal Logic ◽

Access Control ◽

Role Based Access Control ◽

Object Classes ◽

Role Based

State Isomorphism in Model Programs with Abstract Data Structures

Lecture Notes in Computer Science - Formal Techniques for Networked and Distributed Systems – FORTE 2007 ◽

10.1007/978-3-540-73196-2_8 ◽

2007 ◽

pp. 112-127 ◽

Cited By ~ 1

Author(s):

Margus Veanes ◽

Juhan Ernits ◽

Colin Campbell

Keyword(s):

Data Structures ◽

Abstract Data ◽

Model Programs

Identifying Acceptable Common Proposals for Handling Inconsistent Software Requirements

Lecture Notes in Computer Science - Formal Techniques for Networked and Distributed Systems – FORTE 2007 ◽

10.1007/978-3-540-73196-2_19 ◽

2007 ◽

pp. 296-308 ◽

Cited By ~ 3

Author(s):

Kedian Mu ◽

Zhi Jin

Keyword(s):

Software Requirements

Robustness in Interaction Systems

Lecture Notes in Computer Science - Formal Techniques for Networked and Distributed Systems – FORTE 2007 ◽

10.1007/978-3-540-73196-2_21 ◽

2007 ◽

pp. 325-340 ◽

Cited By ~ 6

Author(s):

Mila Majster-Cederbaum ◽

Moritz Martens

New Bisimulation Semantics for Distributed Systems

Lecture Notes in Computer Science - Formal Techniques for Networked and Distributed Systems – FORTE 2007 ◽

10.1007/978-3-540-73196-2_10 ◽

2007 ◽

pp. 143-159 ◽

Cited By ~ 6

Author(s):

David de Frutos-Escrig ◽

Fernando Rosa-Velardo ◽

Carlos Gregorio-Rodríguez

Keyword(s):

Distributed Systems

The DHCP Failover Protocol: A Formal Perspective

Lecture Notes in Computer Science - Formal Techniques for Networked and Distributed Systems – FORTE 2007 ◽

10.1007/978-3-540-73196-2_14 ◽

2007 ◽

pp. 211-226 ◽

Cited By ~ 3

Author(s):

Rui Fan ◽

Ralph Droms ◽

Nancy Griffeth ◽

Nancy Lynch

Transactional Reduction of Component Compositions

Lecture Notes in Computer Science - Formal Techniques for Networked and Distributed Systems – FORTE 2007 ◽

10.1007/978-3-540-73196-2_22 ◽

2007 ◽

pp. 341-357 ◽

Cited By ~ 3

Author(s):

Serge Haddad ◽

Pascal Poizat

Lecture Notes in Computer Science - Formal Techniques for Networked and Distributed Systems – FORTE 2007Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

A Simple Positive Flows Computation Algorithm for a Large Subclass of Colored Nets

Formal Analysis of Publish-Subscribe Systems by Probabilistic Timed Automata

Verifying Erlang/OTP Components in μCRL

Towards Modal Logic Formalization of Role-Based Access Control with Object Classes

State Isomorphism in Model Programs with Abstract Data Structures

Identifying Acceptable Common Proposals for Handling Inconsistent Software Requirements

Robustness in Interaction Systems

New Bisimulation Semantics for Distributed Systems

The DHCP Failover Protocol: A Formal Perspective

Transactional Reduction of Component Compositions

Lecture Notes in Computer Science - Formal Techniques for Networked and Distributed Systems – FORTE 2007
Latest Publications