default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 33 matches
- 1996
- L. Braga, Roberto Manione, P. Renditore:
A Formal Description Language for the Modelling and Simulation of Timed Interaction Diagrams. FORTE 1996: 245-260 - Ed Brinksma:
Using Formal Methods: if you're so smart how come you ain't rich? FORTE 1996: 329 - Ed Brinksma, Arend Rensink, Walter Vogler:
Applications of Fair Testing. FORTE 1996: 145-160 - Manfred Broy:
Formal Description Techniques - How Formal and Descriptive are they? FORTE 1996: 95-110 - M. Bütow, Mark Mestern, C. Schapiro, Pieter S. Kritzinger:
Performance Modelling with the Formal Specification Language SDL. FORTE 1996: 213-228 - Ghassan Chehaibar, Hubert Garavel, Laurent Mounier, Nadia Tawbi, Ferruccio Zulian:
Specification and Verification of the PowerScaleTM Bus Arbitration Protocol: An Industrial Experiment with LOTOS. FORTE 1996: 435-450 - Jean-Michel Couvreur, Denis Poitrenaud:
Model Checking Based on Occurrence Net Graph. FORTE 1996: 380-395 - André A. S. Danthine:
The Video Dial Tone Service and the ATM Environment. FORTE 1996: 3-25 - John Derrick, Howard Bowman, Eerke A. Boiten, Maarten Steen:
Comparing LOTOS and Z Refinement Relations. FORTE 1996: 501-516 - Marc Diefenbruch, Jörg Hintelmann, Bruno Müller-Clostermann:
The QUEST-Approach for the Performance Evaluation of SDL-Systems. FORTE 1996: 229-244 - Stefan Fischer:
Implementation of Multimedia Systems based on Real-Time Extensions of Estelle. FORTE 1996: 310-326 - Hubert Garavel, Mihaela Sighireanu:
On the Introduction of Exceptions in E-LOTOS. FORTE 1996: 469-484 - Roland Groz, Olivier Charles, Josiane Renévot:
Relating Conformance Test Coverage to Formal Specifications. FORTE 1996: 195-210 - Hiroki Horiuchi, Tetsuya Kuroki, Sadao Obana, Kenji Suzuki:
EPER: Efficient Parallel Encoding Rules for ASN.1. FORTE 1996: 179-194 - Philipp Hoschka:
Automating Performance Optimisation by Heuristic Analysis of a Formal Specification. FORTE 1996: 77-92 - Samuel Huang, David Lee, Mark G. Staskauskas:
Validation-Based Test Sequence Generation for Networks of Extended Finite State Machines. FORTE 1996: 403-418 - Eurico Inocêncio, Manuel Ricardo, Hitoshi Sato, Toshimitsu Kashima:
Combined Application of SDL-92, OMT, MSC and TTCN. FORTE 1996: 451-466 - Wolfgang Kellerer, Andreas Iselt, R. Riek:
Using SDL for the Specification, Simulation and Implementation of an Advanced OSI Data-Link Protocol on an Embedded Microcontroller System. FORTE 1996: 419-434 - Stephan Kleuker:
Using Formal Methods in the Development of Protocols for Multi-User Multimedia Systems. FORTE 1996: 113-128 - David Larrabeiti, Juan Quemada, Santiago Pavón:
From LOTOS to Petri Nets through Iexpansion. FORTE 1996: 485-500 - Mark Lawford, Jonathan S. Ostroff, Walter Murray Wonham:
Model Reduction of Modules for State-Even Temporal Logics. FORTE 1996: 263-278 - Lothar F. Mackert:
Network Computing. FORTE 1996: 399 - Nikolai Mansurov, Alexei S. Ragozin, Andrew V. Chernov, I. V. Mansurov:
Tool Support for Algebraic Specifications of Dat in SDL-92. FORTE 1996: 61-76 - Andreas Mitschele-Thiel, Peter Langendörfer, Ralf Henke:
Design and Optimization of High-Performance Protocols with the DO-IT Toolbox. FORTE 1996: 45-60 - Simon Mørk, Jens Chr. Godskesen, Michael R. Hansen, Robin Sharp:
A Timed Semantics for SDL. FORTE 1996: 295-309 - Akio Nakata, Teruo Higashino, Kenichi Taniguchi:
Time-Action Alternating Model for Timed LOTOS and its Symbolic Verification of Bisimulation Equivalence. FORTE 1996: 279-294 - Martín Llamas Nistal, Juan Quemada, Manuel J. Fernández-Iglesias:
Direct Verification of Bisimulations. FORTE 1996: 349-363 - Alexandre Petrenko, Nina Yevtushenko, Gregor von Bochmann:
Fault Models for Testing in Context. FORTE 1996: 163-178 - Tsvetomir P. Petrov, Anna Pogosyants, Stephen J. Garland, Victor Luchangco, Nancy A. Lynch:
Computer-Assisted Verification of an Algorithm for Concurrent Timestamps. FORTE 1996: 29-44 - Yves-Marie Quemener, Thierry Jéron:
Finitely Representing Infinite Reachability Graphs of CFSMs with Graph Grammars. FORTE 1996: 364-379
skipping 3 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-17 09:14 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint