Остановите войну!
for scientists:
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 28 matches
- 1998
- Wil M. P. van der Aalst:
Modeling and Analyzing Interorganizational Workflows. ACSD 1998: 262-272 - Jean-René Beauvais, Roland Houdebine, Paul Le Guernic, Éric Rutten, Thierry Gautier:
A Translation of Statecharts into Signal Approach of Time, Interoperability. ACSD 1998: 52-62 - Krzysztof Bilinski, Erik L. Dagless:
Efficient Approach to Symbolic State Exploration of Complex Parallel Controllers. ACSD 1998: 132-142 - Howard Bowman, Joost-Pieter Katoen:
A True Concurrency Semantics for ET-LOTOS. ACSD 1998: 228-238 - Antonio Cerone, David A. Kearney, George J. Milne:
Integrating the Verification of Timing, Performance and Correctness Properties of Concurrent Systems. ACSD 1998: 109-119 - Jordi Cortadella:
Combining Structural and Symbolic Methods for the Verification of Concurrent Systems. ACSD 1998: 2-7 - Claudio Demartini, Riccardo Sisto:
A Java-based Formal Development Environment for Factory Communication Systems. ACSD 1998: 273-281 - Jörg Desel, Ekkart Kindler:
Proving Correctness of Distributed Algorithms Using High-Level Petri Nets - A Case Study. ACSD 1998: 177-186 - Raymond R. Devillers, Maciej Koutny:
Recursive Nets in the Box Algebra. ACSD 1998: 239-249 - Michael V. Goncharov, Alexander B. Smirnov, Nikolai Starodoubtsev, Ilya V. Klotchkov:
Timing Extensions of STG Model and a Method to Simulate Timed STG Behavior in VHDL Environment. ACSD 1998: 120-129 - Radu Grosu, Gheorghe Stefanescu, Manfred Broy:
Visual Formalisms Revisited. ACSD 1998: 41-51 - Franz Huber, Sascha Molterer, Bernhard Schätz, Oscar Slotosch, Alexander Vilbig:
Traffic Lights - An AutoFocus Case Study. ACSD 1998: 282-294 - Dang Van Hung:
Modeling and Verification of Biphase Mark Protocolsin Duration Calculus Using PVS. ACSD 1998: 88-98 - Alex Kondratyev, Jordi Cortadella, Michael Kishinevsky, Luciano Lavagno, Alexander Taubin, Alexandre Yakovlev:
Identifying State Coding Conflicts in Asynchronous System Specifications Using Petri Net Unfoldings. ACSD 1998: 152-163 - Jainendra Kumar, Carl Pixley:
Logic and Functional Verification in a Commercial Semiconductor Environment. ACSD 1998: 8-15 - Luciano Lavagno:
System-Level Design Models and Implementation Techniques. ACSD 1998: 24-32 - Bilung Lee, Edward A. Lee:
Hierarchical Concurrent Finite State Machines in Ptolemy. ACSD 1998: 34-40 - Toshiyuki Miyamoto, Sadatoshi Kumagai:
Calculating Place Capacity for Petri Nets Using Unfoldings. ACSD 1998: 143-151 - Swarup Mohalik, Ramaswamy Ramanujam:
A Presentation of Regular Languages in the Assumption - Commitment Framework. ACSD 1998: 250-260 - Kazuhiro Nakamura, Satoshi Yamane:
Formal Verification of Real-Time Software by Symbolic Model-Checker. ACSD 1998: 99-108 - Radu Negulescu:
Event-Driven Verification of Switch-Level Correctness Concerns. ACSD 1998: 213-223 - Giovanna Di Marzo Serugendo, Nicolas Guelfi:
Using Object-Oriented Algebraic Nets for the Reverse Engineering of Java Programs: A Case Study. ACSD 1998: 166-176 - Naoshi Uchihira:
How to Make Concurrent Programs Highly Reliable- More than State Space Analysis. ACSD 1998: 16-23 - Antti Valmari, Ilkka Kokkarinen:
Unbounded Verification Results by Finite-State Compositional Techniques: 10any States and Beyond. ACSD 1998: 75-85 - Miroslav N. Velev, Randal E. Bryant:
Verification of Pipelined Microprocessors by Correspondence Checking in Symbolic Ternary Simulation. ACSD 1998: 200-212 - Hagen Völzer:
Verifying Fault Tolerance of Distributed Algorithms Formally - An Example. ACSD 1998: 187-197 - Tomohiro Yoneda, Yutaka Ohtsuka, Märt Saarepera:
Verification of Parameterized Asynchronous Circuits: A Case Study. ACSD 1998: 64-74 - 1st International Conference on Application of Concurrency to System Design (ACSD '98), 23-26 March 1998, Fukushima, Japan. IEEE Computer Society 1998, ISBN 0-8186-8350-3 [contents]
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-05-05 15:40 CEST 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