![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 37 matches
- 2011
- Wil M. P. van der Aalst
, Arya Adriansyah, Boudewijn F. van Dongen
:
Causal Nets: A Modeling Language Tailored towards Process Discovery. CONCUR 2011: 28-42 - Parosh Aziz Abdulla:
Carrying Probabilities to the Infinite World. CONCUR 2011: 1-16 - Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík
, Chih-Duo Hong
, Richard Mayr, Tomás Vojnar
:
Advanced Ramsey-Based Büchi Automata Inclusion Testing. CONCUR 2011: 187-202 - Christel Baier, Joachim Klein
, Sascha Klüppelholz
:
A Compositional Framework for Controller Synthesis. CONCUR 2011: 512-527 - Michael Benedikt
, Rastislav Lenhardt, James Worrell
:
Two Variable vs. Linear Temporal Logic in Model Checking and Games. CONCUR 2011: 497-511 - Benedikt Bollig:
An Automaton over Data Words That Captures EMSO Logic. CONCUR 2011: 171-186 - Patricia Bouyer, Kim G. Larsen
, Nicolas Markey
, Ocan Sankur, Claus R. Thrane:
Timed Automata Can Always Be Made Implementable. CONCUR 2011: 76-91 - Tomás Brázdil, Jan Krcál, Jan Kretínský, Vojtech Rehák:
Fixed-Delay Events in Generalized Semi-Markov Processes Revisited. CONCUR 2011: 140-155 - Roberto Bruni
, Hernán C. Melgratti, Ugo Montanari:
A Connector Algebra for P/T Nets Interactions. CONCUR 2011: 312-326 - Byron Cook, Christoph Haase
, Joël Ouaknine
, Matthew J. Parkinson, James Worrell
:
Tractable Reasoning in a Fragment of Separation Logic. CONCUR 2011: 235-249 - Silvia Crafa, Francesco Ranzato:
A Spectrum of Behavioral Relations over LTSs on Probability Distributions. CONCUR 2011: 124-139 - Wojciech Czerwinski, Piotr Hofman
, Slawomir Lasota
:
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. CONCUR 2011: 528-542 - Romain Demangeon, Kohei Honda:
Full Abstraction in a Subtyped pi-Calculus with Linear Types. CONCUR 2011: 280-296 - Jasmin Fisher
, Thomas A. Henzinger, Dejan Nickovic, Nir Piterman
, Anmol V. Singh, Moshe Y. Vardi:
Dynamic Reactive Modules. CONCUR 2011: 404-418 - Eli Gafni, Rachid Guerraoui:
Generalized Universality. CONCUR 2011: 17-27 - Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke:
On Causal Semantics of Petri Nets. CONCUR 2011: 43-59 - Stefan Göller, Anthony Widjaja Lin:
Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems. CONCUR 2011: 543-558 - Jonathan Hayman:
Granularity and Concurrent Separation Logic. CONCUR 2011: 219-234 - Chaodong He:
The Decidability of the Reachability Problem for CCS! CONCUR 2011: 373-388 - Frédéric Herbreteau, B. Srivathsan
:
Coarse Abstractions Make Zeno Behaviours Difficult to Detect. CONCUR 2011: 92-107 - C. A. R. Hoare, Akbar Hussain, Bernhard Möller, Peter W. O'Hearn, Rasmus Lerchedahl Petersen, Georg Struth:
On Locality and the Exchange Law for Concurrent Processes. CONCUR 2011: 250-264 - Hans Hüttel
:
Typed ψ-calculi. CONCUR 2011: 265-279 - Vineet Kahlon:
Reasoning about Threads with Bounded Lock Chains. CONCUR 2011: 450-465 - Lars Kuhtz, Bernd Finkbeiner:
Weak Kripke Structures and LTL. CONCUR 2011: 419-433 - Ivan Lanese
, Claudio Antares Mezzina
, Alan Schmitt, Jean-Bernard Stefani:
Controlling Reversibility in Higher-Order Pi. CONCUR 2011: 297-311 - Ruggero Lanotte
, Massimo Merro
:
Semantic Analysis of Gossip Protocols for Wireless Sensor Networks. CONCUR 2011: 156-170 - Jérôme Leroux:
Vector Addition System Reversible Reachability Problem. CONCUR 2011: 327-341 - Joël Ouaknine
, Hristina Palikareva, A. W. Roscoe, James Worrell
:
Static Livelock Analysis in CSP. CONCUR 2011: 389-403 - Paritosh K. Pandya, Simoni S. Shah:
On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic Freezing. CONCUR 2011: 60-75 - M. Praveen, Kamal Lodaya:
Parameterized Complexity Results for 1-safe Petri Nets. CONCUR 2011: 358-372
skipping 7 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-01 02:27 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