default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID18th ACSD 2018: Bratislava, Slovakia
- 18th International Conference on Application of Concurrency to System Design, ACSD 2018, Bratislava, Slovakia, June 25-29, 2018. IEEE Computer Society 2018, ISBN 978-1-5386-7013-2
State-Space Construction and Reachability
- Benjamin Smith, Gianfranco Ciardo
:
SOUPS: A Variable Ordering Metric for the Saturation Algorithm. 1-10 - Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig, Marco Montali, Othmane Rezine:
Complexity of Reachability for Data-Aware Dynamic Systems. 11-20
Time
- Étienne André, Didier Lime, Mathias Ramparison:
Timed Automata with Parametric Updates. 21-29 - Hanifa Boucheneb, Didier Lime, Olivier H. Roux, Charlotte Seidner:
Optimal-Cost Reachability Analysis Based on Time Petri Nets. 30-39 - Bram van der Sanden, Marc Geilen, Michel A. Reniers, Twan Basten:
Partial-Order Reduction for Performance Analysis of Max-Plus Timed Systems. 40-49
Process Models
- Vincent Bloemen, Jaco van de Pol, Wil M. P. van der Aalst:
Symbolically Aligning Observed and Modelled Behaviour. 50-59 - Dennis Schmitz, Daniel Moldt, Michael Haustermann, David Mosteller, Christian Röder:
Team Coordination Based on Causal Nets with Synchronous Channels. 60-69
Fault, Suspicion and Concurrency!
- Bowen Li, Brian Randell, Anirban Bhattacharyya, Talal Alharbi, Maciej Koutny:
SONCraft: A Tool for Construction, Simulation, and Analysis of Structured Occurrence Nets. 70-74 - Loïc Hélouët, Hervé Marchand, John Mullins:
Concurrent Secrets with Quantified Suspicion. 75-84 - Ayleen Schinko, Walter Vogler:
Fault-Free Refinements for Interface Automata. 85-94
System Design
- Alexander Schulz-Rosengarten, Steven Smyth, Reinhard von Hanxleden, Michael Mendler:
On Reconciling Concurrency, Sequentiality and Determinacy for Reactive Systems - A Sequentially Constructive Circuit Semantics for Esterel. 95-104 - Fatma Jebali, Dumitru Potop-Butucaru:
Ensuring Consistency between Cycle-Accurate and Instruction Set Simulators. 105-114 - Markus Anders, Anoop Bhagyanath, Klaus Schneider:
On Memory Optimal Code Generation for Exposed Datapath Architectures with Buffered Processing Units. 115-124
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.
last updated on 2026-09-02 00:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
