Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
116 | Dietrich Kuske |
Asynchronous Cellular Automata and Asynchronous Automata for Pomsets. |
CONCUR |
1998 |
DBLP DOI BibTeX RDF |
|
99 | Jean Fanchon, Rémi Morin |
Regular Sets of Pomsets with Autoconcurrency. |
CONCUR |
2002 |
DBLP DOI BibTeX RDF |
|
99 | Manfred Droste, Paul Gastin |
Asynchronous Cellular Automata for Pomsets Without Auto-concurrency. |
CONCUR |
1996 |
DBLP DOI BibTeX RDF |
|
99 | Bard Bloom, Marta Z. Kwiatkowska |
Trade-Offs in True Concurrency: Pomsets and Mazurkiewicz Traces. |
MFPS |
1991 |
DBLP DOI BibTeX RDF |
|
81 | Bastian Dölle |
Transforming Linear Terms of Algebraic Specifications Into Extended Pomsets. |
SNPD |
2006 |
DBLP DOI BibTeX RDF |
|
81 | Zoltán Ésik, Satoshi Okawa |
Series and Parallel Operations on Pomsets. |
FSTTCS |
1999 |
DBLP DOI BibTeX RDF |
|
81 | Luca Aceto |
Full Abstraction for Series-Parallel Pomsets. |
TAPSOFT, Vol.1 |
1991 |
DBLP DOI BibTeX RDF |
|
68 | J. W. de Bakker, J. H. A. Warmerdam |
Metric Pomset Semantics for a Concurrnt Language with Recursion. |
Semantics of Systems of Concurrent Processes |
1990 |
DBLP DOI BibTeX RDF |
pomsets, metric topology, operational semantics, denotational semantics, true concurrency, proof rule |
63 | Dietrich Kuske |
A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets. |
STACS |
2001 |
DBLP DOI BibTeX RDF |
|
63 | Dietrich Kuske, Rémi Morin |
Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
63 | Gian-Luigi Ferrari 0002, Ugo Montanari |
The Observation Algebra of Spatial Pomsets. |
CONCUR |
1991 |
DBLP DOI BibTeX RDF |
|
55 | Irrinki Gnana Sudha, R. S. Selvaraj |
MacWilliams type identities for linear codes on certain pomsets: Chain, direct and ordinal sum of pomsets. |
Discret. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Dietrich Kuske |
Infinite Series-Parallel Posets: Logic and Languages. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
|
53 | Haim Gaifman |
Modeling concurrency by partial orders and nonlinear transition systems. |
REX Workshop |
1988 |
DBLP DOI BibTeX RDF |
pomset, causal precedence, concurrent, computation, process, event, deadlock, partial order, action, state, transition system, automaton, shared resource, dining philosophers, simultaneous |
45 | Stephen D. Brookes |
Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes. |
CONCUR |
2002 |
DBLP DOI BibTeX RDF |
|
45 | Dietrich Kuske |
Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable. |
Developments in Language Theory |
2001 |
DBLP DOI BibTeX RDF |
|
45 | Stéphane Grumbach, Tova Milo |
An Algebra for Pomsets. |
ICDT |
1995 |
DBLP DOI BibTeX RDF |
|
36 | Hamdi Yahyaoui, Mourad Debbabi, Nadia Tawbi |
A Denotational Semantic Model for Validating JVML/CLDC Optimizations under Isabelle/HOL. |
QSIC |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Benedikt Bollig |
On the Expressiveness of Asynchronous Cellular Automata. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Harro Wimmel, Lutz Priese |
Algebraic Characterization of Petri Net Pomset Semantics. |
CONCUR |
1997 |
DBLP DOI BibTeX RDF |
|
36 | Joan Feigenbaum, Jeremy A. Kahn, Carsten Lund |
Complexity Results for POMSET Languages. |
CAV |
1991 |
DBLP DOI BibTeX RDF |
|
36 | David K. Probst, Hon Fung Li |
Using Partial-Order Semantics to Avoid the State Explosion Problem in Asynchronous Systems. |
CAV |
1990 |
DBLP DOI BibTeX RDF |
delay-insensitive system, branching point, recurrence structure, behavior machine, behavior state, model checking, state explosion, partial-order semantics |
36 | John-Jules Ch. Meyer, Erik P. de Vink |
Pomset Semantics for True Concurrency with Synchronization and Recursion (Extended Abstract). |
MFCS |
1989 |
DBLP DOI BibTeX RDF |
|
33 | Antoni W. Mazurkiewicz |
Compositional Semantics of Pure Place/ Transition Systems. |
European Workshop on Applications and Theory of Petri Nets |
1987 |
DBLP DOI BibTeX RDF |
pomsets, Petri nets, semantics, concurrency, modularity, algebras, Compositionality |
27 | Amazigh Amrane, Hugo Bazille, Emily Clement, Uli Fahrenberg, Krzysztof Ziemianski |
Presenting Interval Pomsets with Interfaces. |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
27 | Luc Edixhoven, Sung-Shik Jongmans, José Proença, Ilaria Castellani |
Branching pomsets: Design, expressiveness and applications to choreographies. |
J. Log. Algebraic Methods Program. |
2024 |
DBLP DOI BibTeX RDF |
|
27 | Wen Ma, Jinquan Luo |
MacWilliams Type Identities for Linear Block Codes on Certain Pomsets. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
27 | Luc Edixhoven, Sung-Shik Jongmans, José Proença, Guillermina Cledou |
Branching Pomsets for Choreographies. |
ICE |
2022 |
DBLP DOI BibTeX RDF |
|
27 | Luc Edixhoven, Sung-Shik Jongmans |
Realisability of Branching Pomsets. |
FACS |
2022 |
DBLP DOI BibTeX RDF |
|
27 | Radha Jagadeesan, Alan Jeffrey, James Riely |
Pomsets with preconditions: a simple model of relaxed memory. |
Proc. ACM Program. Lang. |
2020 |
DBLP DOI BibTeX RDF |
|
27 | Paul Brunet, David J. Pym |
Pomsets with Boxes: Protection, Separation, and Locality in Concurrent Kleene Algebra. |
FSCD |
2020 |
DBLP DOI BibTeX RDF |
|
27 | Paul Brunet, David J. Pym |
Pomsets with Boxes: Protection, Separation, and Locality in Concurrent Kleene Algebra. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
27 | Roberto Guanciale, Emilio Tuosto |
Realisability of pomsets. |
J. Log. Algebraic Methods Program. |
2019 |
DBLP DOI BibTeX RDF |
|
27 | Roberto Guanciale |
DiRPOMS: Automatic Checker of Distributed Realizability of POMSets. |
COORDINATION |
2019 |
DBLP DOI BibTeX RDF |
|
27 | Roberto Guanciale, Emilio Tuosto |
Realisability of Pomsets via Communicating Automata. |
ICE |
2018 |
DBLP DOI BibTeX RDF |
|
27 | Thomas Chatain, Maurice Comlan, David Delfieu, Loïg Jezequel, Olivier H. Roux |
Pomsets and Unfolding of Reset Petri Nets. |
LATA |
2018 |
DBLP DOI BibTeX RDF |
|
27 | Dan Teodosiu 0001 |
A Truly Concurrent Process Semantics over Multi-Pomsets of Consumable Resources. |
MFPS |
2012 |
DBLP DOI BibTeX RDF |
|
27 | Thomas Gazagnaire, Loïc Hélouët |
Event Correlation with Boxed Pomsets. |
FORTE |
2007 |
DBLP DOI BibTeX RDF |
|
27 | Dietrich Kuske |
Towards a language theory for infinite N-free pomsets. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
27 | Dietrich Kuske, Rémi Morin |
Pomsets for Local Trace Languages. |
J. Autom. Lang. Comb. |
2002 |
DBLP DOI BibTeX RDF |
|
27 | Paul Gastin, Michael W. Mislove |
A truly concurrent semantics for a process algebra using resource pomsets. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
27 | Manfred Droste, Paul Gastin, Dietrich Kuske |
Asynchronous cellular automata for pomsets. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
27 | Stéphane Grumbach, Tova Milo |
An Algebra for Pomsets. |
Inf. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
27 | Joost-Pieter Katoen, Lennard Lambert |
Pomsets for MSC. |
FBT |
1998 |
DBLP BibTeX RDF |
|
27 | Józef Winkowski |
Concatenable Weighted Pomsets and Their Applications to Modelling Processes of Petri Nets. |
Fundam. Informaticae |
1996 |
DBLP DOI BibTeX RDF |
|
27 | Arend Rensink |
Algebra and Theory of Order-Deterministic Pomsets. |
Notre Dame J. Formal Log. |
1996 |
DBLP DOI BibTeX RDF |
|
27 | Gordon D. Plotkin, Vaughan R. Pratt |
Teams can see pomsets. |
Partial Order Methods in Verification |
1996 |
DBLP DOI BibTeX RDF |
|
27 | Jay L. Gischer |
The Equational Theory of Pomsets. |
Theor. Comput. Sci. |
1988 |
DBLP DOI BibTeX RDF |
|
18 | Robert Lorenz 0001, Gabriel Juhás |
Towards Synthesis of Petri Nets from Scenarios. |
ICATPN |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Irina B. Virbitskaite, Natalya S. Gribovskaja |
Open Maps and Trace Semantics for Timed Partial Order Models. |
Ershov Memorial Conference |
2003 |
DBLP DOI BibTeX RDF |
timed event structures, trace equivalence, Category theory, partial order semantics |
18 | Vaughan R. Pratt |
Event-State Duality: The Enriched Case. |
CONCUR |
2002 |
DBLP DOI BibTeX RDF |
|
18 | Carmelo Del Valle, Miguel Toro, Rafael Ceballos, Jesús S. Aguilar-Ruiz |
A Pomset-Based Model for Estimating Workcells' Setups in Assembly Sequence Planning. |
IBERAMIA |
2002 |
DBLP DOI BibTeX RDF |
|
18 | Dietrich Kuske |
Emptiness Is Decidable for Asynchronous Cellular Machines. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
18 | Glynn Winskel |
Event Structures as Presheaves -Two Representation Theorems. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
18 | Kim Sunesen, Mogens Nielsen |
Behavioural Equivalence for Infinite Systems - Partially Decidable! |
Application and Theory of Petri Nets |
1996 |
DBLP DOI BibTeX RDF |
Behavioural Equivalence, Petri Nets, Decidability, Process Calculi, Partial Order Methods |
18 | David K. Probst, Hon Fung Li |
Verifying Timed Behavior Automata with Input/Output Critical Races. |
CAV |
1993 |
DBLP DOI BibTeX RDF |
|
18 | Vladimiro Sassone, Mogens Nielsen, Glynn Winskel |
Deterministic Behavioural Models for Concurrency. |
MFCS |
1993 |
DBLP DOI BibTeX RDF |
|
18 | Gian-Luigi Ferrari 0002 |
On Causality Observed Incrementally, Finally. |
TAPSOFT, Vol.1 |
1991 |
DBLP DOI BibTeX RDF |
|
18 | Antoni W. Mazurkiewicz |
Concurrency, Modularity, and Synchronization. |
MFCS |
1989 |
DBLP DOI BibTeX RDF |
|
18 | Mogens Nielsen, Uffe Engberg, Kim S. Larsen |
Fully abstract models for a process language with refinement. |
REX Workshop |
1988 |
DBLP DOI BibTeX RDF |
change of atomicity, noninterleaved models, labelled partial orders, semiwords, concurrency, full abstraction |